This paper studies the consensus of multi-agent systems with binary-valued communication. We consider a group of agents on an undirected graph with a fixed topology, but differing from most existing work, the information each agent gets from its neighbors are binary-valued measurements. A two-time-scale protocol which alternates estimation and control is constructed: Each agent in the system estimates the states of its neighbors' based on the binary-valued measurements for a short time, during which every agent's state will keep constant; Based on the estimations of its neighbors' states and its own state, each agent designs its own control, by which the state will be updated and then repeats the process of estimation alternating with control. For the state estimation, We propose an identification algorithm without truncation, which is analyzed to be convergent and the convergence rate is given. By the two-time-scale protocol, the system is shown to achieve weak consensus and mean square consensus by using a stochastic Lyapunov analysis and the consensus speed is given. Simulations are given, which are consistent with the theoretical results.
19 September 2019 in IEEE Transactions on Automatic Control
This paper studies consensus problems of multi-agent systems with binary-valued communications. Different from most existing works, the agents considered in this paper can only get binary-valued observations of its neighbors' states with random noises. A consensus algorithm is proposed: firstly, each agent estimates its neighbors' states by the recursive projection algorithm; then, each agent designs the control timely based on the estimates. It is proved that the estimates of the states can converge to the true states with a faster convergence rate than that in the parameter estimation. Moreover, the states of the agents can achieve mean square consensus and the corresponding consensus speed can achieve $O(1/t)$ under certain conditions. Finally, simulations are given to demonstrate the theoretical results.
12 November 2019 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
This paper is concerned with the average consensus problem of multi-agent systems with binary-valued communications under directed topologies. The information that each agent communicates with others is binary-valued with a fixed threshold and the control is a quantity of transportation from one agent to another, which causes that a decrease of the transmitter’s state leads to an increase of the same amount of the receiver’s. Due to the limitation of the information obtained, each agent needs to wait for a period of time to collect enough binary-valued information to estimate. Hence, we construct a two-scale control algorithm. At the small-time scale, each agent estimates its neighbors’ states based on the accumulation of binary-valued information for a period of time, during which the control is zero. At the large-time scale, each agent designs the control signal based on the estimation, which results in state updating of the multi-agent system. Then, each agent estimates the new states of its neighbors and the process of alternating estimation and control will be repeated. Finally, we prove that the estimation is convergent and give the mean square convergence rate as the reciprocal of the estimation time. More importantly, the multi-agent system is proved to achieve average consensus and the consensus speed is given. Simulation results are given to validate the algorithm.
26 December 2023 in IEEE Transactions on Automatic Control
This paper adopts the event-triggered control strategy to investigate the consensus problem of multi-agent systems. Owing to the effect of random noises, the communication information among agents is transmitted based on binary-valued measurements. Each agent employs the recursive projection algorithm to estimate the states of all neighbours. Then, an event-triggered protocol with time-varying threshold parameters is proposed to guarantee that the state of each agent can lie within the same bounded region as the estimate of its neighbours' states. Furthermore, this paper emphasizes that this kind of same bounded relation is necessary and essential to achieve precise state estimate and desired consensus performance. By the designed control law, the estimation error and the consensus error can converge to zero in the mean square sense with explicit convergence rates $O(t^{-a})$$(a>0$ is a constant). Finally, this paper shows that the communication rate of the designed control scheme can almost surely converge to zero with a rate $o(t^{-\kappa })$$(\kappa >0$ is a constant), and is much lower than the existing results when achieving the same convergence value. Thus, the communication resources can be saved. An example is presented to illustrate the advantage of the proposed control strategy.