The D* Algorithm for Real-Time Planning of Optimal Traverses
暂无分享,去创建一个
[1] Richard E. Korf,et al. Real-Time Heuristic Search: First Results , 1987, AAAI.
[2] Anthony Stentz,et al. Optimal and efficient path planning for partially-known environments , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[3] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[4] Nils J. Nilsson,et al. Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[5] Terrance E. Boult. Updating Distance Maps When Objects Move , 1987, Other Conferences.
[6] Alexander Zelinsky,et al. A mobile robot exploration algorithm , 1992, IEEE Trans. Robotics Autom..
[7] Thomas W. Reps,et al. An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.
[8] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[9] Amir Pirzadeh,et al. A unified solution to coverage and search in explored and unexplored terrains using indirect control , 1990, Proceedings., IEEE International Conference on Robotics and Automation.
[10] Anthony Stentz. Optimal and Efficient Path Planning for Unknown and Dynamic Environments , 1993 .
[11] Hanan Samet,et al. An Overview of Quadtrees, Octrees, and Related Hierarchical Data Structures , 1988 .
[12] Karen Trovato. Differential A*: an adaptive search method illustrated with robot path planning for moving obstacles and goals, and an uncertain environment , 1989, [Proceedings 1989] IEEE International Workshop on Tools for Artificial Intelligence.
[13] R. A. Jarvis,et al. Collision-free trajectory planning using distance transforms , 1985 .
[14] Anthony Stentz,et al. Mobile Robot Navigation: The CMU System , 1987, IEEE Expert.
[15] V. Lumelsky,et al. Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .