Artificial potential biased probabilistic roadmap method

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2004, Issue 1, 2004, Pages 461-466

  Aarno, Daniel ^a   Kragic, Danica ^a   Christensen, Henrik I ^a  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING; ROBOTICS; ROBOTS; ROBUSTNESS (CONTROL SYSTEMS);

NODE DENSITY; PROBABILISTIC ROADMAP METHODS (PRM);

MOTION PLANNING;

EID: 3042621783     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/robot.2004.1307192     Document Type: Conference Paper

References (16)

1. D. Hsu, L. Kavraki, J. Latombe, R. Motwani, and S. Sorkin, "On finding narrow passages with probabilistic roadmap planners," in Robotics: The algorithmic perspective (L. E. K. P. K. Agrawal and M. Mason, eds.), (Natick, MA), pp. 141-153, A.K. Peters, 1998.
2. Overmars and Svestka, "A probabilistic learning approach to motion planning," in Algorithmic Foundations of Robotics, The 1994 Workshop on the Algorithmic Foundations of Robotics, A. K. Peters (Goldberg, Halperin, Latombe, and Wilson, eds.), 1995.
3. J. Barraquand, L. Kavraki, J. Latombe, T. Li, R. Motwani, and P. Raghavan, "A random sampling scheme for path planning," in Robotics Research (G. Giralt and G. Hirzinger, eds.), pp. 249-264, Springer, 1996.
4. R. Bohlin, Robot Path Planning. PhD thesis, Chalmers university of technology, Göteborg university, 2002.
5. L. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces," Tech. Rep. CS-TR-94-1519, 1994.
6. D. Hsu, T. Jiang, J. Reif, and S. Sun, "The bridge test for sampling narrow passages with probabilistic roadmap planners," IEEE International Conference on Robotics and Automation, 2003.
7. C. I. Connolly and R. A. Grupen, "Applications of harmonic functions to robotics," Tech. Rep. UM-CS-1992-012, Computer and Information Science Department, 1992.
8. E. Rimon and D. E. Koditschek, "Exact robot navigation using artificial potential functions," IEEE on Robotics and Automation, vol. 8, pp. 501-518, October 1992.
9. Y. K. Hwang and N. Ahuja, "Gross motion planning - a survey," ACM Computing Survey, vol. 24, pp. 219 - 291, September 1992.
10. W. E. Boyce and R. C. DiPrima, Elementary Differential Equations and Boundary Value Problems. John Wiley & Sons, Inc, sixth ed., 1997.
11. T. Erikson, H. Christiansson, E. Lindahl, J. Linde, L. Sandberg, and M. Wallin, Fysikens Matematiska Metoder. Teoretisk Fysik, KTH, third ed., 2001.
12. P. Svestka, "On probabilistic completeness and expected complexity of probabilistic path planning," tech. rep., Utrecht University: Information and Computing Sciences., 1996.
13. A. M. Tenenbaum, Y. Langsam, and M. J. Augenstein, Data Structures Using C. Prentice-Hall, Inc, 1990.
14. S. Russell and P. Norvig, Artificial Inteligence: A Modern Approach. Prentice-Hall, Inc, 1995.
15. R. Kindel, D. Hsu, J.-C. Latombe, and S. Rock, "Kinodynamic motion planning amidst moving obstacles," in IEEE International Conference on Robotics and Automation, vol. 1, pp. 537 - 543, 2000.
16. J. H. Reif and M. Sharir, "Motion planning in the presence of moving obstacles," in IEEE Symposium on Foundations of Computer Science, pp. 144-154, 1985.