Probabilistic roadmaps of trees for parallel computation of multiple query roadmaps

Springer Tracts in Advanced Robotics

Volumn 15, Issue , 2005, Pages 80-89

  Akinc, Mert ^a   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

MOTION PLANNING; PLANNING; SCHEDULING ALGORITHMS;

HIGH-DIMENSIONAL PROBLEMS; MOTION PLANNING PROBLEMS; PARALLEL COMPUTATION; PROBABILISTIC ROAD MAPS; PROBABILISTIC ROADMAP; PROBABILISTIC ROADMAP METHODS; RAPIDLY-EXPLORING RANDOM TREES; REFINEMENT TECHNIQUES;

TREES (MATHEMATICS);

EID: 33645680164     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/11008941_9     Document Type: Article

References (17)

1. 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.
2. N. M. Amato, O. B. Bayazit, L. K. Dale, C. Jones, and D. Vallejo. Choosing good distance metrics and local planners for probabilistic roadmap methods. TRA, pages 442-447, 2000.
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. K. Bekris, B. Chen, A. Ladd, E. Plaku, and L. Kavraki. Multiple query motion planning using single query primitives. To appear at IROS 2003 TR03-422, Rice University, Houston, TX, July 2003.
6. P. Bessiere, E. Mazer, and J.-M. Ahuactzin. Planning in continuous space with forbidden regions: The ariadne's clew algorithm. In K. G. et al, editor, Algorithmic Foundations of Robotics, pages 39-47. A.K. Peters, Wellsley MA, 1995.
7. S. Ehmann and M. Lin. Accurate and fast proximity queries between polyhedra using surface decomposition. Computer Graphics Forum (Proc. of Eurographics), 2001.
8. R. Geraerts and M. Overmars. A comparitive study of probabilistic roadmap planners. In Proc. WAFR, 2002.
9. D. Hsu, R. Kindel, J. Latombe, and S. Rock. Randomized kinodynamic motion planning with moving obstacles. IJRR, 2001.
10. 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, 1996.
11. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technology Journal, 49:291-307, 1970.
12. A. Ladd and L. Kavraki. Motion planning for knot untangling. In WAFR, 2002.
13. F. Lamiraux and L. Kavraki. Planning paths for elastic objects under manipulation constraints. IJRR, 20(3):188-208, 2001.
14. 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.
15. C. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1982.
16. 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.
17. M. Yim. Locomotion with a Unit-Modular Reconfigurable Robot. PhD thesis, Stanford Univ., December 1994. Stanford Technical Report STAN-CS-94-1536.