Global path planning for mobile robot with grid-type world model
暂无分享,去创建一个
[1] Elmer G. Gilbert,et al. Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..
[2] Yoram Koren,et al. Histogramic in-motion mapping for mobile robot obstacle avoidance , 1991, IEEE Trans. Robotics Autom..
[3] Tomás Lozano-Pérez,et al. Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.
[4] V. Lumelsky,et al. Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .
[5] S. Zucker,et al. Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .
[6] Alexander Zelinsky,et al. A mobile robot exploration algorithm , 1992, IEEE Trans. Robotics Autom..
[7] Hans P. Moravec,et al. High resolution maps from wide angle sonar , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.
[8] Larry H. Matthies,et al. Integration of sonar and stereo range data using a grid-based representation , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.
[9] Jang Gyu Lee,et al. Path Planning For A Mobile Robot With Grid Type World Model , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.
[10] Osamu Takahashi,et al. Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..
[11] Marlin H. Mickle,et al. Optimal Decomposition of Large-Scale Networks , 1979, IEEE Transactions on Systems, Man, and Cybernetics.
[12] A. Rosenthal. On finding shortest paths in nonnegative networks , 1974, Discret. Math..
[13] G. Mills. A Decomposition Algorithm for the Shortest-Route Problem , 1966, Oper. Res..
[14] Vladimir J. Lumelsky,et al. Dynamic path planning in sensor-based terrain acquisition , 1990, IEEE Trans. Robotics Autom..
[15] S. Sitharama Iyengar,et al. Autonomous robot navigation in unknown terrains: incidental learning and environmental exploration , 1990, IEEE Trans. Syst. Man Cybern..
[16] Nageswara S. V. Rao,et al. The visit problem: visibility graph-based solution , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.
[17] G. Dantzig. On the Shortest Route Through a Network , 1960 .
[18] T. C. Hu. A Decomposition Algorithm for Shortest Paths in a Network , 1968, Oper. Res..
[19] Rodney A. Brooks,et al. Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.
[20] Yoram Koren,et al. The vector field histogram-fast obstacle avoidance for mobile robots , 1991, IEEE Trans. Robotics Autom..
[21] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[22] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[23] S. Sitharama Iyengar,et al. On terrain acquisition by a point robot amidst polyhedral obstacles , 1988, IEEE J. Robotics Autom..
[24] Yoram Koren,et al. Real-time obstacle avoidance for fact mobile robots , 1989, IEEE Trans. Syst. Man Cybern..