A heuristic search algorithm for solving first-order MDPs

Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence, UAI 2005

Volumn , Issue , 2005, Pages 292-299

  Karabaev, Eldar ^a   Skvortsova, Olga ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; ARTIFICIAL INTELLIGENCE; LEARNING ALGORITHMS;

FIRST ORDER; HEURISTIC SEARCH; HEURISTIC SEARCH ALGORITHMS; INITIAL STATE; INTERNATIONAL PLANNING COMPETITIONS; PROPOSITIONALIZATION; STATE ABSTRACTION;

HEURISTIC ALGORITHMS;

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

References (14)

1. Barto, A. G., Bradtke, S. J., and Singh, S. P. (1995). Learning to act using real-time dynamic programming. AI, 72(1-2):81-138.
2. Boutilier, C., Dean, T., and Hanks, S. (1999). Decision-theoretic planning: Structural assumptions and computational leverage. AI Research, 11:1-94. (Pubitemid 129628760)
3. Boutilier, C., Reiter, R., and Price, B. (2001). Symbolic dynamic programming for first-order MDPs. In IJCAI-01. 690-700.
4. Dean, T., Kaelbling, L., Kirman, J., and Nicholson, A. (1995). Planning under time constraints in stochastic domains. AI, 76:35-74.
5. Feng, Z. and Hansen, E. (2002). Symbolic heuristic search for factored markov decision processes. In AAAI-02. 455-460.
6. Fern, A., Yoon, S., and Givan, R. (2003). Approximate policy iteration with a policy language bias. In NIPS-03.
7. Gardiol, N. and Kaelbling, L. (2004). Envelope-based planning in relational MDPs. In NIPS-03.
8. Gretton, C. and Thiebaux, S. (2004). Exploiting firstorder regression in inductive policy selection. In UAI-04.
9. Hansen, E. and Zilberstein, S. (2001). LAO*: A heuristic search algorithm that finds solutions with loops. AI, 129:35-62.
10. Hoey, J., St-Aubin, R., Hu, A., and Boutilier, C. (1999). SPUDD: Stochastic planning using decision diagrams. In UAI-99. 279-288.
11. Hölldobler, S. and Schneeberger, J. (1990). A new deductive approach to planning. New Generation Computing, 8:225-244.
12. Hölldobler, S. and Skvortsova, O. (2004). A logicbased approach to dynamic programming. In AAAI-04 workshop: Learning and planning in MDPs. 31-36.
13. Kersting, K., van Otterlo, M., and De Raedt, L. (2004). Bellman goes relational. In ICML-04.
14. St-Aubin, R., Hoey, H., and Boutilier, C. (2000). APRICODD: Approximate policy construction using decision diagrams. In NIPS-00. 1089-1095.