On finding narrow passages with probabilistic roadmap planners
暂无分享,去创建一个
Lydia E. Kavraki | Rajeev Motwani | Jean-Claude Latombe | David Hsu | Stephen Sorkin | David Hsu | J. Latombe | L. Kavraki | R. Motwani | S. Sorkin
[1] Elmer G. Gilbert,et al. Growth distances: new measures for object separation and penetration , 1996, IEEE Trans. Robotics Autom..
[2] Mark H. Overmars,et al. A probabilistic learning approach to motion planning , 1995 .
[3] Lydia E. Kavraki,et al. A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..
[4] Nancy M. Amato,et al. A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[5] Jean-Claude Latombe,et al. Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..
[6] Carme Torras,et al. Collision detection algorithms for motion planning , 1998 .
[7] J. Latombe,et al. Randomized Query Processing in Robot Motion Planning , 1998 .
[8] Jérôme Barraquand,et al. A method of progressive constraints for manipulation planning , 1997, IEEE Trans. Robotics Autom..
[9] Sean Quinlan,et al. Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[10] J. Barraquand. and Jean-Claude Latombe Robot Motion Planning : A Distributed Representation Approach , 1991 .
[11] Rajeev Motwani,et al. Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.
[12] S. Sathiya Keerthi,et al. A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..
[13] Boris Baginski,et al. Local motion planning for manipulators based on shrinking and growing geometry models , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[14] Brian Mirtich,et al. V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.
[15] Henning Tolle,et al. Motion planning with many degrees of freedom-random reflections at C-space obstacles , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[16] Dinesh Manocha,et al. Collision Detection: Algorithms and Applications , 1996 .
[17] Lydia E. Kavraki,et al. Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[18] Mark H. Overmars,et al. Probabilistic path planning , 1998 .
[19] Stephen Cameron,et al. Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.
[20] Ming C. Lin,et al. A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[21] K. Sridharan,et al. Distance Measures on Intersecting Objects and Their Applications , 1994, Inf. Process. Lett..
[22] Lydia E. Kavraki,et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..
[23] Lydia E. Kavraki,et al. Random networks in configuration space for fast path planning , 1994 .
[24] Daniel Vallejo,et al. OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .
[25] Chong Jin Ong,et al. On the Quantification of Penetration between General Objects , 1997, Int. J. Robotics Res..
[26] K Sridharan,et al. Measures of intensity of collision between convex objects and their efficient computation , 1991 .
[27] Mark H. Overmars,et al. A random approach to motion planning , 1992 .