Abstract
This study addresses the global consensus problems of a class of non-linear multi-agent systems with Lipschitz non-linearity and directed communication graphs, by using a distributed consensus protocol based on the relative states of neighbouring agents. A two-step algorithm is presented to construct a protocol, under which a Lipschitz multi-agent system without disturbances can reach global consensus for a strongly connected directed communication graph. Another algorithm is then given to design a protocol that can achieve global consensus with a guaranteed H∞ performance for a Lipschitz multi-agent system subject to external disturbances. The case with a leader–follower communication graph is also discussed. Finally, the effectiveness of the theoretical results is demonstrated through a network of single-link manipulators.
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.
