Skip to main navigation Skip to search Skip to main content

Multi-agent consensus under delayed feedback: Fundamental constraint on graph and fundamental bound on delay

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

In this paper, we study the consensus problem for discrete-time multi-agent systems over an undirected, fixed network communication graph. We assume that the agents' input is subject to a constant albeit possibly unknown time delay, and employ a distributed dynamic state feedback control protocol. Drawing upon concepts and techniques from robust control, notably those concerning gain margin optimization and analytic interpolation, we derive explicit, closed-form conditions for general linear agents to achieve consensus. Our results display an explicit dependence of the consensus condition on the agent's unstable dynamics and the delay value, showing that delayed communication between agents will generally hinder consensus and impose restrictions on the network topology. We also show that a lower bound on the maximal delay allowable for consensus can be computed by a simple line search method. © 2013 AACC American Automatic Control Council.
Original languageEnglish
Title of host publicationProceedings of the American Control Conference
Pages952-957
Publication statusPublished - 2013
Event2013 American Control Conference (ACC 2013) - Renaissance Washington, DC Downtown Hotel, Washington, DC, United States
Duration: 17 Jun 201319 Jun 2013
Conference number: 1st
https://acc2013.a2c2.org/

Publication series

Name
ISSN (Print)0743-1619

Conference

Conference2013 American Control Conference (ACC 2013)
PlaceUnited States
CityWashington, DC
Period17/06/1319/06/13
Internet address

Fingerprint

Dive into the research topics of 'Multi-agent consensus under delayed feedback: Fundamental constraint on graph and fundamental bound on delay'. Together they form a unique fingerprint.

Cite this