The bridge test for sampling narrow passages with probabilistic roadmap planners
暂无分享,去创建一个
David Hsu | Zheng Sun | John H. Reif | Tingting Jiang | David Hsu | J. Reif | Zheng Sun | Tingting Jiang
[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] J. T. Shwartz,et al. On the Piano Movers' Problem : III , 1983 .
[3] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[4] John E. Hopcroft,et al. Movement Problems for 2-Dimensional Linkages , 1984, SIAM J. Comput..
[5] Sean Quinlan,et al. Efficient distance computation between non-convex objects , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[6] Leonidas J. Guibas,et al. Optimally combining sampling techniques for Monte Carlo rendering , 1995, SIGGRAPH.
[7] Dinesh Manocha,et al. OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.
[8] Lydia E. Kavraki,et al. Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..
[9] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[10] Rajeev Motwani,et al. Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.
[11] Lydia E. Kavraki,et al. A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..
[12] Lydia E. Kavraki,et al. On finding narrow passages with probabilistic roadmap planners , 1998 .
[13] Daniel Vallejo,et al. OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .
[14] 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).
[15] Thierry Siméon,et al. Visibility based probabilistic roadmaps , 1999, Proceedings 1999 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human and Environment Friendly Robots with High Intelligence and Emotional Quotients (Cat. No.99CH36289).
[16] Steven M. LaValle,et al. Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[17] Jean-Claude Latombe,et al. A Motion Planning Approach to Flexible Ligand Binding , 1999, ISMB.
[18] Rajeev Motwani,et al. Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..
[19] 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).
[20] Jean-Claude Latombe,et al. Interactive manipulation planning for animated characters , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.
[21] Lydia E. Kavraki,et al. Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[22] Thierry Siméon,et al. Computer aided motion: Move3D within MOLOG , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[23] Nancy M. Amato,et al. Probabilistic roadmaps-putting it all together , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[24] S. LaValle,et al. Randomized Kinodynamic Planning , 2001 .
[25] Jean-Claude Latombe,et al. Stochastic roadmap simulation: an efficient representation and algorithm for analyzing molecular motion , 2002, RECOMB '02.
[26] Nancy M. Amato,et al. Using Motion Planning to Map Protein Folding Landscapes and Analyze Folding Kinetics of Known Native Structures , 2003, J. Comput. Biol..