Abstract Many practical problems, such as computer science, communications network, product design, system control, statistics and finance, etc.,can be formulated a probabilistic constrained optimization problem (PCOP) which is challenging to solve since it usually nonconvex nonsmooth. Effective methods for the mostly focus on approximation techniques, convex approximation, D.C. (difference of ...

Probabilistic Logic Programming is an effective formalism for encoding problems characterized by uncertainty. Some of these may require the optimization probability values subject to constraints among distributions random variables. Here, we introduce a new class probabilistic logic programs, namely Optimizable Programs, and provide algorithm find best assignment probabilities variables, such t...

In this paper we study repetitive events with qualitative constraints. We provide a formalism for representing and reasoning with repetitive events using probabilistic approach.

Making appropriate environmental policy decisions requires considering various sources of uncertainty. An air pollution example is formulated as a design optimization problem with probabilistic constraints, also referred to as reliability-based design optimization (RBDO). Environmental applications with a large number of constraints and significant model complexity present special challenges. I...

We present a probabilistic architecture for solving generically the problem of extracting the task constraints through a Programming by Demonstration (PbD) framework and for generalizing the acquired knowledge to various situations. In previous work, we proposed an approach based on Gaussian Mixture Regression (GMR) to find a controller for the robot reproducing the statistical characteristics ...

Introducing probabilistic constraints leads in general to nonconvex, nonsmooth or even discontinuous optimization models. In this paper, necessary and sufficient conditions for metric regularity of (several joint) probabilistic constraints are derived using recent results from nonsmooth analysis. The conditions apply to fairly general constraints and extend earlier work in this direction. Furth...

We present a modified version of the perceptron learning algorithm (PLA) which solves semidefinite programs (SDPs) in polynomial time. The algorithm is based on the following three observations: (i) Semidefinite programs are linear programs with infinitely many (linear) constraints; (ii) every linear program can be solved by a sequence of constraint satisfaction problems with linear constraints...

This paper presents a novel sampling-based planner, CC-RRT*, which generates robust, asymptotically optimal trajectories in real-time for linear Gaussian systems subject to process noise, localization error, and uncertain environmental constraints. CC-RRT* provides guaranteed probabilistic feasibility, both at each time step and along the entire trajectory, by using chance constraints to effici...

Probabilistic databases (PDBs) are usually incomplete, e.g., contain only the facts that have been extracted from the Web with high confidence. However, missing facts are often treated as being false, which leads to unintuitive results when querying PDBs. Recently, open-world probabilistic databases (OpenPDBs) were proposed to address this issue by allowing probabilities of unknown facts to tak...