HPRM: A hierarchical PRM

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 3, Issue , 2003, Pages 4433-4438

  Collins, Anne D ^a   Agarwal, Pankaj K ^b   Harer, John L ^c  

^a STANFORD UNIVERSITY   (United States)

^b Duke University   (United States)

^c DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; COLLISION AVOIDANCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; PROBABILITY; RECURSIVE FUNCTIONS; ROBOTIC ARMS;

FAILURE PROBABILITY; PROBABILISTIC ROADMAP METHOD;

MOTION PLANNING;

EID: 0344877411     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. P. K. Agarwal and M. Sharir. Circle shooting in a simple polygon. J. Algorithms, 14(1):69-87, 1993.
2. P.K. Agarwal and J. Erickson. Geometric range searching and its relatives. Advances in Discrete and Comput. Geom. (B. Chazelle, J. Goodman, and R. Pollack, eds.), AMS, Providence, 1998.
3. N.M. Amato, O.B. Bayazit, L.K. Dale, C. Jones, and D. Vallejo. OBPRM: An obstacle-based prm for 3d workspaces. In Proc. of the Workshop on Algorithmic Foundations of Robotics, pages 155-168, March 1998.
4. J.F. Canny. The Complexity of Robot Motion Planning. M. I. T. Press, Cambridge, 1988.
5. B. Chazelle and E. Welzl. Quasi-optimal range searching in spaces of finite VC-dimension. Discrete and Computational Geometry, 4:467-490, 1989.
6. S.-W. Cheng, H. Everett, O. Cheong, and R. van Oostrum. Hierarchical vertical decompositions, ray shooting, and circular arc queries in simple polygons. In Proc. 15th Symp. Comp. Geom., pages 227-236, 1999.
7. A.D. Collins. Configuration Spaces in Robotic Manipulation and Motion Planning. PhD thesis, Duke University, 2002.
8. Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf. Computational Geometry: Algorithms and Applications. Springer-Verlag, Berlin, 1997.
9. V. Guillemin and A. Pollack. Differential Topology. Prentice-Hall, 1974.
10. D. Halperin, L. E. Kavraki, and J.-C. Latombe. Robotics. In Jacob E. Goodman and Joseph O'Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 41, pages 755-778. CRC Press LLC, Boca Raton, FL, 1997.
11. D. Hsu, L. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin. On finding narrow passages with probabilistic roadmap planners. In 3rd Workshop on the Algorithmic Foundations of Robotics, 1998.
12. D. Hsu, J.-C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. Int. J. of Comp. Geom. and Apps, 9(4 & 5):495-512, 1999.
13. L. Kavraki, M.N. Kolountzakis, and J.-C. Latombe. Analysis of probabilistic roadmaps for path planning. IEEE Trans. Rob. Aut., 14(1):166-171, 1998.
14. L. Kavraki, J.-C. Latombe, R. Motwani, and P. Raghavan. Randomized query processing in robot motion planning. In Proc. 27th ACM Symp. on Theory of Computing, pages 353-362, Las Vegas, NV, 1995.
15. L. Kavraki, P. Svestka, J.-C. Latombe, and M. Overmars. Probabilistic roadmaps for path planning in high dimensional configuration spaces. IEEE Trans. on Robotics and Automation, 12(4):566-580, 1996.
16. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1991.
17. J. Matousek. More on cutting arrangements and spanning trees with low stabbing number. Technical Report B-90-2, Freie Universitat Berlin, 1990.
18. J.H. Reif. Complexity of the mover's problem and generalizations. In Proc. of the 20th IEEE Symp. on Foundations of Comp. Sci., pages 421-427, 1979.
19. M. Sharir and P.K. Agarwal. Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press, 1995.