Classical planning in MDP heuristics: With a little help from generalization

ICAPS 2010 - Proceedings of the 20th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2010, Pages 97-104

  Kolobov, Andrey ^a   Mausam, ^a   Weld, Daniel S ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BASIS FUNCTIONS; CLASSICAL PLANNING; HEURISTIC FUNCTIONS; MEMORY REQUIREMENTS; MEMORY SAVINGS; OPTIMISTIC VALUE;

COST BENEFIT ANALYSIS; HEURISTIC ALGORITHMS; SCHEDULING;

PLANNING;

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

References (18)

1. Bonet, B., and Geffner, H. 2003. Labeled RTDP: Improving the convergence of real-time dynamic programming. In ICAPS'03, 12-21.
2. Bonet, B., and Geffner, H. 2005. mGPT: A probabilistic planner based on heuristic search. Journal of Artificial Intelligence Research 24:933-944. (Pubitemid 43130954)
3. C. Knoblock, S. M., and Etzioni, O. 1991. Integrating abstraction and explanation-based learning in PRODIGY. In Ninth National Conference on Artificial Intelligence.
4. Forgy, C. 1982. Rete: A fast algorithm for the many pattern/many object pattern match problem. In Artificial Intelligence, volume 19, 17-37. (Pubitemid 13465076)
5. Gerevini, A.; Saetti, A.; and Serina, I. 2003. Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research 20:239-290. (Pubitemid 41530527)
6. Gretton, C., and Thiebaux, S. 2004. Exploiting first-order regression in inductive policy selection. In UAI'04.
7. Hansen, E., and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. In Artificial Intelligence, 129(1-2):35-62. (Pubitemid 32498415)
8. Hoffman, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302. (Pubitemid 33738066)
9. Keyder, E., and Geffner, H. 2008. The HMDPP planner for planning with probabilities. In Sixth International Planning Competition at ICAPS'08.
10. Kolobov, A.; Mausam; and Weld, D. 2009. ReTrASE: Integrating paradigms for approximate probabilistic planning. In IJCAI'09.
11. Kolobov, A.; Mausam; and Weld, D. 2010. SixthSense: Fast and reliable recognition of dead ends in MDPs. In submission.
12. Little, I., and Thiebaux, S. 2007. Probabilistic planning vs. replanning. In ICAPS Workshop on IPC: Past, Present and Future.
13. Mausam; Bertoli, P.; and Weld, D. 2007. A hybridized planner for stochastic domains. In IJCAI'07.
14. Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks revisited. In AAAI'08.
15. Sanner, S., and Boutilier, C. 2006. Practical linear value-approximation techniques for first-order MDPs. In UAI'06.
16. Teichteil-Koenigsbuch, F.; Infantes, G.; and Kuter, U. 2008. RFF: A robust, FF-based MDP planning algorithm for generating policies with low probability of failure. In Sixth International Planning Competition at ICAPS'08.
17. Yoon, S.; Fern, A.; Kambhampati, S.; and Givan, R. 2008. Probabilistic planning via determinization in hindsight. In AAAI'08.
18. Yoon, S.; Fern, A.; and Givan, R. 2007. FF-Replan: A baseline for probabilistic planning. In ICAPS'07, 352-359.