Complexity of planning with partial observability

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 345-354

  Rintanen, Jussi ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DECISION THEORY; PLANNING; PROBABILITY DISTRIBUTIONS; TURING MACHINES;

CONDITIONAL PLANNING; DECISION PROBLEMS; NONDETERMINISTIC PROBLEMS;

COMPUTATIONAL COMPLEXITY;

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

References (17)

1. Balcázar, J. L.; Díaz, J.; and Gabarró, J. 1988. Structural Complexity I. Berlin: Springer-Verlag.
2. Balcázar, J. L.; Díaz, J.; and Gabarró, J. 1990. Structural Complexity II. Berlin: Springer-Verlag.
3. Baral, C.; Kreinovich, V.; and Trejo, R. 2000. Computational complexity of planning and approximate planning in the presence of incompleteness. Artificial Intelligence 122(1):241-267.
4. Bylander, T. 1994. The computational complexity of prepositional STRIPS planning. Artificial Intelligence 69(1-2):165-204.
5. Chandra, A.; Kozen, D.; and Stockmeyer, L. 1981. Alternation. Journal of the ACM 28(1):114-133.
6. Cimatti, A.; Pistore, M.; Roveri, M.; and Traverso, P. 2003. Weak, strong, and strong cyclic planning via sym bolic model checking. Artificial Intelligence 147(1-2):35-84.
7. Condon, A., and Lipton, R. J. 1989. On the complexity of space bounded interactive proofs (extended abstract). In Proceedings of the 30th IEEE Symposium on Foundations of Computer Science, 462-467. IEEE.
8. Haslum, P., and Jonsson, P. 2000. Some results on the complexity of planning with incomplete information. In Biundo, S., and Fox, M., eds., Recent Advances in AI Planning. Fifth European Conference on Planning (ECP'99), number 1809 in Lecture Notes in Artificial Intelligence, 308-318. Springer-Verlag.
9. Hopcroft, J. E., and Ullman, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley Publishing Company.
10. Littman, M. L.; Goldsmith, J.; and Mundhenk, M. 1998. The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research 9:1-36.
11. Littman, M. L. 1997. Probabilistic prepositional planning: Representations and complexity. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97) and 9th Innovative Applications of Artificial Intelligence Conference (IAAI-97), 748-754. Menlo Park: AAAI Press.
12. Madani, O.; Hanks, S.; and Condon, A. 2003. On the undecidability of probabilistic planning and related stochastic optimization problems. Artificial Intelligence 147(1-2):5-34.
13. Mundhenk, M.; Goldsmith, J.; Lusena, C.; and Allender, E. 2000. Complexity of finite-horizon Markov decision process problems. Journal of the ACM 47(4):681-720.
14. Paz, A. 1971. Introduction to Probabilistic Automata. Academic Press.
15. Rintanen, J. 1999. Constructing conditional plans by a theorem-prover. Journal of Artificial Intelligence Research 10:323-352.
16. Stockmeyer, L. J., and Chandra, A. K. 1979. Provably difficult combinatorial games. SIAM Journal on Computing 8(2):151-174.
17. Turner, H. 2002. Polynomial-length planning spans the polynomial hierarchy. In Logics in Artificial Intelligence, European Conference, JELIA 2002, number 2424 in Lecture Notes in Computer Science, 111-124. Springer-Verlag.