.png){kind=icon}
Return
Nonconvex Optimization Problems for Maximum Hands-Off Control
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2024.3474061.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Maximum hands-off control is the optimal solution to the L(0 )optimal control problem. While convex approximation is typically used to relax this problem, it does not necessarily result in maximum hands-off control. Therefore, this study introduces a nonconvex approximation method and a class of nonconvex optimal control problems that are always equivalent to the maximum hands-off control problem. A computation method based on difference of convex functions optimization is then derived and numerically validated.
Keywords:
Optimal control
Optimization
Vectors
Cost function
Approximation methods
Convex functions
Sparse approximation
State estimation
Standards
Optimization methods
Difference of convex functions
nonconvex approximation
optimal control
sparse control
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveHomogeneous catalytic reduction of nitric oxide by olefins in the presence of palladium(II) chloride
PREAI
ShareSaveShareSave
View more