Markov tracking for agent coordination
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Heuristic anytime approaches to stochastic decision processes
Journal of Heuristics
Value-function approximations for partially observable Markov decision processes
Journal of Artificial Intelligence Research
Solving POMDPs by searching in policy space
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes
UAI'97 Proceedings of the Thirteenth conference on Uncertainty in artificial intelligence
Proceedings of the 2012 Extreme Modeling Workshop
Hi-index | 0.00 |
This paper presents an approach to building plans using partially observable Markov decision processes. The approach begins with a base solution that assumes full observability. The partially observable solution is incrementally constructed by considering increasing amounts of information from observations. The base solution directs the expansion of the plan by providing an evaluation function for the search fringe. We show that incremental observation moves from the base solution towards the complete solution, allowing the planner to model the uncertainty about action outcomes and observations that are present in real domains.