bibtype J - Journal Article
ARLID 0496006
utime 20240111141009.1
mtime 20181107235959.9
SCOPUS 85057300373
WOS 000558913100009
DOI 10.1080/00207179.2018.1543896
title (primary) (eng) On finite-time and fixed-time consensus algorithms for dynamic networks switching among disconnected digraphs
specification
page_count 17 s.
media_type P
serial
ARLID cav_un_epca*0256786
ISSN 0020-7179
title International Journal of Control
volume_id 93
volume 9 (2020)
page_num 2120-2134
publisher
name Taylor & Francis
keyword Fixed-time consensus
keyword Finite-time consensus
keyword dynamical networks
keyword multi-agent systems
keyword multiple interacting autonomous agents
keyword self-organizing systems
author (primary)
ARLID cav_un_auth*0343234
name1 Gómez-Gutiérrez
name2 D.
country MX
author
ARLID cav_un_auth*0367151
name1 Vázquez
name2 C. R.
country MX
author
ARLID cav_un_auth*0101074
name1 Čelikovský
name2 Sergej
institution UTIA-B
full_dept (cz) Teorie řízení
full_dept Department of Control Theory
department (cz)
department TR
full_dept Department of Control Theory
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0367129
name1 Sánchez-Torres
name2 J. D.
country MX
author
ARLID cav_un_auth*0213231
name1 Ruiz-León
name2 J.
country MX
source
source_size 664 kB
url https://www.tandfonline.com/doi/full/10.1080/00207179.2018.1543896
cas_special
project
project_id GA17-04682S
agency GA ČR
country CZ
ARLID cav_un_auth*0347203
abstract (eng) The aim of this paper is to analyze a class of consensus algorithms with finite-time or fixed-time convergence for dynamic networks formed by agents with first-order dynamics. In particular, in the analyzed class a single evaluation of a nonlinear function of the consensus error is performed per each node. The classical assumption of switching among connected graphs is dropped here, allowing to represent failures and intermittent communications between agents. Thus, conditions to guarantee finite and fixed-time convergence, even while switching among disconnected graphs, are provided. Moreover, the algorithms of the considered class are shown to be computationally simpler than previously proposed finite-time consensus algorithms for dynamic networks, which is an important feature in scenarios with computationally limited nodes and energy efficiency requirements such as in sensor networks. The performance of the considered consensus algorithms is illustrated through simulations, comparing it to existing approaches for dynamic networks with finite-time and fixed-time convergence. It is shown that the settling time of the considered algorithms grows slower when the number of nodes increases than with other consensus algorithms for dynamic networks.
result_subspec WOS
RIV BC
FORD0 20000
FORD1 20200
FORD2 20201
reportyear 2021
num_of_auth 5
inst_support RVO:67985556
permalink http://hdl.handle.net/11104/0288845
cooperation
ARLID cav_un_auth*0367152
name Multi-agent autonomous systems lab, Intel Labs, Intel Tecnología de México
country MX
cooperation
ARLID cav_un_auth*0367153
name Tecnologico de Monterrey, Escuela de Ingeniería y Ciencias
country MX
cooperation
ARLID cav_un_auth*0367154
name Research Laboratory on Optimal Design, Devices and Advanced Materials -OPTIMA-, Department of Mathematics and Physics, ITESO
country MX
cooperation
ARLID cav_un_auth*0343241
name CINVESTAV, Unidad Guadalajara
country MX
confidential S
mrcbC86 1 Article Automation Control Systems
mrcbC91 C
mrcbT16-e AUTOMATIONCONTROLSYSTEMS
mrcbT16-i 0.00822
mrcbT16-j 0.763
mrcbT16-s 0.793
mrcbT16-B 41.816
mrcbT16-D Q3
mrcbT16-E Q3
arlyear 2020
mrcbU14 85057300373 SCOPUS
mrcbU24 PUBMED
mrcbU34 000558913100009 WOS
mrcbU56 664 kB
mrcbU63 cav_un_epca*0256786 International Journal of Control 0020-7179 1366-5820 Roč. 93 č. 9 2020 2120 2134 Taylor & Francis