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.


Viable set computation for hybrid systems


K. Margellos, J. Lygeros

Nonlinear Analysis: Hybrid Systems, vol. 10, pp. 45-62

In this paper, we revisit the problem of computing viability sets for hybrid systems with nonlinear continuous dynamics and competing inputs. As usual in the literature, an iterative algorithm, based on the alternating application of a continuous and a discrete operator, is employed. Dif ferent cases, depending on whether the continuous evolution and the number of discrete transitions are nite or in nite, are considered. A complete characterization of the reach-avoid computation (involved in the continuous time calculation) is provided based on dynamic programming. Moreover, for a certain class of automata, we show convergence of the iterative process by using a constructive version of Tarski's fixed point theorem, to determine the maximal fi xed point of a monotone operator on a complete lattice of closed sets. The viability algorithm is applied to a benchmark example and to the problem of voltage stability for a single machine-load system in case of a line fault.


Type of Publication:


File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@Article { MarLyg:2013:IFA_4424,
    author={K. Margellos and J. Lygeros},
    title={{Viable set computation for hybrid systems}},
    journal={Nonlinear Analysis: Hybrid Systems},
Permanent link