Anytime dynamic path-planning with flexible probabilistic roadmaps

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2006, Issue , 2006, Pages 2372-2377

  Belghith, Khaled ^a   Kabanza, Froduald ^a   Hartman, Leo ^b   Nkambou, Roger ^c  

^a UNIVERSITÉ DE SHERBROOKE   (Canada)

^b CANADIAN SPACE AGENCY   (Canada)

^c UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME DYNAMIC PATH PLANNING; PROBABILISTIC ROADMAPS (PRM); REAL-WORLD APPLICATIONS; SUBOPTIMAL SOLUTION;

COMPUTER CONTROL; DEGREES OF FREEDOM (MECHANICS); MOBILE ROBOTS; PROBABILITY; QUALITY ASSURANCE;

MOTION PLANNING;

EID: 33845627364     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2006.1642057     Document Type: Conference Paper

References (16)

1. L. Kavraki, P. Svestka, J. C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high dimensional configuration spaces," in IEEE Transactions on Robotics and Automation, vol. 12, 1996, pp. 566-580.
2. R. Bohlin and L. Kavraki, "Path planning using lazy PRM," in IEEE International Conference on Robotics and Automation, 2000, pp. 521-528.
3. G. Sanchez and J.-C. Latombe, "A single-query bi-directional probabilistic roadmap planner with lazy collision checking," in Ninth International Symposium on Robotics Research, 2001, pp. 403-417.
4. D. Ferguson, M. Likhachev, and A. Stentz, "A guide to heuristic-based path-planning," in ICAPS Workshop on Planning under uncertainty for Autonomous Systems, 2005, pp. 9-18.
5. M. Saha and J.-C. Latombe, "Finding narrow passages with probabilistic roadmaps: The small step retraction method," in Proc. IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, 2005.
6. D. Sent and M. Overmars, "Motion planning in environments with dangerzones," in IEEE International Conference on Robotics and Automation, 2001, pp. 1488-1493.
7. P. Melchior, B. Orsoni, O. Lavialle, A. Poty, and A. Oustaloup, "Consideration of obstacle danger level in path planning using A* and fast-marching optimisation: comparative study," in Signal Processing, vol. 83, no. 11, 2003.
8. M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun, "Any-time dynamic A*: An anytime, replanning algorithm," in International Conference on Automated Planning and Scheduling (ICAPS), 2005.
9. S. Koenig and M. Likhachev, "Improved fast replanning for robot navigation in unknown terrain," in IEEE International Conference on Robotics and Automation (ICRA), 2002.
10. M. Likhachev, G. Gordon, and S. Thrun, "ARA*: Anytime A* search with provable bounds on sub-optimality," in Conference on Neural Information Processing Systems (NIPS), 2003.
11. S. M. LaValle, M. S. Branicky, and S. R. Lindemann, "On the relationship between classical grid search and probabilistic roadmaps," International Journal of Robotics Research, no. 23, pp. 673-692, 2004.
12. D. Hsu, J.-C. Latombe, and H. Kurniawati, "On the probabilistic foundations of probabilistic roadmap planning," in 12th Int. Symp. on Robotics Research, San Francisco, Oct. 2005.
13. T. Dean and M. Boddy, "An analysis of time-dependent planning," in Proc. of National Conference on Artificial Intelligence, 1988.
14. N. Currie and B. Peacock, "International space station robotic systems operations: A human factors perspective," in Habitability and Human Factors Office (HHFO), NASA Johnson Space Center, 2002.
15. D. Hsu, G. Sanchez-Ante, and Z. Sun, "Hybrid PRM sampling with a cost-sensitive adaptive strategy," in Proc. IEEE. Int. Conf. on Robotics and Automation, 2005.
16. B. Burns and O. Brock, "Sampling-based motion planning using predictive models," in Proc. IEEE. Int. Conf. on Robotics and Automation, 2005.