2,203 research outputs found
Fast Non-Parametric Learning to Accelerate Mixed-Integer Programming for Online Hybrid Model Predictive Control
Today's fast linear algebra and numerical optimization tools have pushed the
frontier of model predictive control (MPC) forward, to the efficient control of
highly nonlinear and hybrid systems. The field of hybrid MPC has demonstrated
that exact optimal control law can be computed, e.g., by mixed-integer
programming (MIP) under piecewise-affine (PWA) system models. Despite the
elegant theory, online solving hybrid MPC is still out of reach for many
applications. We aim to speed up MIP by combining geometric insights from
hybrid MPC, a simple-yet-effective learning algorithm, and MIP warm start
techniques. Following a line of work in approximate explicit MPC, the proposed
learning-control algorithm, LNMS, gains computational advantage over MIP at
little cost and is straightforward for practitioners to implement
Model predictive control techniques for hybrid systems
This paper describes the main issues encountered when applying model predictive control to hybrid processes. Hybrid model predictive control (HMPC) is a research field non-fully developed with many open challenges. The paper describes some of the techniques proposed by the research community to overcome the main problems encountered. Issues related to the stability and the solution of the optimization problem are also discussed. The paper ends by describing the results of a benchmark exercise in which several HMPC schemes were applied to a solar air conditioning plant.Ministerio de Eduación y Ciencia DPI2007-66718-C04-01Ministerio de Eduación y Ciencia DPI2008-0581
Strong Stationarity Conditions for Optimal Control of Hybrid Systems
We present necessary and sufficient optimality conditions for finite time
optimal control problems for a class of hybrid systems described by linear
complementarity models. Although these optimal control problems are difficult
in general due to the presence of complementarity constraints, we provide a set
of structural assumptions ensuring that the tangent cone of the constraints
possesses geometric regularity properties. These imply that the classical
Karush-Kuhn-Tucker conditions of nonlinear programming theory are both
necessary and sufficient for local optimality, which is not the case for
general mathematical programs with complementarity constraints. We also present
sufficient conditions for global optimality.
We proceed to show that the dynamics of every continuous piecewise affine
system can be written as the optimizer of a mathematical program which results
in a linear complementarity model satisfying our structural assumptions. Hence,
our stationarity results apply to a large class of hybrid systems with
piecewise affine dynamics. We present simulation results showing the
substantial benefits possible from using a nonlinear programming approach to
the optimal control problem with complementarity constraints instead of a more
traditional mixed-integer formulation.Comment: 30 pages, 4 figure
From Uncertainty Data to Robust Policies for Temporal Logic Planning
We consider the problem of synthesizing robust disturbance feedback policies
for systems performing complex tasks. We formulate the tasks as linear temporal
logic specifications and encode them into an optimization framework via
mixed-integer constraints. Both the system dynamics and the specifications are
known but affected by uncertainty. The distribution of the uncertainty is
unknown, however realizations can be obtained. We introduce a data-driven
approach where the constraints are fulfilled for a set of realizations and
provide probabilistic generalization guarantees as a function of the number of
considered realizations. We use separate chance constraints for the
satisfaction of the specification and operational constraints. This allows us
to quantify their violation probabilities independently. We compute disturbance
feedback policies as solutions of mixed-integer linear or quadratic
optimization problems. By using feedback we can exploit information of past
realizations and provide feasibility for a wider range of situations compared
to static input sequences. We demonstrate the proposed method on two robust
motion-planning case studies for autonomous driving
- …