This paper studies the prescribed-time bipartite consensus problem for multiple Euler-Lagrange systems (MELSs) under directed matrix-weighted signed graph, in which input-to-output redundancy, external disturbances and uncertain dynamic terms have been taken into consideration. Firstly, this paper proposes the prescribed-time hierarchical control (PTHC) algorithm to tackle the aforesaid issue. It is worth pointing out that the convergence time can be arbitrarily prescribed based on actual engineering needs. Then, the corresponding sufficient conditions for achieving the prescribed-time bipartite consensus are obtained by invoking Lyapunov stability analysis. Eventually, the numerical simulation results are performed, which vividly reflect the effectiveness and feasibility of the developed control algorithm.

Download full-text PDF

Source
http://dx.doi.org/10.1016/j.isatra.2023.09.031DOI Listing

Publication Analysis

Top Keywords

prescribed-time bipartite
12
bipartite consensus
12
multiple euler-lagrange
8
euler-lagrange systems
8
input-to-output redundancy
8
directed matrix-weighted
8
matrix-weighted signed
8
signed graph
8
hierarchical prescribed-time
4
consensus multiple
4

Similar Publications

This paper studies the prescribed-time bipartite consensus problem for multiple Euler-Lagrange systems (MELSs) under directed matrix-weighted signed graph, in which input-to-output redundancy, external disturbances and uncertain dynamic terms have been taken into consideration. Firstly, this paper proposes the prescribed-time hierarchical control (PTHC) algorithm to tackle the aforesaid issue. It is worth pointing out that the convergence time can be arbitrarily prescribed based on actual engineering needs.

View Article and Find Full Text PDF

This article studies event-triggered control for the prescribed-time bipartite consensus of first-order multiagent systems. For each agent, the new event-triggered control law and triggering condition are constructed without continuous interneighboring communication. Based on the Lyapunov stability theory and the algebraic graph theory, permissible value ranges of the designed parameters are established to guarantee that all agents reach bipartite consensus in a completely prespecified time.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!