暂无分享,去创建一个
Siddhartha S. Srinivasa | Jonathan D. Gammell | Tim D. Barfoot | S. Srinivasa | T. Barfoot | J. Gammell
[1] R Bellman,et al. On the Theory of Dynamic Programming. , 1952, Proceedings of the National Academy of Sciences of the United States of America.
[2] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[3] E. N. Gilbert,et al. Random Plane Networks , 1961 .
[4] R. Larson,et al. A survey of dynamic programming computational procedures , 1967, IEEE Transactions on Automatic Control.
[5] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[6] D. Bertsekas. Convergence of discretization procedures in dynamic programming , 1975 .
[7] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[8] Jean-Claude Latombe,et al. Nonholonomic multibody mobile robots: Controllability and motion planning in the presence of obstacles , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[9] Koichi Kondo,et al. Motion planning with six degrees of freedom by multistrategic bidirectional heuristic free-space enumeration , 1991, IEEE Trans. Robotics Autom..
[10] 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.
[11] Bruce Randall Donald,et al. Kinodynamic motion planning , 1993, JACM.
[12] Gabriele M. T. D'Eleuterio,et al. Optimal robotic path planning using dynamic programming and randomization , 1995 .
[13] Anthony Stentz,et al. The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.
[14] Kevin M. Lynch,et al. Stable Pushing: Mechanics, Controllability, and Planning , 1995, Int. J. Robotics Res..
[15] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[16] Moëz Cherif. Kinodynamic motion planning for all-terrain wheeled vehicles , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[17] Rajeev Motwani,et al. Path Planning in Expansive Configuration Spaces , 1999, Int. J. Comput. Geom. Appl..
[18] S. LaValle,et al. Randomized Kinodynamic Planning , 2001 .
[19] Jean-Claude Latombe,et al. Randomized Kinodynamic Motion Planning with Moving Obstacles , 2002, Int. J. Robotics Res..
[20] Sebastian Thrun,et al. ARA*: Anytime A* with Provable Bounds on Sub-Optimality , 2003, NIPS.
[21] Panganamala Ramana Kumar,et al. The Number of Neighbors Needed for Connectivity of Wireless Networks , 2004, Wirel. Networks.
[22] David Furcy,et al. Lifelong Planning A , 2004, Artif. Intell..
[23] Sean R Eddy,et al. What is dynamic programming? , 2004, Nature Biotechnology.
[24] Anthony Stentz,et al. The Delayed D* Algorithm for Efficient Path Replanning , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.
[25] Sven Koenig,et al. Fast replanning for navigation in unknown terrain , 2005, IEEE Transactions on Robotics.
[26] Sebastian Thrun,et al. Anytime Dynamic A*: An Anytime, Replanning Algorithm , 2005, ICAPS.
[27] Anthony Stentz,et al. Anytime RRTs , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[28] Sebastian Thrun,et al. Anytime search in dynamic graphs , 2008, Artif. Intell..
[29] A. Wade. Asymptotic theory for the multidimensional random on-line nearest-neighbour graph , 2007, math/0702414.
[30] B. Bollobás,et al. A critical constant for the k nearest-neighbour model , 2007, Advances in Applied Probability.
[31] Emilio Frazzoli,et al. Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..
[32] Lydia E. Kavraki,et al. The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.
[33] Nikolaus Correll,et al. C-FOREST: Parallel Shortest Path Planning With Superlinear Speedup , 2013, IEEE Transactions on Robotics.
[34] Marco Pavone,et al. Fast Marching Trees: A Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensions , 2013, ISRR.
[35] Siddhartha S. Srinivasa,et al. Informed RRT*: Optimal Incremental Path Planning Focused through an Admissible Ellipsoidal Heuristic , 2014, ArXiv.