Complex constrained consensus

Ji Liu, Angelia Nedich, Tamer Basar

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

In a network of m > 1 agents, constrained consensus means that all m agents reach an agreement on a specific value of some quantity via local interactions while their states are restricted to lie in different closed convex sets. This paper formulates and solves two generalized versions of the basic constrained consensus problem. The first version deals with the case when the constraint set of each agent is complex so that the projection operation on the whole constraint set is computationally expensive or even prohibitive. The second version models the constrained flocking problem in which each agent can only sense the current headings of its neighbors and independently updates its heading at times determined by its own clock. Two constrained consensus algorithms are proposed for the two versions. Both are guaranteed to reach a consensus under appropriate assumptions.

Original languageEnglish (US)
Article number7039607
Pages (from-to)1464-1469
Number of pages6
JournalUnknown Journal
Volume2015-February
Issue numberFebruary
DOIs
StatePublished - 2014
Externally publishedYes

Fingerprint

Flocking
Consensus Problem
Local Interaction
Clocks
Closed set
Convex Sets
Update
Projection
Model

ASJC Scopus subject areas

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

Cite this

Liu, J., Nedich, A., & Basar, T. (2014). Complex constrained consensus. Unknown Journal, 2015-February(February), 1464-1469. [7039607]. https://doi.org/10.1109/CDC.2014.7039607

Complex constrained consensus. / Liu, Ji; Nedich, Angelia; Basar, Tamer.

In: Unknown Journal, Vol. 2015-February, No. February, 7039607, 2014, p. 1464-1469.

Research output: Contribution to journalArticle

Liu, J, Nedich, A & Basar, T 2014, 'Complex constrained consensus', Unknown Journal, vol. 2015-February, no. February, 7039607, pp. 1464-1469. https://doi.org/10.1109/CDC.2014.7039607
Liu J, Nedich A, Basar T. Complex constrained consensus. Unknown Journal. 2014;2015-February(February):1464-1469. 7039607. https://doi.org/10.1109/CDC.2014.7039607
Liu, Ji ; Nedich, Angelia ; Basar, Tamer. / Complex constrained consensus. In: Unknown Journal. 2014 ; Vol. 2015-February, No. February. pp. 1464-1469.
@article{2cb35b93c36f432884504a6b8e2d3c07,
title = "Complex constrained consensus",
abstract = "In a network of m > 1 agents, constrained consensus means that all m agents reach an agreement on a specific value of some quantity via local interactions while their states are restricted to lie in different closed convex sets. This paper formulates and solves two generalized versions of the basic constrained consensus problem. The first version deals with the case when the constraint set of each agent is complex so that the projection operation on the whole constraint set is computationally expensive or even prohibitive. The second version models the constrained flocking problem in which each agent can only sense the current headings of its neighbors and independently updates its heading at times determined by its own clock. Two constrained consensus algorithms are proposed for the two versions. Both are guaranteed to reach a consensus under appropriate assumptions.",
author = "Ji Liu and Angelia Nedich and Tamer Basar",
year = "2014",
doi = "10.1109/CDC.2014.7039607",
language = "English (US)",
volume = "2015-February",
pages = "1464--1469",
journal = "Scanning Electron Microscopy",
issn = "0586-5581",
publisher = "Scanning Microscopy International",
number = "February",

}

TY - JOUR

T1 - Complex constrained consensus

AU - Liu, Ji

AU - Nedich, Angelia

AU - Basar, Tamer

PY - 2014

Y1 - 2014

N2 - In a network of m > 1 agents, constrained consensus means that all m agents reach an agreement on a specific value of some quantity via local interactions while their states are restricted to lie in different closed convex sets. This paper formulates and solves two generalized versions of the basic constrained consensus problem. The first version deals with the case when the constraint set of each agent is complex so that the projection operation on the whole constraint set is computationally expensive or even prohibitive. The second version models the constrained flocking problem in which each agent can only sense the current headings of its neighbors and independently updates its heading at times determined by its own clock. Two constrained consensus algorithms are proposed for the two versions. Both are guaranteed to reach a consensus under appropriate assumptions.

AB - In a network of m > 1 agents, constrained consensus means that all m agents reach an agreement on a specific value of some quantity via local interactions while their states are restricted to lie in different closed convex sets. This paper formulates and solves two generalized versions of the basic constrained consensus problem. The first version deals with the case when the constraint set of each agent is complex so that the projection operation on the whole constraint set is computationally expensive or even prohibitive. The second version models the constrained flocking problem in which each agent can only sense the current headings of its neighbors and independently updates its heading at times determined by its own clock. Two constrained consensus algorithms are proposed for the two versions. Both are guaranteed to reach a consensus under appropriate assumptions.

UR - http://www.scopus.com/inward/record.url?scp=84988220942&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84988220942&partnerID=8YFLogxK

U2 - 10.1109/CDC.2014.7039607

DO - 10.1109/CDC.2014.7039607

M3 - Article

VL - 2015-February

SP - 1464

EP - 1469

JO - Scanning Electron Microscopy

JF - Scanning Electron Microscopy

SN - 0586-5581

IS - February

M1 - 7039607

ER -