Reduction of Visibility Graph on Global Path Planning for Mobile Robot

Visibility graph is a kind of conventional method in path planning for mobile robot. Complexity degree of visibility graph increases rapidly with more obstacles appearing. If the number of vertexes of obstacles is N, the computing time will be O(N3). In this paper, the concept of completely visible obstacles and related theorems are presented, the resulting reduced visibility graph are applied to the global path planning of mobile robot combing with dynamic visibility graph and improves quality of real time.

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

[2]  Paul M. Griffin,et al.  Path planning for a mobile robot , 1992, IEEE Trans. Syst. Man Cybern..

[3]  G. Saridis,et al.  Path planning for an intelligent robot by the extended VGraph algorithm , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.

[4]  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).

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

[6]  J.A. Janet,et al.  The essential visibility graph: an approach to global motion planning for autonomous mobile robots , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[7]  Tomás Lozano-Pérez,et al.  Automatic Planning of Manipulator Transfer Movements , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  Han-Pang Huang,et al.  Dynamic visibility graph for path planning , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).