Title
A Finite-Time Consensus Algorithm With Simple Structure For Fixed Networks
Abstract
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.
Year
DOI
Venue
2018
10.13053/CyS-22-2-2420
COMPUTACION Y SISTEMAS
Keywords
Field
DocType
Finite-time consensus, multi-agent systems, multiple interacting autonomous agents, self-organizing systems
Convergence (routing),Mathematical optimization,Efficient energy use,Computer science,Self-organization,Cycle graph,Multi-agent system,Robustness (computer science),Network topology,Wireless sensor network
Journal
Volume
Issue
ISSN
22
2
1405-5546
Citations 
PageRank 
References 
1
0.34
0
Authors
4
Name
Order
Citations
PageRank
David Gomez-Gutierrez1398.24
Javier Ruiz-León2248.24
Sergej Celikovský335997.30
Juan Diego Sanchez-Torres45313.70