A modeling method for collision detection and motion planning of robots

A modeling method for robots is proposed, in which a convex polyhedron is represented as a set of inequalities and a robot is represented as a union of convex polyhedrons. With this method, collision between robots can be detected by solving a set of linear programming problems at every sampling instant. By detecting possible collision at every sampling instant, a directed graph for robots is created. The motion planning problem of robots is then transformed into a path searching problem in the directed graph and can be solved by exisiting searching algorithms.

[1]  S. Sitharama Iyengar,et al.  Robot navigation algorithms using learned spatial graphs , 1986, Robotica.

[2]  Bum Hee Lee,et al.  Collision-Free Motion Planning of Two Robots , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Alan Watt,et al.  Fundamentals of three-dimensional computer graphics , 1989 .

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

[5]  Huang Han-Pang,et al.  A Real-time Algorithm for Obstacle Avoidance of Autonomous Mobile Robots , 1992 .

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

[7]  James D. Foley,et al.  Fundamentals of interactive computer graphics , 1982 .

[8]  Rodney A. Brooks,et al.  Solving the Find-Path Problem by Good Representation of Free Space , 1983, Autonomous Robot Vehicles.

[9]  Sue Whitesides,et al.  Computational Geometry and Motion Planning , 1985 .

[10]  Wilfred J. Hansen,et al.  Data structures in Pascal , 1986 .

[11]  John J. Craig,et al.  Introduction to Robotics Mechanics and Control , 1986 .

[12]  S. M. Udupa,et al.  Collision Detection and Avoidance in Computer Controlled Manipulators , 1977, IJCAI.

[13]  Rodney A. Brooks,et al.  A subdivision algorithm in configuration space for findpath with rotation , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[14]  John J. Craig Zhu,et al.  Introduction to robotics mechanics and control , 1991 .

[15]  Elmer G. Gilbert,et al.  Distance functions and their application to robot path planning in the presence of obstacles , 1985, IEEE J. Robotics Autom..

[16]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[17]  Narendra Ahuja,et al.  Path planning using a potential field representation , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[18]  H. Voelcker,et al.  Solid modeling: current status and research directions , 1983, IEEE Computer Graphics and Applications.

[19]  Han-Pang Huang,et al.  A Real-time Algorithm for Obstacle Avoidance of Autonomous Mobile Robots , 1992, Robotica.

[20]  Bo Zhang,et al.  Planning Collision-Free Paths for Robotic Arm Among Obstacles , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  V. Lumelsky,et al.  Dynamic path planning for a mobile automaton with limited information on the environment , 1986 .

[22]  S. Zucker,et al.  Toward Efficient Trajectory Planning: The Path-Velocity Decomposition , 1986 .