On the computation and bounding of invariant sets - CentraleSupélec Access content directly
Conference Papers Year : 2007

On the computation and bounding of invariant sets

Sorin Olaru

Abstract

This contribution deals with the computational issues encountered in the construction of invariant sets, the presented results being useful in the more general framework of piecewise linear systems. The main contribution of the present paper is the efficient computation of upper and lower bounds of the maximal positive invariant (MPI) sets. These turn to be meaningful approximations when iterative construction procedures are employed, especially if no finitetime algorithms exists to construct the exact MPI set. In order to decrease the computational complexity, interval search procedures are used to avoid the treatment of the regions which do not meet the neighboring properties.
No file

Dates and versions

hal-00221449 , version 1 (28-01-2008)

Identifiers

Cite

Hichem Benlaoukli, Sorin Olaru. On the computation and bounding of invariant sets. ICCAS'07, Oct 2007, Seoul, South Korea. pp.293-298, ⟨10.1109/ICCAS.2007.4406925⟩. ⟨hal-00221449⟩
150 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More