A class of robust consensus algorithms with predefined‐time convergence under switching topologies

From MaRDI portal
Publication:5212474

DOI10.1002/RNC.4715zbMATH Open1432.93305arXiv1812.07545OpenAlexW3101020844WikidataQ127303559 ScholiaQ127303559MaRDI QIDQ5212474FDOQ5212474


Authors: Rodrigo Aldana-López, David Gómez-Gutiérrez, Michael Defoort, Juan Diego Sánchez-Torres, Aldo-Jonathan Muñoz-Vázquez Edit this on Wikidata


Publication date: 29 January 2020

Published in: International Journal of Robust and Nonlinear Control (Search for Journal in Brave)

Abstract: This paper addresses the robust consensus problem under switching topologies. Contrary to existing methods, the proposed approach provides decentralized protocols that achieve consensus for networked multi-agent systems in a predefined time. Namely, the protocol design provides a tuning parameter that allows setting the convergence time of the agents to a consensus state. An appropriate Lyapunov analysis exposes the capability of the current proposal to achieve predefined-time consensus over switching topologies despite the presence of bounded perturbations. Finally, the paper presents a comparison showing that the suggested approach subsumes existing fixed-time consensus algorithms and provides extra degrees of freedom to obtain predefined-time consensus protocols that are less over-engineered, i.e., the difference between the estimated convergence time and its actual value is lower in our approach. Numerical results are given to illustrate the effectiveness and advantages of the proposed approach.


Full work available at URL: https://arxiv.org/abs/1812.07545




Recommendations




Cites Work


Cited In (16)





This page was built for publication: A class of robust consensus algorithms with predefined‐time convergence under switching topologies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212474)