Formation Static Output Control of Linear Multi-Agent Systems With Hidden Markov Switching Network Topologies
E. S. Rodriguez-Canale, Oswaldo L. V. Costa
IEEE Access · 2021
doi:10.1109/access.2021.3115047 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
This paper addresses the <inline-formula> <tex-math notation="LaTeX">$\mathcal {H}_{2}$ </tex-math></inline-formula>, <inline-formula> <tex-math notation="LaTeX">$\mathcal {H}_\infty $ </tex-math></inline-formula> and mixed <inline-formula> <tex-math notation="LaTeX">$\mathcal {H}_{2}/\mathcal {H}_\infty $ </tex-math></inline-formula> formation static output control of continuous-time linear multi-agent systems with Markovian switching network topologies. It is assumed that the operation mode of the network topology cannot be directly measured but, instead, can be estimated by an imperfect detector. To model this problem, we consider a continuous-time hidden Markov model, in which the hidden component represents the real operation mode of the network topology while the observed component represents the information emitted from the detector and available for the controller. It is also assumed that only a partial information from the state variables of the multi-agent systems is available. By using an LMI (linear matrix inequality) formulation, a distributed static output controller which switches according to the detector information is designed to guarantee the stability in the mean square sense of the closed loop system, as well as an upper-bound for an index performance. Three situations are considered for the performance criteria: the <inline-formula> <tex-math notation="LaTeX">$\mathcal {H}_{2}$ </tex-math></inline-formula> norm, the <inline-formula> <tex-math notation="LaTeX">$\mathcal {H}_\infty $ </tex-math></inline-formula> norm, and the mixed <inline-formula> <tex-math notation="LaTeX">$\mathcal {H}_{2}/\mathcal {H}_\infty $ </tex-math></inline-formula> norms. The paper is concluded with a numerical example to illustrate the effectiveness of the theoretical results.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.