Numerical Scheme for Viability Computation Using Randomized Technique with Linear Programming

Journal Article · Thu Jun 12 00:00:00 EDT 2008 · AIP Conference Proceedings

DOI:https://doi.org/10.1063/1.2953001· OSTI ID:21143563

Djeridane, Badis ^[1]

---

1. ETH-Zurich, Automatic Control Laboratory, 8092 Zurich (Switzerland)

We deal with the problem of computing viability sets for nonlinear continuous or hybrid systems. Our main objective is to beat the curse of dimensionality, that is, we want 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, use random extraction of points instead, and the computation of viable set test is formulated as a classical feasibility problem. This algorithm was implemented successfully to linear and nonlinear examples. We provide comparison of our results with results of other method.

• OSTI ID: 21143563
• Journal Information: AIP Conference Proceedings, Vol. 1019, Issue 1; Conference: CISA 08: 1. Mediterranean conference on intelligent systems and automation, Annaba (Algeria), 30 Jun - 2 Jul 2008; Other Information: DOI: 10.1063/1.2953001; (c) 2008 American Institute of Physics; Country of input: International Atomic Energy Agency (IAEA); ISSN 0094-243X
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
ALGORITHMS
COMPARATIVE EVALUATIONS
FUZZY LOGIC
HYBRID SYSTEMS
LINEAR PROGRAMMING
NEURAL NETWORKS
NONLINEAR PROBLEMS
RANDOMNESS
SPACE