Representation of Chance-Constraints With Strong Asymptotic Guarantees
نویسندگان
چکیده
منابع مشابه
Optimal Control with Fuzzy Chance Constraints
In this paper, a model of an optimal control problem with chance constraints is introduced. The parametersof the constraints are fuzzy, random or fuzzy random variables. Todefuzzify the constraints, we consider possibility levels. Bychance-constrained programming the chance constraints are converted to crisp constraints which are neither fuzzy nor stochastic and then the resulting classical op...
متن کاملoptimal control with fuzzy chance constraints
in this paper, a model of an optimal control problem with chance constraints is introduced. the parametersof the constraints are fuzzy, random or fuzzy random variables. todefuzzify the constraints, we consider possibility levels. bychance-constrained programming the chance constraints are converted to crisp constraints which are neither fuzzy nor stochastic and then the resulting classical op...
متن کاملScenario Approximations of Chance Constraints
We consider an optimization problem of minimization of a linear function subject to the chance constraint Prob{G(x, ξ) ∈ C} ≥ 1 − ε, where C is a convex set, G(x, ξ) is bi-affine mapping and ξ is a vector of random perturbations with known distribution. When C is multi-dimensional and ε is small, like 10−6 or 10−10, this problem is, generically, a problem of minimizing under a nonconvex and dif...
متن کاملChance-Constrained Strong Controllability of Temporal Plan Networks with Uncertainty
This works presents a novel approach for determining chance-constrained strong controllability of Temporal Plan Networks with Uncertainty (TPNU) by framing it as an Optimal Satisfiability Problem (OpSAT).
متن کاملFlow-Based Combinatorial Chance Constraints
We study stochastic variants of flow-based global constraints as combinatorial chance constraints. As a specific case study, we focus on the stochastic weighted alldifferent constraint. We first show that determining the consistency of this constraint is NP-hard. We then show how the combinatorial structure of the alldifferent constraint can be used to define chance-based filtering, and to comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Control Systems Letters
سال: 2017
ISSN: 2475-1456
DOI: 10.1109/lcsys.2017.2704295