Abstract
Abstract This paper presents a proportional-derivative protocol for the consensus problem of a class of linear second-order multi-agent systems with local information transmission. The communication topology among the agents is switching and agents receive information within a critical bounded distance. As new observations, we show that the desired protocol system undergoes consensus and swarming behaviours when 1 is a simple eigenvalue of the adjacency matrix. In this case, both final velocity and final relative position are formulated. Simulation results show the effectiveness of the proposed protocol.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
