A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00328805" target="_blank" >RIV/68407700:21230/18:00328805 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.13053/CyS-22-2-2420" target="_blank" >http://dx.doi.org/10.13053/CyS-22-2-2420</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.13053/CyS-22-2-2420" target="_blank" >10.13053/CyS-22-2-2420</a>
Alternative languages
Result language
angličtina
Original language name
A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
20205 - Automation and control systems
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
COMPUTACION Y SISTEMAS
ISSN
1405-5546
e-ISSN
—
Volume of the periodical
22
Issue of the periodical within the volume
2
Country of publishing house
MX - MEXICO
Number of pages
10
Pages from-to
547-556
UT code for WoS article
000438112800017
EID of the result in the Scopus database
2-s2.0-85049824968