2022•2022 41st Chinese Control Conference (CCC)Requires access

Leader-following consensus for linear multi-agent systems with measurement noises

Kairui Chen, Chuance Van, Zhangmou Zhu, Ping Li, Qijun Ren, Junwei Wang

Open publisher page 0 citations

Abstract

This paper investigates a leader-following consensus problem for high-order linear multi-agent systems under a directed graph topology, containing a spanning tree. It is supposed that each agent can obtain full state of itself and receive its neighbors' state with noises, where the intensities of noises are vector functions of relative states of agents. To achieve leader-following consensus in this scene, a consensus protocol is designed, where the gain matrix is obtained by the algebraic Riccati equation and the coupling strength should be restricted in a given interval. Specifically, the lower bound of the interval ensures the consensus and the upper bound of the interval is devoted to limit the effects of noises, then the designed protocol could attenuate the noises while driving the multi-agent systems to consensus. Finally, a simulation example is given to show the correctness of the proposed results.

About this research paper

What this paper is about

This paper investigates a leader-following consensus problem for high-order linear multi-agent systems under a directed graph topology, containing a spanning tree. It is supposed that each agent can obtain full state of itself and receive its neighbors' state with noises, where the intensities of noises are vector functions of relative states of agents. To achieve leader-following consensus in this scene, a consensus protocol is designed, where the gain matrix is obtained by the algebraic Riccati equation and the coupling strength should be restricted in a given interval. Specifically, the lower bound of the interval ensures the consensus and the upper bound of the interval is devoted to limit the effects of noises, then the designed protocol could attenuate the noises while driving the multi-agent systems to consensus. Finally, a simulation example is given to show the correctness of the proposed results.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper investigates a leader-following consensus problem for high-order linear multi-agent systems under a directed graph topology, containing a spanning tree. It is supposed that each agent can obtain full state of itself and receive its neighbors' state with noises, where the intensities of noises are vector functions of relative states of agents. To achieve leader-following consensus in this scene, a consensus protocol is designed, where the gain matrix is obtained by the algebraic Riccati equation and the coupling strength should be restricted in a given interval. Specifically, the lower bound of the interval ensures the consensus and the upper bound of the interval is devoted to limit the effects of noises, then the designed protocol could attenuate the noises while driving the multi-agent systems to consensus. Finally, a simulation example is given to show the correctness of the proposed results.

Key concepts: Multi-agent system, Correctness, Consensus, Upper and lower bounds, Algebraic graph theory, Algebraic Riccati equation, Algebraic connectivity, Spanning tree

Related papers

Back to paper searchBrowse research topicsOriginal source
Leader-following consensus for linear multi-agent systems with measurement noises — Research Paper | ScholarLens