Consensus with linear objective maps

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider in this paper a weighted consensus problem over directed graphs, where the agents interact in a decentralized way, with the resulting dynamics formulated in continuous time. We introduce a linear function, called the objective map, that defines the desired final state as a convex combination of the initial states of the agents. We provide a complete answer to the question of whether there is a decentralized consensus dynamics over a given digraph which converges to the final state specified by an objective map. In particular, we characterize not only the set of objective maps that are feasible for a given digraph, but also the consensus dynamics that implements the objective map.

Original languageEnglish (US)
Title of host publication54rd IEEE Conference on Decision and Control,CDC 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2847-2852
Number of pages6
ISBN (Electronic)9781479978861
DOIs
StatePublished - Feb 8 2015
Event54th IEEE Conference on Decision and Control, CDC 2015 - Osaka, Japan
Duration: Dec 15 2015Dec 18 2015

Publication series

NameProceedings of the IEEE Conference on Decision and Control
Volume54rd IEEE Conference on Decision and Control,CDC 2015
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Other

Other54th IEEE Conference on Decision and Control, CDC 2015
Country/TerritoryJapan
CityOsaka
Period12/15/1512/18/15

ASJC Scopus subject areas

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

Fingerprint

Dive into the research topics of 'Consensus with linear objective maps'. Together they form a unique fingerprint.

Cite this