Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.


An Efficient Branch and Bound Algorithm for State Estimation and Control of Hybrid Systems


D. Mignone

European Control Conference (ECC), Karlsruhe, Germany

This paper presents a new Branch and Bound tree exploring strategy for solving Mixed Integer Quadratic Programs (MIQP) involving time evolutions of linear hybrid systems. In particular, we refer to the Mixed Logic Dynamical (MLD) models introduced by Bemporad and Morari, where the hybrid system is described by linear equations/inequalities involving continuous and integer variables. For the optimizations required by the controller synthesis and state estimation of MLD systems, the proposed algorithm reduces the average number of node explorations during the search of a global minimum. It also provides good local minima after a short number of steps of the Branch and Bound procedure.


Type of Publication:


File Download:

Request a copy of this publication.
(Uses JavaScript)
% No recipe for automatically generating a BibTex entry for (06)Talk
Permanent link