A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks
Título del documento: A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks
Revista: Computación y sistemas
Base de datos:
Número de sistema: 000560154
ISSN: 1405-5546
Autores: 1
2
3
4
Instituciones: 1Instituto Tecnológico y de Estudios Superiores de Monterrey, Guadalajara, Jalisco. México
2Instituto Politécnico Nacional, Guadalajara, Jalisco. México
3Czech Academy of Sciences, Institute of Information Theory and Automation, Prague. República Checa
4Instituto Tecnologico y de Estudios Superiores de Occidente, Department of Mathematics and Physics, Guadalajara, Jalisco. México
Año:
Periodo: Abr-Jun
Volumen: 22
Número: 2
Paginación: 547-552
País: México
Idioma: Inglés
Tipo de documento: Artículo
Resumen en inglés 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.
Disciplinas: Ciencias de la computación
Palabras clave: Redes
Keyword: Finite-time consensus,
Multi-agent systems,
Multiple interacting autonomous agents,
Self-organizing systems,
Networks
Texto completo: Texto completo (Ver HTML) Texto completo (Ver PDF)