On the Relationship between Classical Grid Search and Probabilistic Roadmaps
暂无分享,去创建一个
[1] Bruce Randall Donald,et al. A Search Algorithm for Motion Planning with Six Degrees of Freedom , 1987, Artif. Intell..
[2] B. Faverjon,et al. A local based approach for path planning of manipulators with a high number of degrees of freedom , 1987, Proceedings. 1987 IEEE International Conference on Robotics and Automation.
[3] Fred J. Hickernell,et al. Extensible Lattice Sequences for Quasi-Monte Carlo Quadrature , 2000, SIAM J. Sci. Comput..
[4] S. Tezuka. Quasi-Monte Carlo — Discrepancy between Theory and Practice , 2002 .
[5] H. Weyl. Über die Gleichverteilung von Zahlen mod. Eins , 1916 .
[6] H. Niederreiter,et al. Nets, ( t, s )-Sequences, and Algebraic Geometry , 1998 .
[7] Jean-Claude Latombe,et al. A Single-Query Bi-Directional Probabilistic Roadmap Planner with Lazy Collision Checking , 2001, ISRR.
[8] El-Ghazali Talbi,et al. The Ariadne's clew algorithm; From Animal to Animats , 1992 .
[9] Robert Bohlin,et al. Path planning in practice; lazy evaluation on a multi-resolution grid , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).
[10] Mark H. Overmars,et al. A Comparative Study of Probabilistic Roadmap Planners , 2002, WAFR.
[11] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[12] Daniel Vallejo,et al. OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .
[13] B. Donald,et al. Kinodynamic Motion Planning 1 Kinodynamic Motion Planning 5 , 1993 .
[14] 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).
[15] Narendra Ahuja,et al. A potential field approach to path planning , 1992, IEEE Trans. Robotics Autom..
[16] Steven M. LaValle,et al. On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..
[17] Rajeev Motwani,et al. Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..
[18] Jean-Claude Latombe,et al. A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[19] Steven M. LaValle,et al. Incremental low-discrepancy lattice methods for motion planning , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).
[20] Bernhard Glavina,et al. Solving findpath by combination of goal-directed and randomized search , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[21] Y. Wang,et al. An Historical Overview of Lattice Point Sets , 2002 .
[22] Steven M. LaValle,et al. Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .
[23] Lydia E. Kavraki,et al. A framework for using the workspace medial axis in PRM planners , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).
[24] Lydia E. Kavraki,et al. On finding narrow passages with probabilistic roadmap planners , 1998 .
[25] F. J. Hickernell. Lattice rules: how well do they measure up? in random and quasi-random point sets , 1998 .
[26] 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).
[27] Larry S. Davis,et al. Multiresolution path planning for mobile robots , 1986, IEEE J. Robotics Autom..
[28] 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).
[29] Thierry Siméon,et al. Visibility-based probabilistic roadmaps for motion planning , 2000, Adv. Robotics.
[30] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[31] Fred J. Hickernell,et al. Randomized Halton sequences , 2000 .
[32] Florent Lamiraux,et al. On the expected complexity of random path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[33] Dinesh Manocha,et al. Randomized Path Planning for a Rigid Body Based on Hardware Accelerated Voronoi Sampling , 1999 .
[34] John F. Canny,et al. Computing Roadmaps of General Semi-Algebraic Sets , 1991, Comput. J..
[35] J. T. Shwartz,et al. On the Piano Movers' Problem : III , 1983 .
[36] Koichi Kondo,et al. Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..
[37] Chee-Keng Yap,et al. A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.
[38] J. Hammersley. MONTE CARLO METHODS FOR SOLVING MULTIVARIABLE PROBLEMS , 1960 .
[39] A. G. Sukharev. Optimal strategies of the search for an extremum , 1971 .
[40] Pierre Bessière,et al. The Ariadne's Clew Algorithm , 1993, J. Artif. Intell. Res..
[41] Steven M. LaValle,et al. Quasi-randomized path planning , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).
[42] J. Halton. On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .
[43] Nancy M. Amato,et al. A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.
[44] Bruce Randall Donald,et al. Real-time robot motion planning using rasterizing computer graphics hardware , 1990, SIGGRAPH.