Algebraic criteria for consensus problems of continuous-time networked systems

DOI10.1080/00207170802123895zbMath1162.93018OpenAlexW2072294036MaRDI QIDQ3631397

Zonggang Li, Yingmin Jia

Publication date: 9 June 2009

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: http://www.informaworld.com/smpp/./content~db=all~content=a909651877

zbMATH Keywords

Laplacian matrixmulti-agent systemscooperative controlconsensus problemalgebraic criteriadigraph theorycontinuous-time networked systems

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Decentralized systems (93A14) Algebraic methods (93B25) Applications of graph theory to circuits and networks (94C15)

Related Items

Prescribed performance bipartite consensus for nonlinear agents with antagonistic interactions: a PI transformation approach ⋮ Containment of linear multi-agent systems under general interaction topologies ⋮ Adaptive Synchronization of Networked Mechanical Systems with Communication Delays ⋮ PI consensus error transformation for adaptive cooperative control of nonlinear multi-agent systems ⋮ Algebraic criteria for structure identification and behaviour analysis of signed networks

Cites Work

• Finite-time convergent gradient flows with applications to network consensus
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
• Stability of multiagent systems with time-dependent communication links
• Consensus seeking in multiagent systems under dynamically changing interaction topologies