PEGASUS: A policy search method for large MDPs and POMDPs
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Sequential Monte Carlo in reachability heuristics for probabilistic planning
Artificial Intelligence
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
ReTrASE: integrating paradigms for approximate probabilistic planning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Probabilistic action planning for active scene modeling in continuous high-dimensional domains
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Incremental plan aggregation for generating policies in MDPs
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Planning for human-robot teaming in open worlds
ACM Transactions on Intelligent Systems and Technology (TIST)
State agnostic planning graphs: deterministic, non-deterministic, and probabilistic planning
Artificial Intelligence
Planning with noisy probabilistic relational rules
Journal of Artificial Intelligence Research
Replanning in domains with partial information and sensing actions
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Discovering hidden structure in factored MDPs
Artificial Intelligence
Replanning in domains with partial information and sensing actions
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hindsight optimization is an online technique that evaluates the one-step-reachable states by sampling future outcomes to generate multiple non-stationary deterministic planning problems which can then be solved using search. Hindsight optimization has been successfully used in a number of online scheduling applications; however, it has not yet been considered in the substantially different context of goal-based probabilistic planning. We describe an implementation of hindsight optimization for probabilistic planning based on deterministic forward heuristic search and evaluate its performance on planning-competition benchmarks and other probabilistically interesting problems. The planner is able to outperform a number of probabilistic planners including FF-Replan on many problems. Finally, we investigate conditions under which hindsight optimization is guaranteed to be effective with respect to goal achievement, and also illustrate examples where the approach can go wrong.