An efficient deterministic sequence for sampling-based motion planners

Proceedings of the IEEE International Symposium on Assembly and Task Planning

Volumn 2005, Issue , 2005, Pages 212-217

  Rosell, Jan ^a   Heise, Maximilian ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONTROL SYSTEMS; DEGREES OF FREEDOM (MECHANICS); HIERARCHICAL SYSTEMS; SAMPLING;

BEND-CORRIDOR PROBLEM; COMPUTATIONALLY EFFICIENT; HIERARCHICAL GRID STRUCTURE; ROADMAP;

MOTION PLANNING;

EID: 33746599144     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISATP.2005.1511475     Document Type: Conference Paper

References (14)

1. D. Aarno, D. Kragic, and H. I. Christiansen. Artificial potential biased probabilistic roadmap method. In Proc. of the IEEE Int. Conf. on Robotics and Automation, pages 461-466, 2004.
2. R. Bohlin and L. Kavraki. Path planning using lazy prm. In Proc. of the IEEE Int. Conf. on Robotics and Automation, volume 1, pages 521-528, 2000.
3. V. Boor, M. H. Overmars, and A. F. van der Stappen. The gaussian sampling strategy for probabilistic roadmap planners. In Proc. of the IEEE Int. Conf. on Robotics and Automation, pages 1018-1023, 1999.
4. M. S. Branicky, S. M. LaValle, K. Olson, and L. Yang. Quasi-randomized path planning. In Proc. of the IEEE Int. Conf. on Robotics and Automation, pages 1481-1487, 2001.
5. I. Gargantini. An effective way to represent quadtrees. Communications of the ACM, 25(12):905-910, 1982.
6. L. E. Kavraki, P. Svestka, J.-C. Latombe, and M. K. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces, volume 12, pages 566-580, August 1996.
7. J. J. Kuffner and S. M. LaValle. RRT-connect: An efficient approach to single-query path planning. In Proc. of the IEEE Int. Conf. on Robotics and Automation, pages 995-1001, 2000.
8. S. M. LaValle, M. S. Branicky, and S. R. Lindemann. On the relationship between classical grid search and probabilistic roadmaps. Int. J. of Robotics Res., 23(7-8):673-692, 2004.
9. S. R. Lindemann and S. LaValle. Proc. Int. Symp. on Robotics Research, chapter Current issues in sampling-based motion planning. Springer-Verlag, 2004.
10. S. R. Lindemann, A. Yershova, and S. M. LaValle. Incremental grid sampling strategies in robotics. In Proc. of the Sixth Int. Workshop on the Algorithmic Foundations of Robotics, 2004.
11. J. Resell. Sampling SE(3) with a deterministic sequence for 3D rigid-body path planning. Accepted to the 2005 IEEE Int. Conf. on Robotics and Automation.
12. J. Resell and M. Heisse. Path planning using harmonic functions and probabilistic cell decomposition. Accepted to the 2005 IEEE Int. Conf. on Robotics and Automation.
13. G. Sánchez and J.-C. Latombe. On delaying collision checking in PRM planning: application to multi-robot coordination. The Int. J. Robotics Res., 21(1):5-26, Jan. 2002.
14. S. A. Wilmarth, N. M. Amato, and P. F. Stiller. MAPRM: A probabilistic roadmap planner with sampling on the medial axis of the free space. In Proc. of the IEEE Int. Conf. on Robotics and Automation, pages 1024-1031, 1999.