Carnegie Mellon Robotics Institute
David Ferguson and Anthony (Tony) Stentz
tech. report CMU-RI-TR-05-19, Robotics Institute, Carnegie Mellon University, June, 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 for the agent to traverse. 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 range of continuous 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. |
| Keywords |
| search, path planning, incremental planning, re-planning |
| Notes |
Associated Center(s) / Consortia:
Vision and Autonomous Systems Center and Field Robotics Center Associated Project(s):
CTA Robotics Number of pages: 18 |
| Text Reference |
| David Ferguson and Anthony (Tony) Stentz, "The Field D* Algorithm for Improved Path Planning and Replanning in Uniform and Non-Uniform Cost Environments," tech. report CMU-RI-TR-05-19, Robotics Institute, Carnegie Mellon University, June, 2005 |
| BibTeX Reference |
|
@techreport{Ferguson_2005_5119, author = "David Ferguson and Anthony (Tony) Stentz", title = "The Field D* Algorithm for Improved Path Planning and Replanning in Uniform and Non-Uniform Cost Environments", booktitle = "", institution = "Robotics Institute", month = "June", year = "2005", number= "CMU-RI-TR-05-19", address= "Pittsburgh, PA", } |
| The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University. Contact Us | Update Instructions |