Delay Consensus Margin of First-Order Multiagent Systems With Undirected Graphs and PD Protocols

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)4192-4198
Journal / PublicationIEEE Transactions on Automatic Control
Volume66
Issue number9
Online published3 Nov 2020
Publication statusPublished - Sep 2021

Abstract

In this article, we study robust consensus problems for continuous-time first-order multiagent systems (MASs) with time delays. We assume that the agents input is subject to an uncertain constant delay, which may arise due to interagent communication or additionally, also by self-delay in the agent dynamics. We consider dynamic feedback control protocol in the form of proportional and derivative (PD) control, and seek to determine the delay consensus margin (DCM) achievable by PD feedback protocols, whereas the DCM is a robustness measure that defines the maximal range of delay within which robust consensus can be achieved despite the uncertainty in the delay. With an undirected graph, we show that the DCM can be determined exactly by solving a unimodal concave optimization problem, which is one of univariate convex optimization and can be solved using convex optimization or gradient-based numerical methods. The results show how unstable agent dynamics and graph connectivity may limit the range of delay tolerable, so that consensus can or cannot be maintained in the presence of delay variations.

Research Area(s)

  • Delays, Protocols, Robustness, PD control, Convex functions, Multi-agent systems, Optimization, Concavity, multiagent systems (MASs), proportional and derivative (PD) control protocol, robust consensus, uncertain delay, ROBUSTNESS