A Framework for Mobile Robot Concurrent Path Planning &: Execution in Incomplete &= Uncertain Environments
暂无分享,去创建一个
[1] A. I. van de Vooren,et al. On the 9-point difference formula for Laplace's equation , 1967 .
[2] R. W. Hornbeck. Numerical Methods , 1975 .
[3] R.M. McElhaney,et al. Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.
[4] Peter G. Doyle,et al. Random Walks and Electric Networks: REFERENCES , 1987 .
[5] Oussama Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.
[6] Jean-Claude Latombe,et al. Robot Motion Planning: A Distributed Representation Approach , 1991, Int. J. Robotics Res..
[7] Narendra Ahuja,et al. Gross motion planning—a survey , 1992, CSUR.
[8] Roderic A. Grupen,et al. The applications of harmonic functions to robotics , 1993, J. Field Robotics.
[9] Gregory Dudek,et al. Precise positioning using model-based maps , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.
[10] Anthony Stentz,et al. The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.
[11] Shlomo Zilberstein,et al. Using Anytime Algorithms in Intelligent Systems , 1996, AI Mag..
[12] Danny Ziyi Chen,et al. A framed-quadtree approach for determining Euclidean shortest paths in a 2-D environment , 1997, IEEE Trans. Robotics Autom..
[13] Lydia E. Kavraki,et al. A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..
[14] John Beidler,et al. Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.