Sciweavers

221 search results - page 5 / 45
» A Linear Decision-Based Approximation Approach to Stochastic...
Sort
View
FLAIRS
2009
13 years 5 months ago
Dynamic Programming Approximations for Partially Observable Stochastic Games
Partially observable stochastic games (POSGs) provide a rich mathematical framework for planning under uncertainty by a group of agents. However, this modeling advantage comes wit...
Akshat Kumar, Shlomo Zilberstein
TROB
2010
129views more  TROB 2010»
13 years 5 months ago
A Probabilistic Particle-Control Approximation of Chance-Constrained Stochastic Predictive Control
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
Lars Blackmore, Masahiro Ono, Askar Bektassov, Bri...
SIAMJO
2002
124views more  SIAMJO 2002»
13 years 7 months ago
The Sample Average Approximation Method for Stochastic Discrete Optimization
In this paper we study a Monte Carlo simulation based approach to stochastic discrete optimization problems. The basic idea of such methods is that a random sample is generated and...
Anton J. Kleywegt, Alexander Shapiro, Tito Homem-d...
AIPS
2008
13 years 9 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein
FOCS
2005
IEEE
14 years 1 months ago
Sampling-based Approximation Algorithms for Multi-stage Stochastic
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...
Chaitanya Swamy, David B. Shmoys