Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Sign In to gain access to subscriptions and/or personal tools.
The International Journal of Robotics Research
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to Saved Citations
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Request Reprints
Right arrow Add to My Marked Citations
Citing Articles
Right arrow Citing Articles via Google Scholar
Right arrow Citing Articles via Scopus
Google Scholar
Right arrow Articles by Rowe, N. C.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Complore   Add to Connotea   Add to Del.icio.us   Add to Digg   Add to Reddit   Add to Technorati   Add to Twitter  
What's this?

Obtaining Optimal Mobile-Robot Paths with Nonsmooth Anisotropic Cost Functions Using Qualitative-State Reasoning

Neil C. Rowe

Department of Computer Science Naval Postgraduate School Monterey, CA USA 93943

Realistic path-planning problems frequently show anisotropism, dependency of traversal cost or feasibility on the traversal heading. Gravity, friction, visibility, and safety are often anisotropic for mobile robots. Anisotropism often differs qualitatively with heading, as when a vehicle has insufficient power to go uphill or must brake to avoid accelerating down hill. Modeling qualitative distinctions requires discontinuities in either the cost-per-traversal-distance function or its derivatives, preventing direct application of most results of the calculus of variations. We present a new approach to optimal anisotropic path planning that first identifies qualitative states and per missible transitions between them. If the qualitative states are chosen appropriately, our approach replaces an optimization problem with such discontinuities by a set of subproblems with out discontinuities, subproblems for which optimization is likely to be faster and less troublesome. Then the state space in the near neighborhood of any particular state can be partitioned into "behavioral regions" representing states optimally reach able by single qualitative "behaviors, " sequences of qualitative states in a finite-state diagram. Simplification of inequalities and other methods can identify the behavioral regions. Our ideas solve problems that are not easily solvable any other way, especially problems with what we define as "turn-hostile" anisotropism. We illustrate our methods on two examples, navigation on an arbitrarily curved surface with gravity and friction effects (for which we show much better performance than a previously published program 22 times longer), and flight of a simple missile.

The International Journal of Robotics Research, Vol. 16, No. 3, 375-399 (1997)
DOI: 10.1177/027836499701600307


Add to CiteULike CiteULike   Add to Complore Complore   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us   Add to Digg Digg   Add to Reddit Reddit   Add to Technorati Technorati   Add to Twitter Twitter    What's this?