| bibtype |
J -
Journal Article
|
| ARLID |
0506575 |
| utime |
20240903204335.2 |
| mtime |
20190719235959.9 |
| SCOPUS |
85049824968 |
| WOS |
000438112800017 |
| DOI |
10.13053/CyS-22-2-2420 |
| title
(primary) (eng) |
A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks |
| specification |
| page_count |
10 s. |
| media_type |
P |
|
| serial |
| ARLID |
cav_un_epca*0506574 |
| ISSN |
2007-9737 |
| title
|
Computación y Sistemas |
| volume_id |
22 |
| volume |
2 (2018) |
| page_num |
547-556 |
| publisher |
| name |
DF Instituto Politécnico Nacional |
|
|
| keyword |
Finite-time consensus |
| keyword |
Multi-agent systems |
| keyword |
Multiple interacting autonomous agents |
| keyword |
Self-organizing systems |
| author
(primary) |
| ARLID |
cav_un_auth*0377257 |
| name1 |
Goméz-Gutiérrez |
| name2 |
D. |
| country |
MX |
|
| author
|
| ARLID |
cav_un_auth*0213231 |
| name1 |
Ruiz-León |
| name2 |
J. |
| 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) |
TŘ |
| 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 |
|
| source |
|
| cas_special |
| project |
| ARLID |
cav_un_auth*0292613 |
| project_id |
GA13-20433S |
| agency |
GA ČR |
|
| abstract
(eng) |
In this paper, a continuous-time consensus algorithm with guaranteed finite-time convergence is proposed. Using homogeneity theory, finite-time consensus is proved for fixed topologies. The proposed algorithm is computationally simpler than other reported finite-time consensus algorithms, which is an important feature in scenarios of energy efficient nodes with limited computing resources such as sensor networks. Additionally, the proposed approach is compared on simulations with existing consensus algorithms, namely, the standard asymptotic consensus algorithm and the finite-time and fixed-time convergent algorithms, showing, in cycle graph topology, better robustness features on the convergence with respect to the network growth with less control effort. Indeed, the convergence time of other previously proposed consensus algorithms grows faster as the network grows than the one herein proposed whereas the control effort of the proposed algorithm is lower. |
| result_subspec |
WOS |
| RIV |
BC |
| FORD0 |
20000 |
| FORD1 |
20200 |
| FORD2 |
20201 |
| reportyear |
2020 |
| num_of_auth |
4 |
| inst_support |
RVO:67985556 |
| permalink |
http://hdl.handle.net/11104/0297804 |
| cooperation |
| ARLID |
cav_un_auth*0377259 |
| name |
Tecnológico de Monterrey, Campus Guadalajara, Jalisco |
| country |
MX |
|
| cooperation |
| ARLID |
cav_un_auth*0377260 |
| name |
CINVESTAV-IPN, Unidad Guadalajara, Jalisco |
| institution |
CINVESTAV-IPN |
| country |
MX |
|
| cooperation |
| ARLID |
cav_un_auth*0377261 |
| name |
Czech Technical University in Prague, Faculty of Electrical Engineering, Prague, |
| country |
CZ |
|
| cooperation |
| ARLID |
cav_un_auth*0377262 |
| name |
ITESO Guadalajara, Department of Mathematics and Physics, Jalisco |
| institution |
ITESO |
| country |
MX |
|
| confidential |
S |
| mrcbC86 |
3+4 Article Computer Science Information Systems |
| mrcbC91 |
C |
| arlyear |
2018 |
| mrcbU14 |
85049824968 SCOPUS |
| mrcbU24 |
PUBMED |
| mrcbU34 |
000438112800017 WOS |
| mrcbU56 |
1,62 MB |
| mrcbU63 |
cav_un_epca*0506574 Computación y Sistemas 2007-9737 2007-9737 Roč. 22 č. 2 2018 547 556 DF Instituto Politécnico Nacional |
|