Open AccessObserver‐based positive edge consensus for directed nodal networks
Author(s) -
Qian Yuchen,
Zhang Wei,
Ji Mingming,
Yan Chenhang
Publication year - 2020
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2019.0945
Subject(s) - observer (physics) , mathematics , consensus , directed graph , network topology , sylvester equation , graph theory , protocol design , topology (electrical circuits) , state (computer science) , graph , control theory (sociology) , protocol (science) , mathematical optimization , computer science , multi agent system , algorithm , discrete mathematics , eigenvalues and eigenvectors , communications protocol , combinatorics , artificial intelligence , control (management) , medicine , physics , quantum mechanics , alternative medicine , pathology , operating system
The positive edge consensus problem of linear systems on undirected as well as directed nodal networks is studied here. The authors first present a distributed observer‐based positive edge consensus algorithm to address the problem. The proposed observer‐based protocol has more design freedom and a general form which includes the classical Luenberger observer‐based protocol as a special case. Moreover, with the help of line graph theory, they map the edge topology to the line topology such that the state of each edge in the connected networks can reach consensus. Sufficient conditions in terms of solving the Sylvester matrix equation, and the linear matrix inequalities are provided to design the proposed algorithm. Finally, a simulation example is given to verify the effectiveness of the proposed positive edge consensus protocol.