Approximate Dynamic Programming for Constrained Linear Systems: A Piecewise Quadratic Approximation Approach

2022-05-20 · Kanghui He, Shengling Shi, Ton van den Boom, Bart De Schutter

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. 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 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.

📄 PDF Abstract BibTeX arXiv:2205.10065

Code (0)

등록된 구현이 없습니다.

Tasks

Model Predictive Control

Methods 이 논문이 사용한 방법론

SPEED The monocular depth estimation (MDE) is the task of estimating depth from a single frame. This information is an essential knowledge in many computer vision tasks such as scene…

Approximate Dynamic Programming For Linear Systems with State and Input Constraints

2019-06-26 · Ankush Chakrabarty, Rien Quirynen, Claus Danielson, Weinan Gao

Enforcing state and input constraints during reinforcement learning (RL) in continuous state spaces is an open but crucial problem which remains a roadblock to using RL in safety-critical applications. This paper leverag…

reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Approximate Dynamic Programming for Constrained Piecewise Affine Systems with Stability and Safety Guarantees

2023-06-27 · Kanghui He, Shengling Shi, Ton van den Boom, Bart De Schutter

Infinite-horizon optimal control of constrained piecewise affine (PWA) systems has been approximately addressed by hybrid model predictive control (MPC), which, however, has computational limitations, both in offline des…

Computational Efficiency CPU Model Predictive Control

Efficient Inference and Structured Learning for Semantic Role Labeling

2015-01-01 · TACL 2015 1 · Oscar T{\"a}ckstr{\"o}m, Kuzman Ganchev, Dipanjan Das

We present a dynamic programming algorithm for efficient constrained inference in semantic role labeling. The algorithm tractably captures a majority of the structural constraints examined by prior work in this area, whi…

Semantic Parsing Semantic Role Labeling

Adaptive dynamic programming for nonaffine nonlinear optimal control problem with state constraints

2019-11-26 · Jingliang Duan, Zhengyu Liu, Shengbo Eben Li, Qi Sun 외

This paper presents a constrained adaptive dynamic programming (CADP) algorithm to solve general nonlinear nonaffine optimal control problems with known dynamics. Unlike previous ADP algorithms, it can directly deal with…

Bounded Approximate Symbolic Dynamic Programming for Hybrid MDPs

2013-09-26 · Luis Gustavo Vianna, Scott Sanner, Leliane Nunes de Barros

Recent advances in symbolic dynamic programming (SDP) combined with the extended algebraic decision diagram (XADD) data structure have provided exact solutions for mixed discrete and continuous (hybrid) MDPs with piecewi…