Representation of chance-constraints with strong asymptotic guarantees - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Access content directly
Journal Articles IEEE Control Systems Letters Year : 2017

Representation of chance-constraints with strong asymptotic guarantees

Abstract

Given e ∈ (0, 1), a probability measure µ on Ω ⊂ Rp and a semi-algebraic set K ⊂ X × Ω, we consider the feasible set X(e) = {x ∈ X : Prob[(x, ω) ∈ K] ≥ 1 − e } associated with a chance-constraint. We provide a sequence outer approximations X_d(e) = {x ∈ X : h_d (x) ≥ 0}, d ∈ N, where h_d is a polynomial of degree d whose vector of coefficients is an optimal solution of a semidefinite program. The size of the latter increases with the degree d. We also obtain the strong and highly desirable asymptotic guarantee that λ(X_d(e) \X (e)) → 0 as d increases, where λ is the Lebesgue measure on X. Finallu inner approximations with same asymptotic guaranties are also obtained by considering the complement.
Fichier principal
Vignette du fichier
chance-ieee-final.pdf (180.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01487006 , version 1 (10-03-2017)
hal-01487006 , version 2 (11-05-2017)

Identifiers

Cite

Jean-Bernard Lasserre. Representation of chance-constraints with strong asymptotic guarantees. IEEE Control Systems Letters, 2017, 1 (1), pp.50--55. ⟨10.1109/LCSYS.2017.2704295⟩. ⟨hal-01487006v2⟩
430 View
261 Download

Altmetric

Share

Gmail Facebook X LinkedIn More