.png){kind=icon}
.png){kind=icon}
Return
A dynamic programming approach to solving constrained linear-quadratic optimal control problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2020.109132.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The solution of a constrained linear-quadratic regulator problem is determined by the set of its optimal active sets. We propose an algorithm that constructs this set of active sets for a desired horizon N from that for horizon N - 1. While it is not obvious how to extend the optimal feedback law itself for horizon N - 1 to horizon N, a simple relation between the optimal active sets for two successive horizon lengths has recently been established. Essentially, we show how to use this recent result to improve the efficiency of existing active set enumeration algorithms. (C) 2020 The Authors. Published by Elsevier Ltd.
Keywords:
Constrained LQR
Predictive control
Implicit enumeration
Combinatorial quadratic programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.