Abstract
The leaderless consensus problem of multi-agent systems with nonlinear dynamics and directed switching communication graphs is considered in this paper. The assumption in previous work that each possible communication graph contains a directed spanning tree is relaxed in this paper. Based on the directed spanning tree, we propose an error system which well transforms the consensus problem into the stabilization problem. By using matrix analysis theory and stability analysis of the nonlinear systems, a new kind of multiple Lyapunov function which depends on the communication graphs, is designed for analyzing the consensus behavior of the system. It is theoretically shown that the consensus can be achieved if the coupling gain is carefully chosen and other threshold conditions based on the communication graphs are satisfied. Finally, an example is presented to illustrate the theoretical analysis.
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.
