Decentralized Motion Planning for Multiple Mobile Robots: The Cocktail Party Model

  • Authors:
  • V. J. Lumelsky;K. R. Harinarayan

  • Affiliations:
  • University of Wisconsin-Madison, Madison, Wisconsin 53706, USA;University of Wisconsin-Madison, Madison, Wisconsin 53706, USA

  • Venue:
  • Autonomous Robots
  • Year:
  • 1997

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper presents an approach for decentralized real-time motionplanning for multiple mobile robots operating in a common2-dimensional environment with unknown stationary obstacles. In ourmodel, a robot can see (sense) the surrounding objects. It knows itscurrent and its target‘s position, is able to distinguish a robotfrom an obstacle, and can assess the instantaneous motion of anotherrobot. Other than this, a robot has no knowledge about the scene orof the paths and objectives of other robots. There is no mutualcommunication among the robots; no constraints are imposed on thepaths or shapes of robots and obstacles. Each robot plans its pathtoward its target dynamically, based on its current position and thesensory feedback; only the translation component is considered forthe planning purposes. With this model, it is clear that no provablemotion planning strategy can be designed (a simple example with adead-lock is discussed); this naturally points to heuristicalgorithms. The suggested strategy is based on maze-searchingtechniques. Computer simulation results are provided thatdemonstrate good performance and a remarkable robustness of thealgorithm (meaning by this a virtual impossibility to create adead-lock in a “random” scene).