LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Fixed-Time Bipartite Containment Control of High-Order Multi-Agent Systems in the Signed Graph

Photo from wikipedia

The fixed-time bipartite containment control for high-order multi-agent systems (MASs) with disturbances is discussed in directed signed graph. The proposed control algorithm guarantees that the trajectories of followers converge into… Click to show full abstract

The fixed-time bipartite containment control for high-order multi-agent systems (MASs) with disturbances is discussed in directed signed graph. The proposed control algorithm guarantees that the trajectories of followers converge into the time-varying geometric space spanned by trajectories of leaders and their opposite trajectories. The settling time is mathematically proved to be dependent only on parameters and independent on the system initial value. On the basis of norm inequality, stability theory and other mathematical analysis, the sufficient condition is given to reach the bipartite containment control. The correctness and efficiency of theoretical results are confirmed via the example.

Keywords: time; bipartite containment; control; containment control; fixed time

Journal Title: IEEE Transactions on Circuits and Systems II: Express Briefs
Year Published: 2023

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.