eprintid: 525
rev_number: 8
eprint_status: archive
userid: 7
dir: disk0/00/00/05/25
datestamp: 2011-07-27 08:53:56
lastmod: 2011-08-04 07:29:08
status_changed: 2011-07-27 08:53:56
type: book_section
metadata_visibility: show
contact_email: alberto.bemporad@imtlucca.it
item_issues_count: 0
creators_name: Bemporad, Alberto
creators_name: Giorgetti, Nicolò
creators_id: alberto.bemporad@imtlucca.it
creators_id: 
title: SAT-based branch & bound and optimal control of hybrid dynamical systems
ispublished: pub
subjects: QA
subjects: QA75
divisions: CSA
full_text_status: none
abstract: A classical hybrid MIP-CSP approach for solving problems having a logical part and a mixed integer programming part is presented. A Branch and Bound procedure combines an MIP and a SAT solver to determine the optimal solution of a general class of optimization problems. The procedure explores the search tree, by solving at each node a linear relaxation and a satisfiability problem, until all integer variables of the linear relaxation are set to an integer value in the optimal solution. When all integer variables are fixed the procedure switches to the SAT solver which tries to extend the solution taking into account logical constraints. If this is impossible, a ldquono-goodrdquo cut is generated and added to the linear relaxation. We show that the class of problems we consider turns out to be very useful for solving complex optimal control problems for linear hybrid dynamical systems formulated in discrete-time. We describe how to model the ldquohybridrdquo 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.
date: 2004
date_type: published
series: Lecture Notes in Computer Science
publication: Int. Conf. on Integration of AI and OR Techniques
volume: 3011
publisher: Springer-Verlag
pagerange: 96-111
id_number: 10.1007/978-3-540-24664-0_7
refereed: TRUE
isbn: 978-3-540-21836-4
book_title: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
editors_name: Régin, Jean-Charles 
editors_name: Rueher, Michel 
official_url: http://www.springerlink.com/content/xawwmfk1pk04wr98/
citation:   Bemporad, Alberto and Giorgetti, Nicolò  SAT-based branch & bound and optimal control of hybrid dynamical systems.   In:  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems.   Lecture Notes in Computer Science, 3011 .  Springer-Verlag, pp. 96-111.  ISBN 978-3-540-21836-4      (2004)