Distributed Consensus of Multi-agent Systems with Switching Unconsensusable Topologies

摘要

Our work deals with the distributed consensus issue of multi-agent systems under undirected time-varying topology. More precisely, all sub-topologies are unconsensusable, which means that all the graph connectivity can not be guaranteed during the consensus procedure. By employing the average dwell time approach, sufficient sum of squares programming criterion is established based on time-dependent multiple Lyapunov function. In the end, illustrative simulations are studied to verify the usefulness and adaptability for our developed approaches.