@incollection{eprints575,
       publisher = {IEEE},
         journal = {Proc. 39th IEEE Conf. on Decision and Control},
            note = {Proceedings of the 39th IEEE Conference on Decision and Control, Sydney, Australia, 12 - 15 dic 2000 },
          author = {Alberto Bemporad and L. Giovanardi and Fabio Danilo Torrisi},
       booktitle = {Decision and Control Conference},
          volume = {1},
           pages = {969--974},
           title = {Performance driven reachability analysis for optimal scheduling and control of hybrid systems},
            year = {2000},
        abstract = {We deal with the optimal control problem for piecewise linear and hybrid systems by using a computational approach based on performance-driven reachability analysis. The idea consists of coupling a reach-set exploration algorithm, essentially based on a repetitive use of linear programming, to a quadratic programming solver which selectively drives the exploration. In particular, an upper bound on the optimal cost is continually updated during the procedure, and used as a criterion to discern non-optimal evolutions and to prevent their exploration. The result is an efficient strategy of branch-and-bound nature, which is especially attractive for solving long-horizon hybrid optimal control and scheduling problems},
             url = {http://eprints.imtlucca.it/575/},
        keywords = {NP hard problem; branch-and-bound; hybrid systems; linear programming; optimal control; piecewise linear systems; quadratic programming; reachability analysis; scheduling; upper bound; computational complexity; linear programming; nonlinear systems; optimal control; quadratic programming; reachability analysis}
}