Symbolic heuristic search for factored Markov decision processes

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 455-460

  Feng, Zhengzhu ^a   Hansen, Eric A ^b  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

^b MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; MARKOV PROCESSES; PLANNING; PROBLEM SOLVING;

MARKOV DECISION PROCESSES (MDP);

DECISION THEORY;

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

References (12)

1. Barto, A.; Bradtke, S.; and Singh, S. 1995. Learning to act using real-time dynamic programming. Artificial Intelligence 72:81-138.
2. Bertoli, P.; Cimatti, A.; and Roveri, M. 2001. Heuristic search + symbolic model checking = efficient conformant planning. In Proceedings of the 17th International Joint Conference on Artificial Intelligence, 467-472.
3. Boutilier, C.; Brafman, R. I.; and Geib, C. 1998. Structured reachability analysis for Markov decision processes. In Proceedings of the 14th International Conference on Uncertainty in Artificial Intelligence, 24-32.
4. Cimatti, M.; Roveri, M.; and Traverso, P. 1998. Automatic OBDD-based generation of universal plans in nondeterministic domains. In Proceedings of the 15th National Conference on Artificial Intelligence, 875-881.
5. Daniele, M.; Traverso, P.; and Vardi, M. 1999. Strong cyclic planning revisited. In Proceedings of the 5th European Conference on Planning.
6. Dean, T.; Kaelbling, L.; Kirman, J.; and Nicholson, A. 1995. Planning under time constraints in stochastic domains. Artificial Intelligence 76:35-74.
7. Dearden, R., and Boutilier, C. 1997. Abstraction and approximate decision-theoretic planning. Artificial Intelligence 89:219-283.
8. Edelkamp, S., and Reffel, F. 1998. OBDDs in heuristic search. In German Conference on Artificial Intelligence (KI), 81-92.
9. Hansen, E., and Zilberstein, S. 2001. LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence 129:35-62.
10. Hoey, J.; St-Aubin, R.; Hu, A.; and Boutilier, C. 1999. SPUDD: Stochastic planning using decision diagrams. In Proceedings of the 15th Conference on Uncertainty in Articial Intelligence, 279-288.
11. Somenzi, F. 1999. Binary decision diagrams. In Broy, M., and Steinbruggen, R., eds., Calculational System Design, volume 173 of NATO Science Series F: Computer and Systems Sciences. IOS Press. 303-366.
12. St-Aubin, R.; Hoey, J.; and Boutilier, C. 2000. APRICODD: Approximate policy construction using decision diagrams. In Proceedings of NIPS-2000.