The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Approximating Explicit Model Predictive Control Using Constrained Neural Networks
Abstract
This paper presents a method to compute an approximate explicit model predictive control (MPC) law using neural networks. The optimal MPC control law for constrained linear quadratic regulator (LQR) systems is piecewise affine on polytopes. However, computing this optimal control law becomes computationally intractable for large problems, and motivates the application of reinforcement learning techniques using neural networks with rectified linear units. We introduce a modified reinforcement learning policy gradient algorithm that utilizes knowledge of the system model to efficiently train the neural network. We guarantee that the network generates feasible control inputs by projecting onto polytope regions derived from the maximal control invariant set of the system. Finally, we present numerical examples that demonstrate the characteristics and performance of our algorithm.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
Asynchronous Methods for Deep Reinforcement Learning
Mnih, V., Badia, A. P., Mirza, M., Graves, A., Lillicrap, T. P., Harley, T., Silver, D., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1602.01783 · Cited by 7,132
Bengio, Y., Louradour, J., Collobert, R., & Weston, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553380 · Cited by 5,366 · cited 2×
“Applying a continuation method involves tracking the minimizing solution of increasingly non-smooth cost functions as η goes from 0 to N , and has been empirically shown to yield better solutions, especially in optimizing DNNs [48].”
On the Number of Linear Regions of Deep Neural Networks
Montúfar, G., Pascanu, R., Cho, K., & Bengio, Y. (2014) · arXiv · doi:10.48550/arxiv.1402.1869 · Cited by 840
Neural network with unbounded activation functions is universal approximator
Sonoda, S., & Murata, N. (2017) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2015.12.005 · Cited by 303 · cited 1×
“DNN ReLU are universal approximators [33], [36], and in current deep learning practice, ReLU activations have become the de-facto standard activation function [36].”
On the number of response regions of deep feed forward networks with piece-wise linear activations
Pascanu, R., Montufar, G., & Bengio, Y. (2013) · arXiv · doi:10.48550/arxiv.1312.6098 · Cited by 153
Cited by
Efficient Representation and Approximation of Model Predictive Control Laws via Deep Learning
Karg, B., & Lucia, S. (2020) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2999556 · Cited by 306
Aliramezani, M., Koch, C. R., & Shahbakhti, M. (2022) · Progress in Energy and Combustion Science · doi:10.1016/j.pecs.2021.100967 · Cited by 288
Metadata
- Authors
- Chen, S., Saulnier, K., Atanasov, N., Lee, D. D., Kumar, V., Pappas, G. J., & Morari, M.
- Venue
- 2018 Annual American Control Conference (ACC)
- Publisher
- IEEE
- Published
- 2018-06
- Pages
- 1520-1527
- ISSN
- 0743-1619 (ISSN-L)
- OpenAlex
- W2887532679
- Cited by
- 209
- References
- 6
- FWCI
- 30.68
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.