Multi-agent Consensus by Binary-valued Communications of Relative State
暂无分享,去创建一个
This paper studies an average consensus problem for multi-agent systems (MAS) with binary-valued communications of relative state between neighbors. A two-scale algorithm consisting of “estimation” stage and “control” stage is proposed for discrete-time MAS over directed graph. In the “estimation” stage, the relative states between agents and neighbors are estimated with and without considering measurement noise. In “control” stage, a distributed control protocol is designed based on the estimations of relative states to achieve average consensus. Convergence and convergence speed of the algorithm are analyzed theoretically under mild conditions. Finally, a numerical simulation is given to validate the developed results of this paper.
[1] J.H. Manton,et al. Stochastic consensus seeking with measurement noise: Convergence and asymptotic normality , 2008, 2008 American Control Conference.
[2] Richard M. Murray,et al. Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.