Probabilistic roadmap methods are embarrassingly parallel
暂无分享,去创建一个
[1] Rajeev Motwani,et al. Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.
[2] Vipin Kumar,et al. A parallel formulation of informed randomized search for robot motion planning problems , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.
[3] Tomás Lozano-Pérez,et al. Parallel robot motion planning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[4] John H. Reif,et al. Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[5] Mark H. Overmars,et al. A random approach to motion planning , 1992 .
[6] Lydia E. Kavraki,et al. Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques , 1998, IPPS/SPDP Workshops.
[7] Jean-Claude Latombe,et al. Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..
[8] Lydia E. Kavraki,et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..
[9] Angel P. del Pobil,et al. Very fast collision detection for practical motion planning. II. The parallel algorithm , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[10] 博久 比留川. 2nd Workshop on Algorithmic Foundations of Robotics (WAFR) , 1996 .
[11] S. Sitharama Iyengar,et al. Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.
[12] Leonidas J. Guibas,et al. Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[13] Angel P. del Pobil,et al. Very fast collision detection for practical motion planning. I. The spatial representation , 1998, Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146).
[14] 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.
[15] Jean-Claude Latombelatombe. Ing of Connguration Space for Fast Path Planning , 2007 .
[16] Brian Mirtich,et al. V-Clip: fast and robust polyhedral collision detection , 1998, TOGS.
[17] Nancy M. Amato,et al. Choosing good distance metrics and local planners for probabilistic roadmap methods , 2000, IEEE Trans. Robotics Autom..
[18] Nancy M. Amato,et al. Parallel algorithms for higher-dimensional convex hulls , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[19] Daniel Vallejo,et al. OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .
[20] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[21] 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.
[22] Vipin Kumar,et al. Parallel search algorithms for robot motion planning , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.
[23] P. G. Xavier,et al. A configuration space toolkit for automated spatial reasoning: Technical results and LDRD project final report , 1997 .
[24] Mark H. Overmars,et al. A probabilistic learning approach to motion planning , 1995 .
[25] Narendra Ahuja,et al. Gross motion planning—a survey , 1992, CSUR.
[26] Nancy M. Amato,et al. A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[27] J. Latombe,et al. Probabilistic Roadm Aps for Path Planning in High-dimensional Connguration Spaces , 1997 .