Solving a modified consensus problem of linear multi-agent systems

Authors:
Long Cheng;Zeng-Guang Hou;Yingzi Lin;Min Tan;Wenjun Zhang
Affiliations:
Key Laboratory of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, Beijing, China;Key Laboratory of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, Beijing, China;Department of Mechanical and Industrial Engineering, College of Engineering, Northeastern University, Boston, MA, USA;Key Laboratory of Complex Systems and Intelligence Science, Institute of Automation, Chinese Academy of Sciences, Beijing, China;Department of Mechanical Engineering, College of Engineering, University of Saskatchewan, Saskatoon, Saskatchewan, Canada
Venue:
Automatica (Journal of IFAC)
Year:
2011

Citing 5
Cited 1

Mathematical control theory: deterministic finite dimensional systems (2nd ed.)

Mathematical control theory: deterministic finite dimensional systems (2nd ed.)
Distributed algorithms for reaching consensus on general functions

Automatica (Journal of IFAC)
Brief paper: Synchronizing linear systems via partial-state coupling

Automatica (Journal of IFAC)
Decentralized robust adaptive control for the multiagent system consensus problem using neural networks

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Neural-network-based adaptive leader-following control for multiagent systems with uncertainties

IEEE Transactions on Neural Networks

Neural-network-based adaptive leader-following control for multiagent systems with uncertainties

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	22.14

Visualization

Abstract

A distributed protocol is proposed for a modified consensus problem of a network of agents that have the same continuous-time linear dynamics. Each agent estimates its own state using its output information and then sends the estimated state to its neighbor agents for the purpose of reaching a consensus. The modified consensus problem requires the group decision value to be a linear function of initial states and initial estimated states of all agents in the network, and the transformation matrix associated with this linear function not to be a zero matrix. It is proved that under the proposed control protocol, the modified consensus problem can be solved if and only if the system matrices of the agent's dynamics are stabilizable and detectable, the input matrix is not a zero matrix, and the communication topology graph has a spanning tree. The proposed protocol can also be extended to multi-agent systems where agents are described by discrete-time linear dynamics. The corresponding necessary and sufficient conditions are provided as well.