Distributed adaptive consensus protocol with Laplacian eigenvalues estimation

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00313504" target="_blank" >RIV/68407700:21230/17:00313504 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1109/PC.2017.7976225" target="_blank" >http://dx.doi.org/10.1109/PC.2017.7976225</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/PC.2017.7976225" target="_blank" >10.1109/PC.2017.7976225</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Distributed adaptive consensus protocol with Laplacian eigenvalues estimation

Popis výsledku v původním jazyce

This paper addresses distributed consensus problem for multi-agent systems with general linear time-invariant dynamics and undirected connected communication graphs. A distributed adaptive consensus protocol is found to solve problems of existing adaptive consensus protocols related to different, generally large and possibly unbounded coupling gains. This protocol guarantees ultimate boundedness under all conditions, however for an asymptotic stability, a proper estimation of reference values for coupling gains is required. Here, we propose an algorithm for the estimation of the coupling gain reference. The algorithm is based on a distributed estimation of the Laplacian eigenvalues. In comparison to the previously proposed algorithm based on the interval halving method, this algorithm offers robustness to change of the network topology. In addition, it decouples the estimation from the consensus protocol, hence it does not influence stability properties of the adaptive consensus protocol.

Název v anglickém jazyce

Distributed adaptive consensus protocol with Laplacian eigenvalues estimation

Popis výsledku anglicky

This paper addresses distributed consensus problem for multi-agent systems with general linear time-invariant dynamics and undirected connected communication graphs. A distributed adaptive consensus protocol is found to solve problems of existing adaptive consensus protocols related to different, generally large and possibly unbounded coupling gains. This protocol guarantees ultimate boundedness under all conditions, however for an asymptotic stability, a proper estimation of reference values for coupling gains is required. Here, we propose an algorithm for the estimation of the coupling gain reference. The algorithm is based on a distributed estimation of the Laplacian eigenvalues. In comparison to the previously proposed algorithm based on the interval halving method, this algorithm offers robustness to change of the network topology. In addition, it decouples the estimation from the consensus protocol, hence it does not influence stability properties of the adaptive consensus protocol.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

20205 - Automation and control systems

Projekt

<a href="/cs/project/GJ16-25493Y" target="_blank" >GJ16-25493Y: Použití kooperativních distribuovaných multiagentních systémů pro odhadování a řízení systémů s rozprostřenými parametry</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

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 statě ve sborníku

Proceedings of the 2017 21st International Conference on Process Control

ISBN

978-1-5386-4011-1

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

269-273

Název nakladatele

IEEE (Institute of Electrical and Electronics Engineers)

Místo vydání

—

Místo konání akce

Strbske Pleso

Datum konání akce

6. 6. 2017

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000412119800047