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.


Performance Driven Reachability Analysis for Optimal Scheduling and Control of Hybrid Systems


A. Bemporad, L. Giovanardi, F.D. Torrisi

IEEE Conference on Decision and Control, Sydney, Australia, no. 39, pp. 969-974

In this paper we tackle 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 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

Further Information

Type of Publication:


File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { BemGio:2000:IFA_289,
    author={A. Bemporad and L. Giovanardi and F.D. Torrisi},
    title={{Performance Driven Reachability Analysis for Optimal
	  Scheduling and Control of Hybrid Systems}},
    booktitle={IEEE Conference on Decision and Control},
    address={Sydney, Australia},
Permanent link