FF-Replan: A baseline for probabilistic planning

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 352-359

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

^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

DETERMINISTICS; PLANNING COMPETITIONS; PLANNING DOMAINS; PLANNING PROBLEM; PROBABILISTIC PLANNING; STATE OF THE ART;

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

References (21)

1. Bertsekas, D. P., and Tsitsiklis, J. N. 1996. Neuro-Dynamic Programming. Athena Scientific.
2. Blum, A., and Langford, J. 1999. Probabilistic planning in the graphplan framework. In ECP, 319-332.
3. Bonet, B., and Givan, R. 2006. International probablistic planning competition, url=http://www.ldc.usb. ve/~bonet/ipc5/.
4. Boutilier, C.; Brafman, R. I.; and Geib, C. 1998. Structured reachability analysis for Markov decision processes. In Uncertainty in Artificial Intelligence 1998, 24-32.
5. Boutilier, C.; Dearden, R.; and Goldszmidt, M. 2000. Stochastic dynamic programming with factored representations. Artificial Intelligence 121(1-2):49-107.
6. Buffet, O., and Aberdeen, D. 2006. The factored policy gradient planner. In International Probabilistic Planning Competition Booklet of ICAPS.
7. Fern, A.; Yoon, S.; and Givan, R. 2006. Approximate policy iteration with a policy language bias: Solving relational markov decision processes. Journal of Artificial Intelligence Research 25:85-118.
8. Geffner, H. 1998. Classical, probabilistic and contingent planning: Three models, one algorithm. In AIPS'98 Workshop on Planning as Combinatorial Search.
9. Gretton, C., and Thiebaux, S. 2004. Non markovian reward decision process planner, url=http://users.rsise. anu.edu.au/~charlesg/nmrdpp/.
10. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:263-302.
11. Karabaev, E., and Skvortsova, O. 2005. A Heuristic Search Algorithm for Solving First-Order MDPs. In Bacchus, F., and Jaakkola, T, eds., Proceedings of the Conference on Uncertainty in Artificial Intelligence (UAI'2005), 292-299. Edinburgh, Scotland: AUAI Press. ISBN-0-9749039-1-4.
12. Mausam; Bertoli, P.; and Weld, D. S. 2007. A hybridized planner for stochastic domains. In IJCAI.
13. McDermott. 1998. Pddl-the planning domain definition language. In The 1st International Planning Competition.
14. 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.
15. Meuleau, N., and Smith, D. 2003. Optimal limited contingency planning.
16. Puterman, M. 1994. Markov Decision Processes. Wiley, New York.
17. Sanner, S., and Boutilier, C. 2006. First order approximate linear programming. In International Probabilistic Planning Competition Booklet of ICAPS.
18. Wu, G.; Chong, E.; and Givan, R. 2002. Burst-level congestion control using hindsight optimization. IEEE Transactions on Automatic Control.
19. Yoon, S.; Fern, A.; and Givan, R. 2004. Learning reactive policies for probabilistic planning domains. In International Probabilistic Planning Competition Booklet of ICAPS.
20. Younes, H., and Littman, M. 2004a. International probablistic planning competition, url=http://www.cs. rutgers.edu/~mlittman/topics/ipc04-pt.
21. Younes, H. L. S., and Littman, M. L. 2004b. Ppddl1.0: An extension to pddl for expressing planning domains with probabilistic effects. In Technical Report CMU-CS-04-162.