Path Planning Using a Tangent Graph for Mobile Robots Among Polygonal and Curved Obstacles
暂无分享,去创建一个
[1] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[2] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[3] Rodney A. Brooks,et al. A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.
[4] Oussama Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1986 .
[5] Hans Rohnert,et al. Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..
[6] Jean-Paul Laumond,et al. Obstacle Growing in a Nonpolygonal World , 1987, Inf. Process. Lett..
[7] Osamu Takahashi,et al. Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..
[8] Oussama Khatib,et al. Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.
[9] Yun-Hui Liu,et al. A flexible algorithm for planning local shortest path of mobile robots based on reachability graph , 1990, EEE International Workshop on Intelligent Robots and Systems, Towards a New Frontier of Applications.
[10] Yunhui Liu,et al. Proposal of tangent graph and extended tangent graph for path planning of mobile robots , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.
[11] Jean-Claude Latombe,et al. Robot motion planning , 1970, The Kluwer international series in engineering and computer science.
[12] S. LaValle,et al. Motion Planning , 2008, Springer Handbook of Robotics.