PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
January 1, 200748 citations

Distributed formation control with permutation symmetries

View Full Paper
MZMichael M. ZavlanosGPGeorge J. Pappas

Key Points

  • The aim is to develop motion algorithms for mobile agents that can adjust their positions in formation using only local information.
  • Employs consensus algorithms to agree on formation configuration rotation and translation.
  • Uses market-based protocols for dynamic permutation of agents.
  • Utilizes artificial potential fields to guide agents to the desired formation.
  • The algorithm guarantees convergence to the desired formation under a connectivity assumption.
  • The number of explored permutations is polynomial relative to the number of agents.
  • Scalability is supported by extensive computer simulations.

Abstract

In distributed control applications such as coverage or consensus by multiple mobile agents, a great new challenge is the development of motion algorithms that dynamically determine the positions of the agents in the formation using only local information. In this paper, we address this challenge using two novel ideas. First, we represent a formation as a rotational and translational invariant configuration in the free space and employ distributed consensus algorithms to guarantee that all agents agree on the rotation and translation of the final formation configuration. Second, local market-based coordination protocols dynamically determine a permutation of the agents in the formation, while artificial potential fields are used to drive the group of agents to the desired formation. Integration of the overall system results in a distributed, multi- agent, hybrid system which, under a connectivity assumption on the underlying communication network, is shown to always converge to the desired formation. Furthermore, the number of explored permutations is at most polynomial with the number of agents, while scalability of our approach is illustrated by nontrivial computer simulations.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Zavlanos et al. (2007) studied this question.

synapsesocial.com/papers/6a1fc0a77f1e4b23608aba01https://doi.org/10.1109/cdc.2007.4434527
Ask AI
Helpful
Bookmark
Share
View Full Paper