.png){kind=icon}
.png){kind=icon}
Return
An improved slope-based adaptive control vector parameterization method for dynamic programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.aej.2023.11.018.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Control vector parameterization method is the most commonly used numerical computation method in solving dynamic programming problems. However, to balance the expected trajectory and the computational cost, this method faces difficulties in dividing the optimal discretization time grid. In this paper, we propose an effective control approach for non-uniform adaptive grid division. By analyzing the slope change trend of the control parameter, time nodes are adaptively refined by merging time grids with gentle slopes to remove unnecessary time nodes and adding time nodes to time grids with steep slopes to improve function approximation accuracy. Eventually, we obtain an adaptive time grid division method under which the trajectory of discretization control parameter is more approximate to the optimal control trajectory. Under the condition of intuitive slope information, the proposed method can achieve better performance with fewer optimization parameters and shorter computation time. Finally, the proposed method is applied to solve a classic optimal control problem and the obtained results are compared with the traditional control vector parameterization method. By comparison through the example, our proposed method can overcome the contradiction between approximation accuracy and computational cost in control vector parameterization method and improve the optimization efficiency.
Keywords:
Dynamic programming
Control vector parameterization
Adaptive grid division
Slope analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.