Dynamic average consensus on synchronous communication networks

Minghui Zhu, Sonia Martínez

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

15 Citations (Scopus)

Abstract

We propose a class of dynamic average consensus algorithms that allow a group of agents to track the average of their measured signals. The algorithms are implemented in discrete time and require a synchronous communication schedule. The convergence results rely on the input-to-output stability properties of consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set of signals is that the difference of the nth-order derivatives of any two signals be bounded for some n ≥ 0.

Original languageEnglish (US)
Title of host publication2008 American Control Conference, ACC
Pages4382-4387
Number of pages6
DOIs
StatePublished - Sep 30 2008
Event2008 American Control Conference, ACC - Seattle, WA, United States
Duration: Jun 11 2008Jun 13 2008

Publication series

NameProceedings of the American Control Conference
ISSN (Print)0743-1619

Other

Other2008 American Control Conference, ACC
CountryUnited States
CitySeattle, WA
Period6/11/086/13/08

Fingerprint

Telecommunication networks
Communication
Derivatives

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Zhu, M., & Martínez, S. (2008). Dynamic average consensus on synchronous communication networks. In 2008 American Control Conference, ACC (pp. 4382-4387). [4587184] (Proceedings of the American Control Conference). https://doi.org/10.1109/ACC.2008.4587184
Zhu, Minghui ; Martínez, Sonia. / Dynamic average consensus on synchronous communication networks. 2008 American Control Conference, ACC. 2008. pp. 4382-4387 (Proceedings of the American Control Conference).
@inproceedings{813526358f8c423cb43eca518c2be9ce,
title = "Dynamic average consensus on synchronous communication networks",
abstract = "We propose a class of dynamic average consensus algorithms that allow a group of agents to track the average of their measured signals. The algorithms are implemented in discrete time and require a synchronous communication schedule. The convergence results rely on the input-to-output stability properties of consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set of signals is that the difference of the nth-order derivatives of any two signals be bounded for some n ≥ 0.",
author = "Minghui Zhu and Sonia Mart{\'i}nez",
year = "2008",
month = "9",
day = "30",
doi = "10.1109/ACC.2008.4587184",
language = "English (US)",
isbn = "9781424420797",
series = "Proceedings of the American Control Conference",
pages = "4382--4387",
booktitle = "2008 American Control Conference, ACC",

}

Zhu, M & Martínez, S 2008, Dynamic average consensus on synchronous communication networks. in 2008 American Control Conference, ACC., 4587184, Proceedings of the American Control Conference, pp. 4382-4387, 2008 American Control Conference, ACC, Seattle, WA, United States, 6/11/08. https://doi.org/10.1109/ACC.2008.4587184

Dynamic average consensus on synchronous communication networks. / Zhu, Minghui; Martínez, Sonia.

2008 American Control Conference, ACC. 2008. p. 4382-4387 4587184 (Proceedings of the American Control Conference).

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

TY - GEN

T1 - Dynamic average consensus on synchronous communication networks

AU - Zhu, Minghui

AU - Martínez, Sonia

PY - 2008/9/30

Y1 - 2008/9/30

N2 - We propose a class of dynamic average consensus algorithms that allow a group of agents to track the average of their measured signals. The algorithms are implemented in discrete time and require a synchronous communication schedule. The convergence results rely on the input-to-output stability properties of consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set of signals is that the difference of the nth-order derivatives of any two signals be bounded for some n ≥ 0.

AB - We propose a class of dynamic average consensus algorithms that allow a group of agents to track the average of their measured signals. The algorithms are implemented in discrete time and require a synchronous communication schedule. The convergence results rely on the input-to-output stability properties of consensus algorithms and require that the union of communication graphs over a bounded period of time be strongly connected. The only requirement on the set of signals is that the difference of the nth-order derivatives of any two signals be bounded for some n ≥ 0.

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

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

U2 - 10.1109/ACC.2008.4587184

DO - 10.1109/ACC.2008.4587184

M3 - Conference contribution

AN - SCOPUS:52449103246

SN - 9781424420797

T3 - Proceedings of the American Control Conference

SP - 4382

EP - 4387

BT - 2008 American Control Conference, ACC

ER -

Zhu M, Martínez S. Dynamic average consensus on synchronous communication networks. In 2008 American Control Conference, ACC. 2008. p. 4382-4387. 4587184. (Proceedings of the American Control Conference). https://doi.org/10.1109/ACC.2008.4587184