Probabilistic planning via determinization in hindsight

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2008, Pages 1010-1016

  Yoon, Sungwook ^a   Fern, Alan ^b   Givan, Robert ^c   Kambhampati, Subbarao ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

^b Oregon State University   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SELECTIONS; DETERMINIZATION; DO-MAINS; HEURISTIC SEARCHES; INTERESTING PROBLEMS; ONLINE SCHEDULING; ONLINE TECHNIQUES; PLANNING PROBLEMS; PROBABILISTIC PLANNING;

APPLICATIONS; ARTIFICIAL INTELLIGENCE; BENCHMARKING; BIONICS; OPTIMIZATION; PROBABILITY; THEOREM PROVING;

PLANNING;

EID: 57749193939     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Bryce, D.; Kambhampati, S.; and Smith, D. E. 2008. Sequential monte carlo in reachability heuristics for probabilistic planning. Artif. Intell. 172(6-7):685-715.
2. Buffet, O., and Aberdeen, D. 2007. FF+FPG: Guiding a policy-gradient planner. In Proceedings of International Conference on Automated Planning and Scheduling.
3. Chong, E.; Givan, R.; and Chang, H. 2000. A framework for simulation-based network control via hindsight optimization. In IEEE Conference on Decision and Control.
4. Foss, J.; Onder, N.; and Smith, D. 2007. Preventing unrecoverable failures through precautionary.
5. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:263-302.
6. Little, I., and Thiebaux, S. 2006. Concurrent probabilistic planning in the graphplan framework. In Proceedings of International Conference on Automated Planning and Scheduling.
7. Little, I., and Thiebaux, S. 2007. Probabilistic planning vs replanning. In ICAPS Workshop on Planning Competitions: Past, Present, and Future.
8. Mercier, L., and Van HenTenRyck, P. 2007. Performance analysis of online anticipatory algorithms for large multistage stochastic programs. In International Joint Conference on Artificial Intelligence.
9. Ng, A. Y., and Jordan, M. 2000. PEGASUS:A policy search method for large MDPs and POMDPs. In Proceedings of International Conference on Uncertainty in Artificial Intelligence, 406-415.
10. Palacios, H., and Geffner, H. 2007. From conformant into classical planning: Efficient translations that may be complete too. In Proceedings of ICAPS-07.
11. Sanner, S., and Boutilier, C. 2006. First order approximate linear programming. In International Probabilistic Planning Competition Booklet of ICAPS.
12. Wu, G.; Chong, E.; and Givan, R. 2002. Burst-level congestion control using hindsight optimization. IEEE Transactions on Automatic Control.
13. Yoon, S.; Fern, A.; and Givan, R. 2007. FF-Replan: A baseline for probabilistic planning. In ICAPS.
14. Younes, H., and Simmons, R. 2004. Policy generation for continuous-time stochastic domains with concurrency.
15. Younes, H. 2003. Extending pddl to model stochastic decision processes. In Proceedings of the ICAPS-03 Workshop on PDDL.