Carnegie Mellon Robotics Institute
David Ferguson and Anthony (Tony) Stentz
Proceedings of the International Symposium on Robotics Research (ISRR), October, 2005.
| Download |
|
| Abstract |
| We present an interpolation-based planning and replanning algorithm for generating smooth paths through non-uniform cost grids. Most grid-based path planners use discrete state transitions that artificially constrain an agent?s motion to a small set of possible headings (e.g. 0 degrees, 45 degrees, 90 degrees, etc). As a result, even the ?optimal? grid planners produce unnatural, suboptimal paths. Our approach uses linear interpolation during planning to calculate accurate path cost estimates for arbitrary positions within each grid cell and to produce paths with a continuous range of headings. Consequently, it is particularly well suited to planning smooth, least-cost trajectories for mobile robots. In this paper, we present a number of applications and results, a comparison to related algorithms, and several implementations on real robotic systems. |
| Notes |
Associated Center(s) / Consortia:
Vision and Autonomous Systems Center and Field Robotics Center Associated Project(s):
CTA Robotics Number of pages: 10 |
| Text Reference |
| David Ferguson and Anthony (Tony) Stentz, "Field D*: An Interpolation-based Path Planner and Replanner," Proceedings of the International Symposium on Robotics Research (ISRR), October, 2005. |
| BibTeX Reference |
|
@inproceedings{Ferguson_2005_5122, author = "David Ferguson and Anthony (Tony) Stentz", title = "Field D*: An Interpolation-based Path Planner and Replanner", booktitle = "Proceedings of the International Symposium on Robotics Research (ISRR)", month = "October", year = "2005", } |
| The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University. Contact Us | Update Instructions |