Multi-level free-space dilation for sampling narrow passages in PRM planning

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2006, Issue , 2006, Pages 1255-1260

  Hsu, David ^a,b   Sánchez Ante, Gildardo ^b   Cheng, Ho Lun ^a   Latombe, Jean Claude ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b SINGAPORE MIT ALLIANCE   (Singapore)

^c Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; ROBOTS; SAMPLING;

COLLISION CHECKING; FREE-SPACE DILATION; GEOMETRIC MODELS;

MOTION PLANNING;

EID: 33845625285     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2006.1641881     Document Type: Conference Paper

References (25)

1. N. Amato, O. Bayazit, L. Dale, C. Jones, and D. Vallejo, "OBPRM: An obstacle-based PRM for 3D workspaces," in Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, P. Agarwal et al., Eds. Wellesley, MA: A. K. Peters, 1998, pp. 155-168.
2. B. Baginski, "Local motion planning for manipulators based on shrinking and growing geometry models," in Proc. IEEE Int. Conf. on Robotics & Automation, 1996, pp. 3303-3308.
3. V. Boor, M. Overmars, and F. van der Stappen, "The Gaussian sampling strategy for probabilistic roadmap planners," in Proc. IEEE Int. Conf. on Robotics & Automation, 1999, pp. 1018-1023.
4. H.-L. Cheng and T. Tan, "Approximating polygonal objects by deformable smooth surfaces," in Mathematical Foundations of Computer Science, 2005.
5. H. Choset, K. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L. Kavraki, and S. Thrun, Principles of Robot Motion: Theory, Algorithms, and Implementations. The MIT Press, 2005, ch. 7.
6. D. Cohen-Steiner, E. D. Verdiere, and M. Yvinec, "Conforming delaunay triangulations in 3d," in ACM Symp. on Computational Geometry, 2002, pp. 199-208.
7. T. Dey and W. Zhao, "Approximate medial axis as a voronoi subcomplex," in ACM Symp. on Solid Modeling & Applications, 2002, pp. 356-366.
8. M. Foskey, M. Garber, M. Lin, and D. Manocha, "A Voronoi-based hybrid motion planner," in Proc. IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2001, pp. 55-60.
9. M. Foskey, M. Lin, and D. Manocha, "Efficient computation of a simplified medial axis," in ACM Symp. on Solid Modeling & Applications, 2003, pp. 96-107.
10. L. Guibas, C. Holleman, and L. Kavraki, "A probabilistic roadmap planner for flexible objects with a workspace medial-axis based sampling approach," in Proc. IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 1999, pp. 254-260.
11. D. Hsu, L. Kavraki, J.-C. Latombe, R. Motwani, and S. Sorkin, "On finding narrow passages with probabilistic roadmap planners," in Robotics: The Algorithmic Perspective: 1998 Workshop on the Algorithmic Foundations of Robotics, P. Agarwal et al., Eds. Wellesley, MA: A. K. Peters, 1998, pp. 141-154.
12. D. Hsu, J. Latombe, and H. Kurniawati, "On the probabilistic foundations of probabilistic roadmap planning," in Proc. Int. Symp. on Robotics Research, 2005.
13. D. Hsu, J. Latombe, and R. Motwani, "Path planning in expansive configuration spaces," Int. J. Computational Geometry & Applications, vol. 9, no. 4-5, pp. 495-512, 1999.
14. S. Jin, R. Lewis, and D. West, "A comparison of algorithms for vertex normal computation," The Visual Computer, vol. 21, no. 1-2, pp. 71-82, 2005.
15. L. Kavraki, P. Švestka, J.-C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration space," IEEE Trans. on Robotics & Automation, vol. 12, no. 4, pp. 566-580, 1996.
16. H. Kurniawati and D. Hsu, "Workspace importance sampling for probabilistic roadmap planning," in Proc. IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2004, pp. 1618-1623.
17. S. LaValle and J. Kuffner, "Randomized kinodynamic planning," Int. J. Robotics Research, vol. 20, no. 5, pp. 278-400, 2001.
18. M. Lin and D. Manocha, "Collision and proximity queries," in Handbook of Discrete and Computational Geometry, J. Goodman and J. O'Rourke, Eds. Chapman & Hall/CRC, 2004, pp. 787-807.
19. M. Saha and J. Latombe, "Finding narrow passages with probabilistic roadmaps: The small step retraction method," in Proc. IEEE/RSJ Int. Conf. on Intelligent Robots & Systems, 2005.
20. G. Sánchez and J.-C. Latombe, "On delaying collision checking in PRM planning - application to multi-robot coordination," Int. J. of Robotics Research, vol. 21, no. 1, pp. 5-26, 2002.
21. E. Sherbrooke, N. Patrikalakis, and E. Brisson, "Computation of the medial axis transform of 3-D polyhedra," in Proc. ACM Symp. on Solid Modeling & Applications, 1995, pp. 187-200.
22. H. Si, "TetGen, a quality tetrahedral mesh generator and three-dimensional Delaunay triangulator," Weierstrass Institute for Applied Analysis and Stochastics, Tech. Rep., 2004.
23. T. Siméon, J. Laumond, and C. Nissoux, "Visibility-based probabilistic roadmaps for motion planning," J. Advanced Robotics, vol. 14, no. 6, pp. 477-494, 2000.
24. J. van den Berg and M. Overmars, "Using workspace information as a guide to non-uniform sampling in probabilistic roadmap planners," in Proc. IEEE Int. Conf. on Robotics & Automation, 2004, pp. 453-460,.
25. Y. Yang and O. Brock, "Adapting the sampling distribution in PRM planners based on an approximated medial axis," in Proc. IEEE Int. Conf. on Robotics & Automation, 2004.