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

Dit-Yan Yeung, George A. Bekey

Abstract

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.
BibTeX
@inproceedings{yeung1987decentralized,
  author = {Dit-Yan Yeung and George A. Bekey},
  title = {{A decentralized approach to the motion planning problem for multiple mobile robots}},
  booktitle = {IEEE International Conference on Robotics and Automation},
  year = {1987},
  doi = {10.1109/robot.1987.1087768},
}

Loading related content...

Figure