%0 Book Section
%A Bemporad, Alberto
%A Giorgetti, Nicolò
%B Hybrid Systems: Computation and Control
%D 2004
%E Alur  , Rajeev 
%E Pappas, George J. 
%F eprints:502
%I Springer-Verlag
%P 126-141
%S Lecture Notes in Computer Science
%T A SAT-based hybrid solver for optimal control of hybrid systems
%U http://eprints.imtlucca.it/502/
%V 2993
%X Combinatorial optimization over continuous and integer variables was proposed recently as a useful tool for solving complex optimal control problems for linear hybrid dynamical systems formulated in discrete-time. Current approaches are based on mixed-integer linear or quadratic programming (MIP), which provides the solution after solving a sequence of relaxed standard linear (or quadratic) programs (LP, QP). An MIP formulation has the drawback of requiring conversion of the discrete/logic part of the hybrid problem into mixed-integer inequalities. Although this operation can be done automatically, most of the original discrete structure of the problem is lost during the conversion. Moreover, the efficiency of the MIP solver mainly relies upon the tightness of the continuous LP/QP relaxations. In this paper we attempt to overcome such difficulties by combining MIP and techniques for solving constraint satisfaction problems into a “hybrid” solver, taking advantage of SAT solvers for dealing efficiently with satisfiability of logic constraints. We detail how to model the hybrid dynamics so that the optimal control problem can be solved by the hybrid MIP+SAT solver, and show that the achieved performance is superior to the one achieved by commercial MIP solvers.