Internal stability of linear consensus processes

Ji Liu, A. Stephen Morse, Angelia Nedich, Tamer Basar

Research output: Contribution to journalArticle

24 Citations (Scopus)

Abstract

In a network of n agents, consensus means that all n agents reach an agreement on a specific value of some quantity via local interactions. A linear consensus process can typically be modeled by a discrete-time linear recursion equation or a continuous-time linear differential equation, whose equilibria include nonzero states of the form a1 where a is a constant and 1 is a column vector in n whose entries all equal 1. Using a suitably defined semi-norm, this paper extends the standard notions of uniform asymptotic stability and exponential stability from linear systems to linear recursions and differential equations of this type. It is shown that these notions are equivalent just as they are for conventional linear systems. The main contributions of this paper are first to provide a simple, direct proof of the necessary graph-theoretic condition given in [1] for a discrete-time linear consensus process to be exponentially stable, and second to derive a necessary graph-theoretic condition for a piecewise time-invariant continuous-time linear consensus process to be exponentially stable.

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

Fingerprint

Asymptotic stability
Linear equations
Linear systems
Differential equations
Internal
Recursion
Continuous Time
Discrete-time
Linear Systems
Uniform Asymptotic Stability
Column vector
Local Interaction
Seminorm
Necessary
Graph in graph theory
Exponential Stability
Linear differential equation
Differential equation
Invariant

ASJC Scopus subject areas

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

Cite this

Liu, J., Morse, A. S., Nedich, A., & Basar, T. (2014). Internal stability of linear consensus processes. Unknown Journal, 2015-February(February), 922-927. [7039499]. https://doi.org/10.1109/CDC.2014.7039499

Internal stability of linear consensus processes. / Liu, Ji; Morse, A. Stephen; Nedich, Angelia; Basar, Tamer.

In: Unknown Journal, Vol. 2015-February, No. February, 7039499, 2014, p. 922-927.

Research output: Contribution to journalArticle

Liu, J, Morse, AS, Nedich, A & Basar, T 2014, 'Internal stability of linear consensus processes', Unknown Journal, vol. 2015-February, no. February, 7039499, pp. 922-927. https://doi.org/10.1109/CDC.2014.7039499
Liu J, Morse AS, Nedich A, Basar T. Internal stability of linear consensus processes. Unknown Journal. 2014;2015-February(February):922-927. 7039499. https://doi.org/10.1109/CDC.2014.7039499
Liu, Ji ; Morse, A. Stephen ; Nedich, Angelia ; Basar, Tamer. / Internal stability of linear consensus processes. In: Unknown Journal. 2014 ; Vol. 2015-February, No. February. pp. 922-927.
@article{e45ec18712364935af3d3b73620658b2,
title = "Internal stability of linear consensus processes",
abstract = "In a network of n agents, consensus means that all n agents reach an agreement on a specific value of some quantity via local interactions. A linear consensus process can typically be modeled by a discrete-time linear recursion equation or a continuous-time linear differential equation, whose equilibria include nonzero states of the form a1 where a is a constant and 1 is a column vector in n whose entries all equal 1. Using a suitably defined semi-norm, this paper extends the standard notions of uniform asymptotic stability and exponential stability from linear systems to linear recursions and differential equations of this type. It is shown that these notions are equivalent just as they are for conventional linear systems. The main contributions of this paper are first to provide a simple, direct proof of the necessary graph-theoretic condition given in [1] for a discrete-time linear consensus process to be exponentially stable, and second to derive a necessary graph-theoretic condition for a piecewise time-invariant continuous-time linear consensus process to be exponentially stable.",
author = "Ji Liu and Morse, {A. Stephen} and Angelia Nedich and Tamer Basar",
year = "2014",
doi = "10.1109/CDC.2014.7039499",
language = "English (US)",
volume = "2015-February",
pages = "922--927",
journal = "Scanning Electron Microscopy",
issn = "0586-5581",
publisher = "Scanning Microscopy International",
number = "February",

}

TY - JOUR

T1 - Internal stability of linear consensus processes

AU - Liu, Ji

AU - Morse, A. Stephen

AU - Nedich, Angelia

AU - Basar, Tamer

PY - 2014

Y1 - 2014

N2 - In a network of n agents, consensus means that all n agents reach an agreement on a specific value of some quantity via local interactions. A linear consensus process can typically be modeled by a discrete-time linear recursion equation or a continuous-time linear differential equation, whose equilibria include nonzero states of the form a1 where a is a constant and 1 is a column vector in n whose entries all equal 1. Using a suitably defined semi-norm, this paper extends the standard notions of uniform asymptotic stability and exponential stability from linear systems to linear recursions and differential equations of this type. It is shown that these notions are equivalent just as they are for conventional linear systems. The main contributions of this paper are first to provide a simple, direct proof of the necessary graph-theoretic condition given in [1] for a discrete-time linear consensus process to be exponentially stable, and second to derive a necessary graph-theoretic condition for a piecewise time-invariant continuous-time linear consensus process to be exponentially stable.

AB - In a network of n agents, consensus means that all n agents reach an agreement on a specific value of some quantity via local interactions. A linear consensus process can typically be modeled by a discrete-time linear recursion equation or a continuous-time linear differential equation, whose equilibria include nonzero states of the form a1 where a is a constant and 1 is a column vector in n whose entries all equal 1. Using a suitably defined semi-norm, this paper extends the standard notions of uniform asymptotic stability and exponential stability from linear systems to linear recursions and differential equations of this type. It is shown that these notions are equivalent just as they are for conventional linear systems. The main contributions of this paper are first to provide a simple, direct proof of the necessary graph-theoretic condition given in [1] for a discrete-time linear consensus process to be exponentially stable, and second to derive a necessary graph-theoretic condition for a piecewise time-invariant continuous-time linear consensus process to be exponentially stable.

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

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

U2 - 10.1109/CDC.2014.7039499

DO - 10.1109/CDC.2014.7039499

M3 - Article

VL - 2015-February

SP - 922

EP - 927

JO - Scanning Electron Microscopy

JF - Scanning Electron Microscopy

SN - 0586-5581

IS - February

M1 - 7039499

ER -