Field D*: An interpolation-based path planner and replanner

Springer Tracts in Advanced Robotics

Volumn 28, Issue , 2007, Pages

  Ferguson, Dave ^a   Stentz, Anthony ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COST ESTIMATING; COSTS; INTERPOLATION; PLANNING; ROBOT PROGRAMMING;

ARBITRARY POSITIONS; DISCRETE STATE; GRID CELLS; GRID-BASED; LINEAR INTERPOLATION; LOW COSTS; PATH PLANNERS; REPLANNING ALGORITHM;

COST BENEFIT ANALYSIS;

EID: 33947598726     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/978-3-540-48113-3_22     Document Type: Article

References (26)

1. O. Brock and O. Khatib. High-speed navigation using the global dynamic window approach. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 1999.
2. J. Carsten. 3D Field D*. Master's thesis, Carnegie Mellon University, Pittsburgh, PA, 2005.
3. E. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:209-271, 1959.
4. D. Ferguson and A. Stentz. The Field D* Algorithm for Improved Path Planning and Replanning in Uniform and Non-uniform Cost Environments. Technical Report CMU-RI-TR-05-19, Carnegie Mellon School of Computer Science, 2005.
5. P. Hart, N. Nilsson, and B. Rafael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4:100-107, 1968.
6. A. Kelly. An Intelligent Predictive Control Approach to the High Speed Cross Country Autonomous Navigation Problem. PhD thesis, Carnegie Mellon University, 1995.
7. S. Koenig and M. Likhachev. D* Lite. In Proceedings of the National Conference on Artificial Intelligence (AAAI), 2002.
8. S. Koenig and M. Likhachev. Improved fast replanning for robot navigation in unknown terrain. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2002.
9. S. Koenig and M. Likhachev. Incremental A*. In Advances in Neural Information Processing Systems. MIT Press, 2002.
10. K. Konolige. A gradient method for realtime robot control. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), 2000.
11. R. Larson. A survey of dynamic programming computational procedures. IEEE Transactions on Automatic Control, pages 767-774, 1967.
12. R. Larson and J. Casti. Principles of Dynamic Programming, Part 2. Marcel Dekker, New York, 1982.
13. S. LaValle. Planning Algorithms. Cambridge University Press (also available at http://msl.cs.uiuc.edu/planning/), 2006. To be published in 2006.
14. M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun. Anytime Dynamic A*: An Anytime, Replanning Algorithm. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 2005.
15. M. Likhachev, G. Gordon, and S. Thrun. ARA*: Anytime A* with provable bounds on sub-optimality. In Advances in Neural Information Processing Systems. MIT Press, 2003.
16. J. Mitchell. Handbook of Computational Geometry, chapter Geometric Shortest Paths and Network Optimization, pages 633-701. Elsevier Science, 2000.
17. J. Mitchell and C. Papadimitriou. The weighted region problem: finding shortest paths through a weighted planar subdivision. Journal of the ACM, 38:18-73, 1991.
18. N. Nilsson. Principles of Artificial Intelligence. Tioga Publishing Company, 1980.
19. R. Philippsen. Motion Planning and Obstacle Avoidance for Mobile Robots in Highly Cluttered Dynamic Environments. PhD thesis, EPFL, Lausanne, Switzerland, 2004.
20. R. Philippsen and R. Siegwart. An Interpolated Dynamic Navigation Function. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2005.
21. N. Rowe and R. Richbourg. An efficient Snell's-law method for optimal-path planning across two-dimensional irregular homogeneous-cost regions. International Journal of Robotics Research, 9(6):48-66, 1990.
22. J. Sethian. A fast marching level set method for monotonically advancing fronts. Applied Mathematics, Proceedings of the National Academy of Science, 93:1591-1595, 1996.
23. S. Singh, R. Simmons, T. Smith, A. Stentz, V. Verma, A. Yahja, and K. Schwehr. Recent progress in local and global traversability for planetary rovers. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2000.
24. C. Stachniss and W. Burgard. An integrated approach to goal-directed obstacle avoidance under dynamic constraints for dynamic environments. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), 2002.
25. A. Stentz and M. Hebert. A complete navigation system for goal acquisition in unknown environments. Autonomous Robots, 2(2):127-145, 1995.
26. Anthony Stentz. The Focussed D* Algorithm for Real-Time Replanning. In Proceedings of the International Joint Conference on Artificial Intelligence (IJ-CAI), 1995.