Abstract
This paper addresses asynchronous consensus problems of multiple double-integrator agents with discontinuous information transmission, where each agent receives its neighbors' state information at discrete instants determined by its own clock. A novel consensus protocol is proposed based on continuous information of each agent itself and sampled information of each agent's neighbors. By using nonnegative matrix theory and graph theory, we prove that the consensus problem is solvable in the asynchronous sampled-data setting without or with time-varying communication delays, if the union of the effective communication topology across any time interval with some given length contains a spanning tree. Remarkably, the sampling intervals and communication delays are allowed to be arbitrarily large yet bounded. By proposing a modified protocol based on the idea of pinning control, we extend the existing result to the desired consensus problem. Numerical examples are finally provided to validate the theoretical results.
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 callMore From: IEEE Transactions on Circuits and Systems I: Regular Papers
Disclaimer: 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.
