.png){kind=icon}
.png){kind=icon}
Return
A dynamic programming-inspired approach for Mixed Integer Optimal Control Problems with dwell time constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jprocont.2025.103522.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• The CIA decomposition provides efficient solutions for MIOCPs. • A Dynamic Programming-Inspired method (DP) solves the second step in the CIA decomposition. • Dwell time constraints are efficiently handled within DP. • The flexible framework of DP adapts to various value functions.
Keywords:
CIA decomposition
MIOCPs
Dynamic Programming
dwell time constraints
value functions
Journal
IF:
3.9
Papers:
3.4K
Citations:
7.3K