Distance optimal formation control on graphs with a tight convergence time guarantee

Jingjin Yu, M. Lavalle

Research output: Contribution to journalConference articlepeer-review

Abstract

For the task of moving a set of indistinguishable agents on a connected graph with unit edge distance to an arbitrary set of goal vertices, free of collisions, we propose a fast distance optimal control algorithm that guides the agents into the desired formation. Moreover, we show that the algorithm also provides a tight convergence time guarantee (time optimality and distance optimality cannot be simultaneously satisfied). Our generic graph formulation allows the algorithm to be applied to scenarios such as grids with holes (modeling obstacles) in arbitrary dimensions. Simulations, available online1, confirm our theoretical developments.

Original languageEnglish (US)
Article number6426233
Pages (from-to)4023-4028
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
DOIs
StatePublished - 2012
Event51st IEEE Conference on Decision and Control, CDC 2012 - Maui, HI, United States
Duration: Dec 10 2012Dec 13 2012

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Distance optimal formation control on graphs with a tight convergence time guarantee'. Together they form a unique fingerprint.

Cite this