Abstract
In this paper, we study the group consensus for networked Euler-Lagrange systems under a general nonsymmetric directed graph. The relationships between the interactive agents in the same group are cooperation while the relationships between the interactive agents among different group can be either cooperation or competition. Two assumptions are presented to achieve group consensus, respectively, interaction topology among groups being acyclic and the associated directed graph satisfying the in-degree balance condition. We propose a distributed adaptive control algorithm for each agent without relative velocity information. Simulation results are provided to demonstrate the effectiveness of the proposed control algorithms.
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.
