5 years ago

Consensus of nonlinear multi-agent systems with directed switching graphs: A directed spanning tree based error system approach

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.

Publisher URL: www.sciencedirect.com/science

DOI: S1751570X17301061

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.