A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks

Kód výsledku v IS VaVaI

RIV/67985556:_____/18:00506575 - isvavai.cz

Výsledek na webu

https://www.cys.cic.ipn.mx/ojs/index.php/CyS/article/view/2420

DOI - Digital Object Identifier

10.13053/CyS-22-2-2420

Jazyk výsledku

angličtina

Název v původním jazyce

A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

A Finite-Time Consensus Algorithm with Simple Structure for Fixed Networks

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20201 - Electrical and electronic engineering

Projekt

GA13-20433S: Analýza a řízení globálně dekomponovaných silně nelineárních stavových dynamických modelů se složitými interakcemi jejich komponent

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computación y Sistemas

ISSN

2007-9737

e-ISSN

—

Svazek periodika

22

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

MX - Spojené státy mexické

Počet stran výsledku

10

Strana od-do

547-556

Kód UT WoS článku

000438112800017

EID výsledku v databázi Scopus

2-s2.0-85049824968