OBPRM: an obstacle-based PRM for 3D workspaces
暂无分享,去创建一个
Daniel Vallejo | Lucia K. Dale | Nancy M. Amato | O. B. Bayazit | O. Burchan Bayazit | Christopher Jones | N. Amato | Christopher Jones | D. Vallejo
[1] John H. Reif,et al. Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[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] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[4] Jean-Claude Latombe,et al. Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..
[5] Narendra Ahuja,et al. A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..
[6] Mark H. Overmars,et al. A random approach to motion planning , 1992 .
[7] Yong K. Hwang,et al. SANDROS: a motion planner with performance proportional to task difficulty , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[8] Narendra Ahuja,et al. Gross motion planning—a survey , 1992, CSUR.
[9] Vipin Kumar,et al. Parallel search algorithms for robot motion planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.
[10] 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.
[11] 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.
[12] Mark H. Overmars,et al. A probabilistic learning approach to motion planning , 1995 .
[13] Yong K. Hwang,et al. A heuristic and complete planner for the classical mover's problem , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.
[14] Tsai-Yen Li,et al. Assembly maintainability study with motion planning , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.
[15] Lydia E. Kavraki,et al. Randomized query processing in robot path planning , 1995, STOC '95.
[16] Lydia E. Kavraki,et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..
[17] Lydia E. Kavraki,et al. Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[18] Nancy M. Amato,et al. A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[19] Yan Wu,et al. An Obstacle-Based Probabilistic Roadmap Method For Path Planning , 1996 .
[20] Yong K. Hwang,et al. Path planning for everyday robotics with SANDROS , 1997, Proceedings of International Conference on Robotics and Automation.
[21] Rajeev Motwani,et al. Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.
[22] J. Latombe,et al. Probabilistic Roadm Aps for Path Planning in High-dimensional Connguration Spaces , 1997 .
[23] Kamal K. Gupta,et al. A motion planning based approach for inverse kinematics of redundant robots: the kinematic roadmap , 1997, Proceedings of International Conference on Robotics and Automation.
[24] Nancy M. Amato,et al. Choosing good distance metrics and local planners for probabilistic roadmap methods , 2000, IEEE Trans. Robotics Autom..