A distributed real-time algorithm for preference-based agreement

Daniel Zelazo, Mathias Bürger, Frank Allgöwer

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper studies a real-time distributed dual sub-gradient algorithm for multi-agent coordination. A finite-time optimal control problem with a terminal coupling consensus constraint is considered. The algorithm is shown to be equivalent to a linear time-varying (LTV) dynamical system with a distributed structure. The error between the multiplier values of the algorithm and the corresponding centralized solution is also given as an LTV system. This is used to derive an error bound for the terminal state of the algorithm to the optimal consensus value that is a function of the communication graph and the weights of each agents objective function.

Original languageEnglish
Title of host publicationProceedings of the 18th IFAC World Congress
Pages8933-8938
Number of pages6
Edition1 PART 1
DOIs
StatePublished - 2011
Externally publishedYes

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number1 PART 1
Volume44

Keywords

  • Distributed optimization
  • Finite-time consensus
  • Multi-agent systems
  • Sub-gradient methods

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering

Fingerprint

Dive into the research topics of 'A distributed real-time algorithm for preference-based agreement'. Together they form a unique fingerprint.

Cite this