The essential visibility graph: an approach to global motion planning for autonomous mobile robots

An approach to global motion planning for autonomous mobile robots has been developed on the basis of traversability vectors (t-vectors). Through the overall course of this research it was found that t-vectors provide a utility, efficiency and mathematical stability for collision detection and visibility that cannot be matched by commonly used algebraic approaches in static and dynamic environments. This paper will show that t-vectors also impact global motion planning by identifying redundancies in visibility graphs (V-graphs) and expediting their construction. The result of eliminating redundant path segments is a streamlined version of the V-graph called the essential visibility graph (EVG). This paper will also show that the EVG offers a significant reduction in data storage requirements and complexity.

[1]  Ren C. Luo,et al.  T-vectors make autonomous mobile robot motion planning and self-referencing more efficient , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[2]  S. Sitharama Iyengar,et al.  A 'retraction' method for terrain model acquisition , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[3]  Fabrice Noreils.  An architecture supporting multiple organizations for cooperative mobile robots , 1992 .

[4]  Fabrice R. Noreils,et al.  Toward a Robot Architecture Integrating Cooperation between Mobile Robots: Application to Indoor Environment , 1993, Int. J. Robotics Res..

[5]  R. B. Kelley,et al.  Planning 3-D collision-free paths , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.

[6]  S. Sitharama Iyengar,et al.  On terrain acquisition by a point robot amidst polyhedral obstacles , 1988, IEEE J. Robotics Autom..

[7]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[8]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[9]  Fabrice R. Noreils,et al.  An architecture for cooperative and autonomous mobile robots , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[10]  Fabrice R. Noreils.  Towards a Versatile Control System for Mobile Robots , 1991 .

[11]  Derick Wood,et al.  Computing a convex skill of an orthogonal polygon , 1985, SCG '85.

[12]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[13]  Sartaj Sahni,et al.  Fast algorithm for polygon decomposition , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Osamu Takahashi,et al.  Motion planning in a plane using generalized Voronoi diagrams , 1989, IEEE Trans. Robotics Autom..

[15]  Fabrice R. Norelis,et al.  Control of mobile robot actions , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[16]  Godfried T. Toussaint,et al.  An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .

[17]  Ren C. Luo,et al.  Sonar windows and geometrically represented objects for mobile robot self-referencing , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[18]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[19]  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.

[20]  Ren C. Luo,et al.  Motion planning for mobile robots in a dynamic environment with moving obstacles , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[21]  S. Sitharama Iyengar,et al.  Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case , 1987, IEEE Journal on Robotics and Automation.

[22]  Vangalur S. Alagar,et al.  Algorithmic motion planning in robotics: Coordinated motion of several disks amidst polygonal obstacles , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[23]  Pierre Dauchez,et al.  World representation and path planning for a mobile robot , 1988, Robotica.

[24]  C. Lin,et al.  Formulation and optimization of cubic polynomial joint trajectories for industrial robots , 1983 .

[25]  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.

[26]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[27]  Russell H. Taylor,et al.  Planning and execution of straight line manipulator trajectories , 1979 .

[28]  David Kortenkamp.  Applying computational theories of cognitive mapping to mobile robots , 1992 .

[29]  J.A. Janet,et al.  Autonomous mobile robot motion planning enhanced with extended configuration-space and half-planes , 1994, Proceedings of IECON'94 - 20th Annual Conference of IEEE Industrial Electronics.

[30]  Fabrice R. Noreils.  Integrating error recovery in a mobile robot control system , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[31]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[32]  David Kortenkamp,et al.  Using Gateways To Build A Route Map , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

[33]  Fabrice R. Noreils,et al.  From planning to execution monitoring control for indoor mobile robots , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[34]  Bruce J. Schachter,et al.  Decomposition of Polygons into Convex Sets , 1978, IEEE Transactions on Computers.

[35]  Hobart R. Everett,et al.  Modeling the Environment of a Mobile Security Robot , 1990 .