Path planning using lazy PRM
暂无分享,去创建一个
[1] John Canny,et al. The complexity of robot motion planning , 1988 .
[2] Bernhard Glavina,et al. Solving findpath by combination of goal-directed and randomized search , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[3] Ming C. Lin,et al. A fast algorithm for incremental distance calculation , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[4] Jean-Claude Latombe,et al. Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..
[5] Mark H. Overmars,et al. A random approach to motion planning , 1992 .
[6] Narendra Ahuja,et al. Gross motion planning—a survey , 1992, CSUR.
[7] 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.
[8] Lydia E. Kavraki,et al. Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[9] Jean-Claude Latombe,et al. Planning motions with intentions , 1994, SIGGRAPH.
[10] Carme Torras,et al. Interference detection between non-convex polyhedra revisited with a practical aim , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[11] Lydia E. Kavraki,et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..
[12] Nancy M. Amato,et al. A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[13] Pekka Isto,et al. A two-level search algorithm for motion planning , 1997, Proceedings of International Conference on Robotics and Automation.
[14] Rajeev Motwani,et al. Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.
[15] Stephen Cameron,et al. Enhancing GJK: computing minimum and penetration distances between convex polyhedra , 1997, Proceedings of International Conference on Robotics and Automation.
[16] Lydia E. Kavraki,et al. On finding narrow passages with probabilistic roadmap planners , 1998 .
[17] Pierre Bessière,et al. The Ariadne's Clew Algorithm , 1993, J. Artif. Intell. Res..
[18] Daniel Vallejo,et al. OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .
[19] Mark H. Overmars,et al. The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[20] Steven M. LaValle,et al. Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[21] Jean-Claude Latombe,et al. Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other Artifacts , 1999, Int. J. Robotics Res..
[22] Nancy M. Amato,et al. MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[23] Nancy M. Amato,et al. Choosing good distance metrics and local planners for probabilistic roadmap methods , 2000, IEEE Trans. Robotics Autom..
[24] Lydia E. Kavraki,et al. A two level fuzzy PRM for manipulation planning , 2000, Proceedings. 2000 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2000) (Cat. No.00CH37113).