Lazy Theta*: Any-Angle Path Planning and Path Length Analysis in 3D
暂无分享,去创建一个
Sven Koenig | Craig A. Tovey | Alex Nash | Sven Koenig | C. Tovey | A. Nash
[1] Ariel Felner,et al. Theta*: Any-Angle Path Planning on Grids , 2007, AAAI.
[2] Sven Koenig,et al. Incremental Phi*: Incremental Any-Angle Path Planning on Grids , 2009, IJCAI.
[3] Anthony Stentz,et al. 3D Field D: Improved Path Planning and Replanning in Three Dimensions , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[4] Jack Bresenham,et al. Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..
[5] 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).
[6] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[7] Robin R. Murphy,et al. Introduction to AI Robotics , 2000 .
[8] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[9] Jonathan Schaeffer,et al. Comparison of Different Grid Abstractions for Pathfinding on Maps , 2003, IJCAI.
[10] John F. Canny,et al. New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[11] Anthony Stentz,et al. Using interpolation to improve path planning: The Field D* algorithm , 2006, J. Field Robotics.
[12] M. Egerstedt,et al. Graph-based path planning for mobile robots , 2006 .
[13] Howie Choset,et al. Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .