Advanced Search

Journal Navigation

Journal Home

Subscriptions

Archive

Contact Us

Table of Contents

Click here to sign up for SAGE Journal Email Alerts today!

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 Articles by Kanayama, Y.
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?

Near-Minimum-Energy Paths on a Vertical-Axis Cone With Anisotropic Friction and Gravity Effects

Neil C. Rowe

Department of Computer Science U.S. Naval Postgraduate School Monterey. California 93943

Yutaka Kanayama

Department of Computer Science U.S. Naval Postgraduate School Monterey. California 93943

We determine near-optimal paths with respect to work against friction and gravity on the surface of a vertical-axis ideal cone, assuming a moving agent of negligible size, friction propor tional to the normal force, and power-maximum and stability limitations on the agent. This can provide good paths across hilly terrain for mobile robots. Our previous work required difficult-to-obtain polyhedral terrain models; cone surface patches permit easier and better models. We prove that our near-optimal paths on a vertical-axis cone surface are not much more complex than on polyhedra: There are qualitatively 22 kinds of path behavior (as opposed to four on a polyhedral face), and the area of the surface optimally reachable from a fixed start point by a given qualitative behavior has mathemat ically simple boundaries (only line segments, circle arcs, and arcs of logarithmic spirals in azimuth projection). We examine the possible cases based on agent characteristics and cone steepness and provide "behavior maps" for quickly finding near-optimal paths between any two points on the cone surface. Our models incorporate discontinuous effects with respect to traversal heading. Comparisons with a program using uniform- grid path planning show our methods run considerably, faster in less space, and our paths are much simpler to describe and easier to follow in the real world.

The International Journal of Robotics Research, Vol. 13, No. 5, 408-433 (1994)
DOI: 10.1177/027836499401300503
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?