Abstract

This paper investigates average consensus problem in networks of continuous-time agents with delayed information and jointly-connected topologies. A sufficient condition in terms of linear matrix inequalities (LMIs) is given under which all agents asymptotically reach average consensus, where the communication structures vary over time and the corresponding graphs may not be connected. Finally, simulation results are provided to demonstrate the effectiveness of our 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 call

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.