Abstract
This study involves an examination of the dynamic consensus problem for networks of double-integrator agents with aperiodic impulsive protocol and fixed topology. With respect to each agent, the control law is designed based on relative state measurements (i.e. position and velocity) between the agent and the neighbouring agents at a few discrete times. Additionally, these state measurements can include time-varying measurement delays. The theory of impulsive differential equations is used to prove that the dynamic consensus can be achieved under the condition of a graph with a spanning tree and to provide the consensus state finally reached by all agents. Furthermore, the study establishes algebraic inequalities that should be satisfied by the control gains, the bounds of impulsive interval lengths, and the upper bound of delays. Two numerical examples are illustrated to validate the main results.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
