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.

  

Randomized algorithm: A viability computation

Author(s):

B. Djeridane, E.Cruck, J. Lygeros
Conference/Journal:

IFAC World Congress, pp. 11548-11553, Seoul Korea
Abstract:

We deal with the problem of computing maximal viability sets for nonlinear continuous or hybrid systems. Our main objective is to beat the curse of dimensionality, that is, we wan to avoid the exponential growth of required computational resource with respect to the dimension of the system. We propose a randomized approach for viability computation: we avoid griding the state-space, and use random extraction of points instead. This algorithm was implemented successfully to linear and nonlinear examples. We provide comparison of our results with results of other method.

Year:

2008
Type of Publication:

(01)Article
Supervisor:



File Download:

Request a copy of this publication.
(Uses JavaScript)
% Autogenerated BibTeX entry
@InProceedings { DjeE_C:2008:IFA_3243,
    author={B. Djeridane and E.Cruck and J. Lygeros},
    title={{Randomized algorithm: A viability computation}},
    booktitle={IFAC World Congress},
    pages={11548--11553},
    year={2008},
    address={},
    month=jul,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=3243}
}
Permanent link