Distributed Prescribed-Time Interval Bipartite Consensus of Multi-Agent Systems on Directed Graphs: Theory and Experiment

This work deals with the analysis and protocol design problems of the prescribed-time interval bipartite consensus of multi-agent systems on signed and directed graphs. A new distributed protocol with hybrid constant and time-varying feedbacks of local signed error is proposed, whose consensus time period is independent of the specific topology among agents and initial states of all agents. By introducing a series of well-structured Lyapunov functions, the technical difficulties arising from the asymmetrical Laplacian matrices of directed graphs are circumvented. The effectiveness of this prescribed-time protocol for multi-agent systems on signed digraphs with a spanning tree is proven both on structurally balanced digraphs and structurally unbalanced ones with a positive root subgraph. An illustrative simulation example and a prescribed-time bipartite formation experiment on a swarm of nano-quadcopters are implemented to show the validity and practicability of these proposed protocols.

Automated summary

This work focuses on the analysis and protocol design problems of the prescribed-time interval bipartite consensus of multi-agent systems on signed and directed graphs, proposing a new distributed protocol. By introducing a series of well-structured Lyapunov functions, the technical difficulties arising from the asymmetrical Laplacian matrices of directed graphs are circumvented.