Multiple Query Probabilistic Roadmap Planning using Single Query Planning Primitives

IEEE International Conference on Intelligent Robots and Systems

Volumn 1, Issue , 2003, Pages 656-661

  Bekris, Kostas E ^a   Chen, Brian Y ^a   Ladd, Andrew M ^a   Plaku, Erion ^a   Kavraki, Lydia E ^a  

^a Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONFIGURATION SPACE; PROBABILISTIC ROADMAP METHOD (PRM);

ALGORITHMS; COSTS; DEGREES OF FREEDOM (MECHANICS); OPTIMIZATION; PARAMETER ESTIMATION; QUERY LANGUAGES; ROBOTICS; TREES (MATHEMATICS);

MOTION PLANNING;

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

References (21)

1. N. Amato, B. Bayazit, L. Dale, C. Jones, and D. Vallejo. Obprm: An obstacle-based prm for 3d workspaces. In P. Agarwal, L. Kavraki, and M. Mason, editors, WAFR, pages 156-168. 1998.
2. N. Amato, K. Dill, and G. Song. Using motion planning to map protein folding landscapes and analyze folding kinetics of known native structures. In RECOMB, pages 2-11, April 2002.
3. M. Apaydin, D. Brutlag, C. Guestrin, D. Hsu, and J. Latombe. Stochastic roadmap simulation: An efficient representation and algorithm for analyzing molecular motion. In RECOMB, April 2002.
4. J. Barraquand and J. Latombe. Robot motion planning: A distributed representation approach. IJRR, 10:628-649, 1991
5. M. de Berg, M. van Kreveld, and M. Overmars. Computational Geometry: Algorithms and Applications. Springer, Berlin, 1997.
6. S. Ehmann and M. Lin. Accurate and fast proximity queries between polyhedra using surface decomposition. Computer Graphics Forum (Proc. of Eurographics), 2001.
7. R. Geraerts and M. Overmars. A comparitive study of probabilistic roadmap planners. In Proc. WAFR, 2002.
8. D. Hsu, R. Kindel, J. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. IJRR, 2001.
9. D. Hsu, J. C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. In ICRA, pages 2719-2726, 1997.
10. P. Isto. Constructing probabilistic roadmaps with powerful local planning and path optimization. In IROS, 2002.
11. L. Kavraki. Random Networks in Configuration Space for Fast Path Planning. PhD thesis, Stanford University, 1995.
12. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. TRA, 12(4):566-580, June 1996.
13. A. Ladd and L. Kavraki. A measure theoretic analysis of prm. In ICRA, May 2002.
14. A. Ladd and L. Kavraki. Motion planning for knot untangling. In WAFR, 2003.
15. F. Lamiraux and L. Kavraki. Planning paths for elastic objects under manipulation constraints. IJRR, 20(3):188-208, 2001.
16. S. LaValle and J. Kuffner. Rapidly-exploring random trees: Progress and prospects. In WAFR, 2000.
17. S. LaValle and J. Kuffner. Randomized kinodynamic planning. IJRR, 5:348-400, May 2001.
18. S. LaValle and J. Kuffner. Rapidly exploring random trees: Progress and prospects. In B. Donald, K. Lynch, and D.Rus, editors, WAFR, pages 293-308. A.K. Peters, 2001.
19. T.-Y. Lie and Y.-C. Shie. An incremental approach to motion planning with roadmap management. In ICRA, 2002.
20. G. Sanchéz and J.-C. Latombe. On delaying collision checking in prm planning - application to multi-robot coordination. IJRR, 21(1):5-16, 2002.
21. M. Yim. Locomotion with a Unit-Modular Reconfigurable Robot. PhD thesis, Stanford Univ., December 1994. Stanford Technical Report STAN-CS-94-1536.