Solving Trajectory Optimization Problems in the Presence of Probabilistic Constraints
نویسندگان
چکیده
منابع مشابه
On Solving Optimization Problems with Ordered Average Criteria and Constraints
The problem of aggregating multiple numerical attributes to form overall measure is of considerable importance in many disciplines. The ordered weighted averaging (OWA) aggregation, introduced by Yager, uses the weights assigned to the ordered values rather than to the specific attributes. This allows one to model various aggregation preferences, preserving simultaneously the impartiality (neut...
متن کاملEasy distributions for combinatorial optimization problems with probabilistic constraints
We show how we can linearize probabilistic linear constraints with binary variables when all coefficients are distributed according to either N (μi, λμi), for some λ > 0 and μi > 0, or Γ(ki, θ) for some θ > 0 and ki > 0. The constraint can also be linearized when the coefficients are independent and identically distributed if they are, besides, either positive or strictly stable random variables.
متن کاملProbabilistic Constraints for Inverse Problems
The authors previous work on probabilistic constraint reasoning assumes the uncertainty of numerical variables within given bounds, characterized by a priori probability distributions. It propagates such knowledge through a network of constraints, reducing the uncertainty and providing a posteriori probability distributions. An inverse problem aims at estimating parameters from observed data, b...
متن کاملReliability optimization problems with multiple constraints under fuzziness
In reliability optimization problems diverse situation occurs due to which it is not always possible to get relevant precision in system reliability. The imprecision in data can often be represented by triangular fuzzy numbers. In this manuscript, we have considered different fuzzy environment for reliability optimization problem of redundancy. We formulate a redundancy allocation problem for a...
متن کاملProbabilistic optimization in graph-problems
We study a probabilistic optimization model for graph-problems under vertex-uncertainty. We assume that any vertex vi of the input-graph G(V,E) has only a probability pi to be present in the final graph to be optimized (i.e., the final instance for the problem tackled will be only a sub-graph of the initial graph). Under this model, the original “deterministic” problem gives rise to a new (dete...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Cybernetics
سال: 2020
ISSN: 2168-2267,2168-2275
DOI: 10.1109/tcyb.2019.2895305