Dynamic assignment in distributed motion planning with local coordination

Distributed motion planning of multiple agents raises fundamental and novel problems in control theory and robotics. In particular, in applications such as coverage by mobile sensor networks or multiple target tracking, a great new challenge is the development of motion planning algorithms that dynamically assign targets or destinations to multiple homogeneous agents, not relying on any a priori assignment of agents to destinations. In this paper, we address this challenge using two novel ideas. First, distributed multidestination potential fields are developed that are able to drive every agent to any available destination. Second, nearest neighbor coordination protocols are developed ensuring that distinct agents are assigned to distinct destinations. Integration of the overall system results in a distributed, multiagent, hybrid system for which we show that the mutual exclusion property of the final assignment is guaranteed for almost all initial conditions. Furthermore, we show that our dynamic assignment algorithm will converge after exploring at most a polynomial number of assignments, dramatically reducing the combinatorial nature of purely discrete assignment problems. Our scalable approach is illustrated with nontrivial computer simulations. © 2008 IEEE.

Full Text

Duke Authors

Cited Authors

  • Zavlanos, MM; Pappas, GJ

Published Date

  • 2008

Published In

Volume / Issue

  • 24 / 1

Start / End Page

  • 232 - 242

International Standard Serial Number (ISSN)

  • 1552-3098

Digital Object Identifier (DOI)

  • 10.1109/TRO.2007.913992

Citation Source

  • SciVal