Number of the records: 1
A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks
- 1.
SYSNO ASEP 0506575 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks Author(s) Goméz-Gutiérrez, D. (MX)
Ruiz-León, J. (MX)
Čelikovský, Sergej (UTIA-B) RID, ORCID
Sánchez-Torres, J. D. (MX)Number of authors 4 Source Title Computación y Sistemas. - : DF Instituto Politécnico Nacional - ISSN 2007-9737
Roč. 22, č. 2 (2018), s. 547-556Number of pages 10 s. Publication form Print - P Language eng - English Country MX - Mexico Keywords Finite-time consensus ; Multi-agent systems ; Multiple interacting autonomous agents ; Self-organizing systems Subject RIV BC - Control Systems Theory OECD category Electrical and electronic engineering R&D Projects GA13-20433S GA ČR - Czech Science Foundation (CSF) Method of publishing Limited access Institutional support UTIA-B - RVO:67985556 UT WOS 000438112800017 EID SCOPUS 85049824968 DOI 10.13053/CyS-22-2-2420 Annotation 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. Workplace Institute of Information Theory and Automation Contact Markéta Votavová, votavova@utia.cas.cz, Tel.: 266 052 201. Year of Publishing 2020 Electronic address https://www.cys.cic.ipn.mx/ojs/index.php/CyS/article/view/2420
Number of the records: 1