Abstract
This study is concerned with consensus problems of a class of high-order multi-agent systems with dynamically changing topologies and time-delays. A nearest-neighbour rule is introduced for these high-order discrete-time agents with the consideration of communication time-delays. It is shown that consensus can be reached, even when the communication topologies are dynamically changing and the corresponding communication graphs have no spanning trees. It is also shown that the communication time-delays do not affect the stability of the multi-agent systems. Finally, a numerical example is included to illustrate the obtained 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.
