9 search results - page 2 / 2 » Space-Progressive Value Iteration: An Anytime Algorithm for ... |
ICRA
2008
IEEE
13 years 11 months ago
2008
IEEE
Abstract— We propose a new approximate algorithm, LAJIV (Lookahead J-MDP Information Value), to solve Oracular Partially Observable Markov Decision Problems (OPOMDPs), a special ...
NIPS
2007
13 years 6 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
CORR
2012
Springer
12 years 20 days ago
2012
Springer
Abstract— In this paper, we consider a class of continuoustime, continuous-space stochastic optimal control problems. Building upon recent advances in Markov chain approximation ...
AI
2006
Springer
13 years 5 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...