Sliding-mode-based robust predefined-time optimization for single-integrator systems

In this article, a novel class of fully distributed practical predefined-time algorithms (FDPPTAs) is developed for three types of convex optimization problems of single-integrator systems with bounded disturbances. The task of this work is to reach an optimal state that minimizes the global cost fu...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Nonlinear dynamics Ročník 112; číslo 23; s. 21241 - 21255
Hlavní autori: Chen, Siyu, Jiang, Haijun, Yu, Zhiyong, Zhao, Fengyang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Dordrecht Springer Netherlands 01.12.2024
Springer Nature B.V
Predmet:
Algorithms
Automotive Engineering
Classical Mechanics
Constraints
Control
Convexity
Cost function
Dynamical Systems
Engineering
Integrators
Linear functions
Mechanical Engineering
Optimization
Original Paper
Penalty function
Robustness (mathematics)
Sliding mode control
Vibration
Bounded disturbances
Integral sliding mode control
Fully distributed practical predefined-time algorithm
Optimization
Initialization-free
ISSN:0924-090X, 1573-269X
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this article, a novel class of fully distributed practical predefined-time algorithms (FDPPTAs) is developed for three types of convex optimization problems of single-integrator systems with bounded disturbances. The task of this work is to reach an optimal state that minimizes the global cost function expressed by the sum of all convex local cost functions. Firstly, a two-stage robust FDPPTA, combined with two time-varying functions, zero-gradient-sum and integral sliding mode control, is constructed to solve the unconstrained optimization problem. Secondly, a two-stage robust FDPPTA is applied to the case with linear equality constraint by introducing auxiliary variables. On this basis, the exact penalty function is further introduced to deal with the difficulties caused by linear inequality constraint. Unlike the existing optimization algorithms, the developed FDPPTA, which does not rely on any global information, shows excellent performance from the three aspects of robustness, initialization-free and predefined-time. Finally, four cases are given to verify the effectiveness and superiority of proposed algorithms.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0924-090X
1573-269X
DOI:10.1007/s11071-024-10118-8