Abstract
This paper considers the distributed consensus problems for multi-agent systems with general linear and Lipschitz nonlinear dynamics. Distributed relative-state consensus protocols with an adaptive law for adjusting the coupling weights between neighboring agents are designed for both the linear and nonlinear cases, under which consensus is reached for all undirected connected communication graphs. Extensions to the case with a leader-follower communication graph are further studied. In contrast to the existing results in the literature, the adaptive consensus protocols here can be implemented by each agent in a fully distributed fashion without using any global information.
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.
