Characterizing convergence speed for consensus seeking over dynamically switching directed random networks

Jing Zhou, Qian Wang

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

1 Citation (Scopus)

Abstract

Characterizing convergence speed is one of the important research challenges in the design of distributed consensus algorithms for networked multi-agent systems. In this paper, we consider a group of agents that communicate via a dynamically switching directed random network. Each link in the network, which represents the directed information flow between any ordered pair of agents, could be subject to failure with certain probability. Hence we model the information flow using dynamic random digraphs. We characterize the convergence speed for the distributed discrete-time consensus algorithm over a variety of random networks with arbitrary weights. In particular, we propose the per-step (mean square) convergence factor as a measure of the convergence speed and derive the exact value for this factor. Numerical examples are also given to illustrate our theoretical results.

Original languageEnglish (US)
Title of host publication2009 American Control Conference, ACC 2009
Pages629-634
Number of pages6
DOIs
StatePublished - Nov 23 2009
Event2009 American Control Conference, ACC 2009 - St. Louis, MO, United States
Duration: Jun 10 2009Jun 12 2009

Publication series

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

Other

Other2009 American Control Conference, ACC 2009
CountryUnited States
CitySt. Louis, MO
Period6/10/096/12/09

Fingerprint

Multi agent systems
Parallel algorithms

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Zhou, J., & Wang, Q. (2009). Characterizing convergence speed for consensus seeking over dynamically switching directed random networks. In 2009 American Control Conference, ACC 2009 (pp. 629-634). [5159980] (Proceedings of the American Control Conference). https://doi.org/10.1109/ACC.2009.5159980
Zhou, Jing ; Wang, Qian. / Characterizing convergence speed for consensus seeking over dynamically switching directed random networks. 2009 American Control Conference, ACC 2009. 2009. pp. 629-634 (Proceedings of the American Control Conference).
@inproceedings{c1b760dbfd124ace97dc978119ff0cb6,
title = "Characterizing convergence speed for consensus seeking over dynamically switching directed random networks",
abstract = "Characterizing convergence speed is one of the important research challenges in the design of distributed consensus algorithms for networked multi-agent systems. In this paper, we consider a group of agents that communicate via a dynamically switching directed random network. Each link in the network, which represents the directed information flow between any ordered pair of agents, could be subject to failure with certain probability. Hence we model the information flow using dynamic random digraphs. We characterize the convergence speed for the distributed discrete-time consensus algorithm over a variety of random networks with arbitrary weights. In particular, we propose the per-step (mean square) convergence factor as a measure of the convergence speed and derive the exact value for this factor. Numerical examples are also given to illustrate our theoretical results.",
author = "Jing Zhou and Qian Wang",
year = "2009",
month = "11",
day = "23",
doi = "10.1109/ACC.2009.5159980",
language = "English (US)",
isbn = "9781424445240",
series = "Proceedings of the American Control Conference",
pages = "629--634",
booktitle = "2009 American Control Conference, ACC 2009",

}

Zhou, J & Wang, Q 2009, Characterizing convergence speed for consensus seeking over dynamically switching directed random networks. in 2009 American Control Conference, ACC 2009., 5159980, Proceedings of the American Control Conference, pp. 629-634, 2009 American Control Conference, ACC 2009, St. Louis, MO, United States, 6/10/09. https://doi.org/10.1109/ACC.2009.5159980

Characterizing convergence speed for consensus seeking over dynamically switching directed random networks. / Zhou, Jing; Wang, Qian.

2009 American Control Conference, ACC 2009. 2009. p. 629-634 5159980 (Proceedings of the American Control Conference).

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

TY - GEN

T1 - Characterizing convergence speed for consensus seeking over dynamically switching directed random networks

AU - Zhou, Jing

AU - Wang, Qian

PY - 2009/11/23

Y1 - 2009/11/23

N2 - Characterizing convergence speed is one of the important research challenges in the design of distributed consensus algorithms for networked multi-agent systems. In this paper, we consider a group of agents that communicate via a dynamically switching directed random network. Each link in the network, which represents the directed information flow between any ordered pair of agents, could be subject to failure with certain probability. Hence we model the information flow using dynamic random digraphs. We characterize the convergence speed for the distributed discrete-time consensus algorithm over a variety of random networks with arbitrary weights. In particular, we propose the per-step (mean square) convergence factor as a measure of the convergence speed and derive the exact value for this factor. Numerical examples are also given to illustrate our theoretical results.

AB - Characterizing convergence speed is one of the important research challenges in the design of distributed consensus algorithms for networked multi-agent systems. In this paper, we consider a group of agents that communicate via a dynamically switching directed random network. Each link in the network, which represents the directed information flow between any ordered pair of agents, could be subject to failure with certain probability. Hence we model the information flow using dynamic random digraphs. We characterize the convergence speed for the distributed discrete-time consensus algorithm over a variety of random networks with arbitrary weights. In particular, we propose the per-step (mean square) convergence factor as a measure of the convergence speed and derive the exact value for this factor. Numerical examples are also given to illustrate our theoretical results.

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

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

U2 - 10.1109/ACC.2009.5159980

DO - 10.1109/ACC.2009.5159980

M3 - Conference contribution

AN - SCOPUS:70449629518

SN - 9781424445240

T3 - Proceedings of the American Control Conference

SP - 629

EP - 634

BT - 2009 American Control Conference, ACC 2009

ER -

Zhou J, Wang Q. Characterizing convergence speed for consensus seeking over dynamically switching directed random networks. In 2009 American Control Conference, ACC 2009. 2009. p. 629-634. 5159980. (Proceedings of the American Control Conference). https://doi.org/10.1109/ACC.2009.5159980