Complexity of probabilistic planning under average rewards

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 503-508

  Rintanen, Jussi ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AVERAGE REWARD CRITERIA; COMPLEX APPLICATIONS; COMPUTATIONAL PROBLEM; EFFICIENT PLANNING; MARKOV DECISION PROCESSES; PROBABILISTIC PLANNING; RATIONALITY CRITERIA; SEQUENTIAL DECISION MAKING UNDER UNCERTAINTIES;

COMPUTATIONAL COMPLEXITY; MARKOV PROCESSES;

ARTIFICIAL INTELLIGENCE;

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

References (23)

1. J. L. Balcázar, I. D́az, and J. Gabarró. Structural Complexity I. Springer-Verlag, Berlin, 1995.
2. José L. Balcázar. The complexity of searching implicit graphs. Artificial Intelligence, 86(1):171-188, 1996.
3. Craig Boutilier and Martin L. Puterman. Process-oriented planning and average-reward optimality. In C. S. Mellish, editor, Proceedings of the 14th International Joint Conference on Artificial Intelligence, pages 1096-1103. Morgan Kaufmann Publishers, 1995.
4. Craig Boutilier, Thomas Dean, and Steve Hanks. Planning under uncertainty: structural assumptions and computational leverage. Journal of Artificial Intelligence Research, 11:1-94, 1999.
5. Tom Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2):165-204, 1994.
6. Anne Condon and Richard J. Lipton. On the complexity of space bounded interactive proofs (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, pages 462-467, 1989.
7. Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, and Mahesh Viswanathan. Complexity of problems on graphs represented as OBDDs. Chicago Journal of Theoretical Computer Science, 5(5), 1999.
8. Hana Galperin and Avi Widgerson. Succinct representations of graphs. Information and Control, 56:183-198, 1983. See [Lozano, 1988] for a correction.
9. Eric A. Hansen. Solving POMDPs by searching in policy space. In Gregory F. Cooper and Seraf́n Moral, editors, Proceedings of the 1998 Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 211-219. Morgan Kaufmann Publishers, 1998.
10. M. L. Littman, J. Goldsmith, and M. Mundhenk. The computational complexity of probabilistic planning. Journal of Artificial Intelligence Research, 9:1-36, 1998. (Pubitemid 128636199)
11. Michael L. Littman. Probabilistic propositional 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), pages 748-754, Menlo Park, July 1997. AAAI Press.
12. Antonio Lozano and José L. Balcázar. The complexity of graph problems for succinctly represented graphs. In Manfred Nagl, editor, Graph-Theoretic Concepts in Computer Science, 15th International Workshop, WG'89, number 411 in Lecture Notes in Computer Science, pages 277-286, Castle Rolduc, The Netherlands, 1990. Springer-Verlag.
13. Antonio Lozano. NP-hardness of succinct representations of graphs. Bulletin of the European Association for Theoretical Computer Science, 35:158-163, June 1988.
14. Christopher Lusena, Tong Li, Shelia Sittinger, Chris Wells, and Judy Goldsmith. My brain is full: When more memory helps. In Kathryn B. Laskey and Henri Prade, editors, Uncertainty in Artificial Intelligence, Proceedings of the Fifteenth Conference (UAI-99), pages 374-381. Morgan Kaufmann Publishers, 1999.
15. 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 Sixteenth National Conference on Artificial Intelligence (AAAI-99) and the Eleventh Conference on Innovative Applications of Artificial Intelligence (IAAI-99), pages 541-548. AAAI Press, 1999.
16. Nicolas Meuleau, Kee-Eung Kim, Leslie Pack Kaelbling, and Anthony R. Cassandra. Solving POMDPs by searching the space of finite policies. In Kathryn B. Laskey and Henri Prade, editors, Uncertainty in Artificial Intelligence, Proceedings of the Fifteenth Conference (UAI-99), pages 417-426. Morgan Kaufmann Publishers, 1999.
17. 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, July 2000.
18. Randolph Nelson. Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling. Springer-Verlag, 1995.
19. Christos H. Papadimitriou and John N. Tsitsiklis. The complexity of Markov decision processes. Mathematics of Operations Research, 12(3):441-450, August 1987.
20. Christos H. Papadimitriou and Mihalis Yannakakis. A note on succinct representations of graphs. Information and Control, 71:181-185, 1986.
21. Azaria Paz. Introduction to Probabilistic Automata. Academic Press, 1971.
22. M. L. Puterman. Markov decision processes: discrete stochastic dynamic programming. John Wiley & Sons, 1994.
23. Larry J. Stockmeyer and Ashok K. Chandra. Provably difficult combinatorial games. SIAM Journal on Computing, 8(2):151-174, 1979.