WSEAS Transactions on Systems and Control
Print ISSN: 1991-8763, E-ISSN: 2224-2856
Volume 20, 2025
Consensus in Networks with Ostensible Metzler Agents
Author:
Search Articles
Abstract: This paper deals with consensus in a network of linear, ostensible Metzler agents whose communication
topology is defined by an undirected graph. An observer-type consensus protocol is used and conditions for
consensus within such a protocol are derived. The design problem is solved using separation of ostensible Metzler
matrices and is parameterized using linear matrix inequalities. The methodology guarantees strictly positive
observer and protocol gain matrices, which overcomes the conservatism generally caused by non-negative matrix
parameters of agents. The properties of the proposed approach are illustrated by a numerical example.
Keywords:
ostensible Metzler matrices, parametric constraints, linear matrix inequalities, state estimation, consensus protocol, cooperative systems control
Pages: 551-559
DOI: 10.37394/23203.2025.20.54