Near-optimal control with adaptive receding horizon for discrete-time piecewise affine systems

Conference Paper (2017)
Author(s)

J. Xu (TU Delft - Team Bart De Schutter)

Lucían Busoniu (Technical University of Cluj-Napoca)

BHK Schutter (TU Delft - Team Bart De Schutter)

Research Group
Team Bart De Schutter
Copyright
© 2017 J. Xu, Lucian Buşoniu, B.H.K. De Schutter
DOI related publication
https://doi.org/10.1016/j.ifacol.2017.08.806
More Info
expand_more
Publication Year
2017
Language
English
Copyright
© 2017 J. Xu, Lucian Buşoniu, B.H.K. De Schutter
Research Group
Team Bart De Schutter
Volume number
50-1
Pages (from-to)
4168-4173
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

We consider the infinite-horizon optimal control of discrete-time, Lipschitz continuous piecewise affine systems with a single input. Stage costs are discounted, bounded, and use a 1 or ∞-norm. Rather than using the usual fixed-horizon approach from model-predictive control, we tailor an adaptive-horizon method called optimistic planning for continuous actions (OPC) to solve the piecewise affine control problem in receding horizon. The main advantage is the ability to solve problems requiring arbitrarily long horizons. Furthermore, we introduce a novel extension that provides guarantees on the closed-loop performance, by reusing data (“learning”) across different steps. This extension is general and works for a large class of nonlinear dynamics. In experiments with piecewise affine systems, OPC improves performance compared to a fixed-horizon approach, while the data-reuse approach yields further improvements.

Files

License info not available