摘要
This paper investigates the stochastic bounded consensus of leader-following second-order multi-agent systems in a noisy environment. It is assumed that each agent received the information of its neighbors corrupted by noises and time delays. Based on the graph theory, stochastic tools, and the Lyapunov function method, we derive the sufficient conditions under which the systems would reach stochastic bounded consensus in mean square with the protocol we designed. Finally, a numerical simulation is illustrated to check the effectiveness of the proposed algorithms.
This paper investigates the stochastic bounded consensus of leader-following second-order multi-agent systems in a noisy environment. It is assumed that each agent received the information of its neighbors corrupted by noises and time delays. Based on the graph theory, stochastic tools, and the Lyapunov function method, we derive the sufficient conditions under which the systems would reach stochastic bounded consensus in mean square with the protocol we designed. Finally, a numerical simulation is illustrated to check the effectiveness of the proposed algorithms.
基金
supported by the National Natural Science Foundation of China(Grant Nos.61573156,61273126,61503142,61272382,and 61573154)
the Fundamental Research Funds for the Central Universities(Grant No.x2zd D2153620)
作者简介
Corresponding author. E-mail： aufqdeng@scut.edu.cn
