Complexity issues in Markov decision processes

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 1998, Pages 272-280

  Goldsmith, J ^a   Mundhenk, M ^b  

^a UNIVERSITY OF KENTUCKY   (United States)

^b UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MARKOV PROCESSES;

COMPLEXITY ISSUES; COMPUTATIONAL PROBLEM; DECISION PROBLEMS; MARKOV DECISION PROCESSES;

COMPUTATIONAL COMPLEXITY;

EID: 84989923067     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.1998.694621     Document Type: Conference Paper

References (40)

1. [AO96] E. Allender and M. Ogihara. Relationships among PL, #L, and the determinant. RAIRO Theoretical Informatics and Applications, 30(1):1-21, 1996.
2. [Bäc95] C. Bäckström. Expressive equivalence of planning formalisms. Artificial Intelligence, 76:17-34, 1995.
3. [BBS95] D. Beauquier, D. Burago, and A. Slissenko. On the complexity of finite memory policies for Markov decision processes. In Math. Foundations of Computer Science, pages 191-200. Lecture Notes in Computer Science #969, Springer-Verlag, 1995.
4. [BDG95] C. Boutilier, R. Dearden, and M. Goldszmidt. Exploiting structure in policy construction. In 14th International Conference on AI, 1995.
5. [BDH95] C. Boutilier, T. Dean, and S. Hanks. Planning under uncertainty: Structural assumptions and computational leverage. In Proceedings of the Second European Workshop on Planning, 1995.
6. [BdRS96] D. Burago, M. de Rougemont, and A. Slissenko. On the complexity of partially observed Markov decision processes. Theoretical Computer Science, 157(2):161-183, 1996.
7. [Bel57] R. Bellman. Dynamic programming. Princeton University Press, 1957.
8. [BLT92] J.L. Balcázar, A. Lozano, and J. Torán. The complexity of algorithmic problems on succinct instances. In R. Baeza-Yates and U. Manber, editors, Computer Science, pages 351-377. Plenum Press, 1992.
9. [BRS95] R. Beigel, N. Reingold, and D. Spielman. PP is closed under intersection. Journal of Computer and System Sciences, 50:191-202, 1995.
10. [Byl94] T. Bylander. The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69:165-204, 1994.
11. [Cha87] D. Chapman. Planning for conjunctive goals. Artificial Intelligence, 32:333-379, 1987.
12. [Der70] C. Derman. Finite state Markovian decision processes. Academic Press, 1970.
13. [Dra62] A. Drake. Observation of a Markov process through a noisy channel. PhD thesis, Dept. of Electrical Engineering, Massachussets Institute of Technology, 1962.
14. [EHN96] K. Erol, J. Hendler, and D. Nau. Complexity results for hierarchical tasknetwork planning. Annals of Mathematics and Artificial Intelligence, 1996.
15. [ENS95] K. Erol, D. Nau, and V. S. Subrahmanian. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76:75-88, 1995.
16. [FFK94] S. Fenner, L. Fortnow, and S. Kurtz. Gap-definable counting classes. Journal of Computer and System Sciences, 48(1):116-148, 1994.
17. [GLM97] J. Goldsmith, M. Littman, and M. Mundhenk. The complexity of plan existence and evaluation in probabilistic domains. In Proc. 13th Conf. on Uncertainty in AI. Morgan Kaufmann Publishers, 1997.
18. [GW83] H. Galperin and A. Wigderson. Succinct representation of graphs. Information and Control, 56:183-198, 1983.
19. [Jun85] H. Jung. On probabilistic time and space. In Proceedings 12th ICALP, pages 281-291. Lecture Notes in Computer Science #194, Springer-Verlag, 1985.
20. [KHW95] N. Kushmerick, S. Hanks, and D.S. Weld. An algorithm for probabilistic planning. Artificial Intelligence, 76:239-286, 1995.
21. [Lad89] R. Ladner. Polynomial space counting problems. SIAM Journal on Computing, 18:1087-1097, 1989.
22. [LGM98a] M. L. Littman, J. Goldsmith, and M. Mundhenk. The computational complexity of probabilistic planning, 1998.
23. [LGM98b] C. Lusena, J. Goldsmith, and M. Mundhenk. Nonapproximability results for Markov decision processes. Technical Report 274-98, University of Kentucky Department of Computer Science, 1998.
24. [Lit96] M.L. Littman. Probabilistic STRIPS planning is EXPTIME-complete. Technical Report CS-1996-18, Duke University Department of Computer Science, November 1996.
25. [Lit97a] M.L. Littman. Probabilistic propositional planning: Representations and complexity. In Proc. 14th National Conference on Artificial Intelligence. AAAI Press/The MIT Press, 1997.
26. [Lit97b] M.L. Littman. Probabilistic propositional planning: Representations and complexity. In Proc. 14th National Conference on AI. AAAI Press/MIT Press, 1997.
27. [Lov91] W.S. Lovejoy. A survey of algorithmic methods for partially observed Markov decision processes. Annals of Operations Research, 28:47-66, 1991.
28. [MGA97] M. Mundhenk, J. Goldsmith, and E. Allender. The complexity of the policy existence problem for partially-observable finite-horizon Markov decision processes. In Proc. 25th Mathematical Foundations of Computer Sciences, pages 129-138. Lecture Notes in Computer Science #1295, Springer-Verlag, 1997.
29. [MGLA97] M. Mundhenk, J. Goldsmith, C. Lusena, and E. Allender. Encyclopaedia of complexity results for finite-horizon Markov decision process, 1997.
30. [ML98] S.M. Majercik and M.L. Littman. MAXPLAN: A new approach to probabilistic planning. Technical Report 1998-01, Duke University, Department of Computer Science, 1998.
31. [Mun97] M. Mundhenk. The complexity of POMDPs under tractable history dependent policies, 1997.
32. [PT86] C.H. Papadimitriou and J.N. Tsitsiklis. Intractable problems in control theory. SIAM Journal of Control and Optimization, pages 639-654, 1986.
33. [PT87] C.H. Papadimitriou and J.N. Tsitsiklis. The complexity of Markov decision processes. Mathematics of Operations Research, 12(3):441-450, 1987.
34. [Put94] M.L. Puterman. Markov decision processes. John Wiley & Sons, New York, 1994.
35. [Son71] E. Sondik. The optimal control of partially observable Markov processes. PhD thesis, Stanford University, 1971.
36. [SS73] R. Smallwood and E. Sondik. The optimal control of partially observed Markov processes over the finite horizon. Operations Research, 21:1071-1088, 1973.
37. [Tor91] J. Torán. Complexity classes defined by counting quantifiers. Journal of the ACM, 38(3):753-774, 1991.
38. [Tse90] P. Tseng. Solving h-horizon, stationary Markov decision problems in time proportional to log h. Operations Research Letters, pages 287-297, September 1990.
39. [Vin91] V. Vinay. Counting auxiliary pushdown automata and semi-unbounded arithmetic circuits. In Proc. 6th Structure in Complexity Theory Conference, pages 270-284. IEEE, 1991.
40. [Wag86] K. W. Wagner. The complexity of combinatorial problems with succinct input representation. Acta Informatica, 23:325-356, 1986.