Reference
K. He, S. Shi, T. van den Boom, and B. De Schutter, "Approximate dynamic
programming for constrained linear systems: A piecewise quadratic approximation
approach,"
Automatica, vol. 160, p. 111456, Feb. 2024.
Abstract
Approximate dynamic programming (ADP) faces challenges in dealing with
constraints in control problems. Model predictive control (MPC) is, in
comparison, well-known for its accommodation of constraints and stability
guarantees, although its computation is sometimes prohibitive. This paper
introduces an approach combining the two methodologies to overcome their
individual limitations. The predictive control law for constrained linear
quadratic regulation (CLQR) problems has been proven to be piecewise affine
(PWA) while the value function is piecewise quadratic. We exploit these formal
results from MPC to design an ADP method for CLQR problems with a known model.
A novel convex and piecewise quadratic neural network with a local-global
architecture is proposed to provide an accurate approximation of the value
function, which is used as the cost-to-go function in the online dynamic
programming problem. An efficient decomposition algorithm is developed to
generate the control policy and speed up the online computation. Rigorous
stability analysis of the closed-loop system is conducted for the proposed
control scheme under the condition that a good approximation of the value
function is achieved. Comparative simulations are carried out to demonstrate
the potential of the proposed method in terms of online computation and
optimality.
Publisher page
Downloads
BibTeX
@article{HeShi:24-002,
author = {He, Kanghui and Shi, Shengling and van den Boom, Ton and De
Schutter, Bart},
title = {Approximate Dynamic Programming for Constrained Linear Systems:
{A} Piecewise Quadratic Approximation Approach},
journal = {Automatica},
volume = {160},
pages = {111456},
month = feb,
year = {2024}
}