Consensus seeking over random digraphs

Maurizio Porfiri, Daniel J. Stilwell

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

Abstract

We examine the consensus problem for a group of agents that communicate via a network whose topology switches randomly. The presence of a communication link between a pair of agents is random. In order to account for general information flow, communication among agents is directed, and each link possess a possibly different non-negative weight. At random instants, the communication network topology switches randomly between a finite set of topologies. Sufficient conditions for asymptotic almost sure consensus are presented.

Original languageEnglish (US)
Title of host publicationCollection of Technical Papers - AIAA Guidance, Navigation, and Control Conference 2006
PublisherAmerican Institute of Aeronautics and Astronautics Inc.
Pages1319-1326
Number of pages8
ISBN (Print)1563478196, 9781563478192
DOIs
StatePublished - 2006
EventAIAA Guidance, Navigation, and Control Conference 2006 - Keystone, CO, United States
Duration: Aug 21 2006Aug 24 2006

Publication series

NameCollection of Technical Papers - AIAA Guidance, Navigation, and Control Conference 2006
Volume2

Other

OtherAIAA Guidance, Navigation, and Control Conference 2006
CountryUnited States
CityKeystone, CO
Period8/21/068/24/06

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Consensus seeking over random digraphs'. Together they form a unique fingerprint.

Cite this