Convergence rate analysis of a fault-tolerant distributed consensus algorithm

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

8 Citations (Scopus)

Abstract

In this paper, the convergence rate and time analysis of a fault-tolerant consensus algorithm that we proposed in [1] is carried out for asynchronous and synchronous partially connected networks with delay on communication paths. The results are also extended to the case of networks with time-varying underlying graph topology.

Original languageEnglish
Title of host publicationProceedings of the 2015 IEEE 54th Annual Conference on Decision and Control
Subtitle of host publicationCDC 2015
EditorsY. Ohta, M. Sampei, A. Astolfi
Place of PublicationPiscataway, NJ, USA
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages5111-5116
ISBN (Print)978-1-4799-7886-1
DOIs
Publication statusPublished - 2016
Event54th IEEE Conference on Decision and Control, CDC 2015 - Osaka, Japan
Duration: 15 Dec 201518 Dec 2015
Conference number: 54

Conference

Conference54th IEEE Conference on Decision and Control, CDC 2015
Abbreviated titleCDC 2015
CountryJapan
CityOsaka
Period15/12/1518/12/15

Keywords

  • Algorithm design and analysis
  • Approximation algorithms
  • Convergence
  • Fault tolerance
  • Fault tolerant systems
  • Robots
  • Robustness

Fingerprint

Dive into the research topics of 'Convergence rate analysis of a fault-tolerant distributed consensus algorithm'. Together they form a unique fingerprint.

Cite this