Sciweavers

802 search results - page 93 / 161
» Experts in a Markov Decision Process
Sort
View
CCE
2004
13 years 10 months ago
An algorithmic framework for improving heuristic solutions: Part II. A new version of the stochastic traveling salesman problem
The algorithmic framework developed for improving heuristic solutions of the new version of deterministic TSP [Choi et al., 2002] is extended to the stochastic case. To verify the...
Jaein Choi, Jay H. Lee, Matthew J. Realff
ICRA
2010
IEEE
133views Robotics» more  ICRA 2010»
13 years 8 months ago
Variable resolution decomposition for robotic navigation under a POMDP framework
— Partially Observable Markov Decision Processes (POMDPs) offer a powerful mathematical framework for making optimal action choices in noisy and/or uncertain environments, in par...
Robert Kaplow, Amin Atrash, Joelle Pineau
IJRR
2010
162views more  IJRR 2010»
13 years 8 months ago
Planning under Uncertainty for Robotic Tasks with Mixed Observability
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
Sylvie C. W. Ong, Shao Wei Png, David Hsu, Wee Sun...
ICTAI
2010
IEEE
13 years 8 months ago
A Closer Look at MOMDPs
Abstract--The difficulties encountered in sequential decisionmaking problems under uncertainty are often linked to the large size of the state space. Exploiting the structure of th...
Mauricio Araya-López, Vincent Thomas, Olivi...
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 8 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...