Nonlinear placement for networked Euler‐Lagrange systems: A finite‐time hierarchical approach

The finite‐time nonlinear placement problem of networked Euler‐Lagrange systems (NELSs) is discussed in this paper. The problem is reformulated into a finite‐time aggregate game under an undirected graph. Then, several novel practical gradient‐based finite‐time hierarchical (GFTH) algorithms compose...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of robust and nonlinear control 2023-03, Vol.33 (5), p.3129-3145
Hauptverfasser:	Liu, Wen‐Jin, Ding, Hua‐Feng, Yao, Xiang‐Yu, Ge, Ming‐Feng, Hua, Menghu
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms finite‐time control Games Liapunov functions nash equilibrium seeking networked Euler‐Lagrange systems nonlinear placement Placement Tracking problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!