CUED Publications database

Efficient upper and lower bounds for global mixed-integer optimal control

Sager, S and Claeys, M and Claeys, M and Messine, F (2014) Efficient upper and lower bounds for global mixed-integer optimal control. Journal of Global Optimization. ISSN 0925-5001

Full text not available from this repository.


We present a control problem for an electrical vehicle. Its motor can be operated in two discrete modes, leading either to acceleration and energy consumption, or to a recharging of the battery. Mathematically, this leads to a mixed-integer optimal control problem (MIOCP) with a discrete feasible set for the controls taking into account the electrical and mechanical dynamic equations. The combination of nonlinear dynamics and discrete decisions poses a challenge to established optimization and control methods, especially if global optimality is an issue. Probably for the first time, we present a complete analysis of the optimal solution of such a MIOCP: solution of the integer-relaxed problem both with a direct and an indirect approach, determination of integer controls by means of the sum up rounding strategy, and calculation of global lower bounds by means of the method of moments. As we decrease the control discretization grid and increase the relaxation order, the obtained series of upper and lower bounds converge for the electrical car problem, proving the asymptotic global optimality of the calculated chattering behavior. We stress that these bounds hold for the optimal control problem in function space, and not on an a priori given (typically coarse) control discretization grid, as in other approaches from the literature. This approach is generic and is an alternative to global optimal control based on probabilistic or branch-and-bound based techniques. The main advantage is a drastic reduction of computational time. The disadvantage is that only local solutions and certified lower bounds are provided with no possibility to reduce these gaps. For the instances of the electrical car problem, though, these gaps are very small. The main contribution of the paper is a survey and new combination of state-of-the-art methods for global mixed-integer optimal control and the in-depth analysis of an important, prototypical control problem. Despite the comparatively low dimension of the problem, the optimal solution structure of the relaxed problem exhibits a series of bang-bang, path-constrained, and sensitivity-seeking arcs. © 2014 Springer Science+Business Media New York.

Item Type: Article
Divisions: Div F > Control
Depositing User: Cron Job
Date Deposited: 17 Jul 2017 20:36
Last Modified: 27 Jul 2017 05:38