Conditional planning in the discrete belief space

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 1260-1265

  Rintanen, Jussi ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF SPACE; CONDITIONAL PLANNING; DECISION PROBLEMS; OBSERVABILITY RESTRICTIONS; PARTIAL OBSERVABILITY; PARTIALLY OBSERVABLE MARKOV DECISION PROCESS; PLANNING PROBLEM; PROBABILISTIC PLANNING;

ARTIFICIAL INTELLIGENCE; OBSERVABILITY;

ALGORITHMS;

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

References (12)

1. Piergiorgio Bertoli, Alessandro Cimatti, Marco Roveri, and Paolo Traverso. Planning in nondeterministic domains under partial observability via symbolic model checking. In Bernhard Nebel, editor, Proceedings of the 17th International Joint Conference on Artificial Intelligence, pages 473-478. Morgan Kaufmann Publishers, 2001.
2. Blai Bonet and Héctor Geffner. Planning with incomplete information as heuristic search in belief space. In Steve Chien, Subbarao Kambhampati, and Craig A. Knoblock, editors, Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, pages 52-61. AAAI Press, 2000.
3. J. R. Burch, E. M. Clarke, D. E. Long, K. L. MacMillan, and D. L. Dill. Symbolic model checking for sequential circuit verification. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 13(4):401-424, 1994.
4. Leslie Pack Kaelbling, Michael L. Littman, and Anthony R. Cassandra. Planning and acting in partially observable stochastic domains. Artificial Intelligence, 101(1-2):99-134, 1998.
5. Omid Madani, Steve Hanks, and Anne Condon. On the decidability of probabilistic planning and infinite-horizon partially observable Markov decision problems. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99) and the 11th Conference on Innovative Applications of Artificial Intelligence (IAAI-99), pages 541-548. AAAI Press, 1999.
6. Martin Mundhenk, Judy Goldsmith, Christopher Lusena, and Eric Allender. Complexity of finite-horizon Markov decision process problems. Journal of the ACM, 47(4):681-720, 2000.
7. M. L. Puterman. Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons, 1994.
8. Jussi Rintanen. Backward plan construction under partial observability. In Malik Ghallab, Joachim Hertzberg, and Paolo Traverso, editors, Proceedings of the Sixth International Conference on Artificial Intelligence Planning Systems, pages 173-182. AAAI Press, 2002.
9. Jussi Rintanen. Complexity of planning with partial observability. In Shlomo Zilberstein, Jana Koehler, and Sven Koenig, editors, ICAPS 2004. Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, pages 345-354. AAAI Press, 2004.
10. Jussi Rintanen. Distance estimates for planning in the discrete belief space. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-2004) and the 13th Conference on Innovative Applications of Artificial Intelligence (IAAI-2004), pages 525-530. AAAI Press, 2004.
11. Richard D. Smallwood and Edward J. Sondik. The optimal control of partially observable Markov processes over a finite horizon. Operations Research, 21:1071-1088, 1973.
12. Daniel S. Weld, Corin R. Anderson, and David E. Smith. Extending Graphplan to handle uncertainty and sensing actions. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98) and the 10th Conference on Innovative Applications of Artificial Intelligence (IAAI-98), pages 897-904. AAAI Press, 1998.