Consensus analysis of large-scale nonlinear homogeneous multiagent formations with polynomial dynamics
From MaRDI portal
Abstract: Drawing inspiration from the theory of linear "decomposable systems", we provide a method, based on linear matrix inequalities (LMIs), which makes it possible to prove the convergence (or consensus) of a set of interacting agents with polynomial dynamic. We also show that the use of a generalised version of the famous Kalman-Yakubovic-Popov lemma allows the development of an LMI test whose size does not depend on the number of agents. The method is validated experimentally on two academic examples.
Recommendations
- On topology and dynamics of consensus among linear high-order agents
- A sum-of-squares approach to consensus of nonlinear leader-follower multi-agent systems based on novel polynomial and fuzzy polynomial models
- Multi-consensus of nonlinearly networked multi-agent systems
- Consensus in nonlinear stationary networks with identical agents
- Consensus control for a class of networks of dynamic agents
Cited in
(2)
This page was built for publication: Consensus analysis of large-scale nonlinear homogeneous multiagent formations with polynomial dynamics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4626648)