.png){kind=icon}
Return
A New Zero-Order Algorithm to Solve the Maximum Hands-Off Control
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2023.3343350.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new zero-order algorithm to solve the maximum hands-off control is proposed. Maximum hands-off control is discretized into a convex linear programming problem by zero-order-hold discretization. The first-order necessary conditions for linear programming problems are presented. To ensure that the switching points meet the allowable error, the jump function is used to preliminarily determine the switching points of the control variable. The finite switch number lemma for the maximum hands-off control is used as the initial estimate of the number of switching points. Numerical example results show that the zero-order algorithm is more effective than the alternating direction method of multipliers in solving the maximum hands-off control.
Keywords:
Optimal control
Switches
Linear programming
Process control
Convex functions
Technological innovation
Sun
Bang-off-bang control
convex optimization
hands-off control
optimal control
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more