A decentralized approach to the motion planning problem for multiple mobile robots

In this paper the motion planning problem for multiple mobile robots is addressed. Conventional methods of planning the motion for a single moving object are based on the assumption of a static environment, and so they cannot be used here because each of the robots is in a dynamic environment consisting of other moving robots. Centralized approaches to the multiple moving objects problem were shown to be intractable. In order to find a practical solution for the problem, it is necessary to reduce the complexity of it by decomposing the problem and introducing various heuristic techniques. We are proposing here a decentralized approach which is based on the decomposition of the problem into two subproblems: the global path planning problem and the local path replanning problem. This approach is based on a framework of problem solving using a group of intelligent agents.

[1]  Alan M. Thompson.  The Navigation System of the JPL Robot , 1977, IJCAI.

[2]  Randall Davis,et al.  Report on the Workshop on Distributed AI , 1980 .

[3]  Paul G. Spirakis,et al.  Strong NP-Hardness of Moving Many Discs , 1984, Inf. Process. Lett..

[4]  J. T. Shwartz,et al.  On the Piano Movers' Problem : III , 1983 .

[5]  C. R. Weisbin,et al.  Machine intelligence for robotics applications , 1985 .

[6]  Reid G. Smith,et al.  Report on the 1984 Distributed Artificial Intelligence Workshop , 1985, AI Mag..

[7]  Randall Davis.  Report on the Second Workshop on Distributed AI , 1982 .

[8]  J. Schwartz,et al.  On the Complexity of Motion Planning for Multiple Independent Objects; PSPACE- Hardness of the "Warehouseman's Problem" , 1984 .

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

[10]  Hans P. Moravec.  Robot Rover Visual Navigation , 1981 .

[11]  Steven W. Zucker,et al.  Trajectory Planning In Time-Varying Environments, 1: TPP = PPP + VPP , 1985, Other Conferences.

[12]  Nils J. Nilsson,et al.  A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.

[13]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[14]  Hans P. Moravec.  The CMU Rover , 1982, AAAI.

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

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

[17]  J. Schwartz,et al.  On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal Barriers , 1983 .

[18]  Raja Chatila,et al.  Path Planning and Environment Learning in a Mobile Robot System , 1982, ECAI.

[19]  Hans P. Moravec,et al.  The Stanford Cart and the CMU Rover , 1983, Proceedings of the IEEE.

[20]  Georges Giralt,et al.  A Multi-level Planning and Navigation System for a Mobile Robot: A First Approach to HILARE , 1979, IJCAI.

[21]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .