Jussi Rintanen Albert-Ludwigs-Universitat Freiburg, Institut fur Informatik...  Home/Search
Context Related
| informatik.unifre...anenijcai01.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.unifr...publikationen (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. (Update)
Context of citations to this paper: More
...polynomial in the size of the problem specification. As a result, their results parallel the results for finite horizon POMDPs. Rintanen [29] analyzes the complexity of probabilistic planning problems under average reward criteria, and establishes undecidability results for...
...size polynomial in the size of the problem speci cation. As a result, their results parallel the results for nite horizon POMDPs. Rintanen [45] analyzes the complexity of probabilistic planning problems under average reward criteria, and establishes undecidability results for...
Cited by: More
On the Undecidability of Probabilistic Planning and.. - Madani, Hanks, Condon (2003) (Correct)
Active bibliography (related documents): More All
1.8: Complexity of Probabilistic Planning under Average Rewards - Rintanen (2001) (Correct)
0.5: Conditional Planning in the Discrete Belief Space - Jussi Rintanen.. (2005) (Correct)
0.4: Partial implicit unfolding in the Davis-Putnam procedure for.. - Rintanen (2001) (Correct)
Similar documents based on text: More All
0.3: Complexity of Planning with Partial Observability - Rintanen (2004) (Correct)
0.3: On the Undecidability of Probabilistic Planning and.. - Madani, Hanks, al. (1999) (Correct)
0.2: Constrained Discounted Markov Decision Processes And Hamiltonian .. - Feinberg (1997) (Correct)
Related documents from co-citation: More All
4: The optimal control of partially observable markov processes over a finite horiz.. (context) - Smallwood, Sondik - 1973
2: the complexity of space bounded interactive proofs (context) - Condon, Lipton - 1989
2: Algorithms for Sequential Decision Making - Littman - 1996
BibTeX entry: (Update)
J. Rintanen. Complexity of probabilistic planning under average rewards. In Proceedings of International Joint Conference on Artificial Intelligence, 2001. To Appear. http://citeseer.ist.psu.edu/rintanen01complexity.html More
@inproceedings{ rintanen01complexity,
author = "Jussi Rintanen",
title = "Complexity of Probabilistic Planning under Average Rewards",
booktitle = "{IJCAI}",
pages = "503-508",
year = "2001",
url = "citeseer.ist.psu.edu/rintanen01complexity.html" }
Citations (may not include all citations):291 Markov decision processes: discrete stochastic dynamic progr.. (context) - Puterman - 1994
147 The computational complexity of propositional STRIPS plannin.. - Bylander - 1994
73 Introduction to Probabilistic Automata (context) - Paz - 1971
66 Structural Complexity (context) - Balcazar, az et al. - 1995
64 Planning under uncertainty: structural assumptions and compu.. - Boutilier, Dean et al. - 1999
53 Probabilistic propositional planning: Representations and co.. - Littman - 1997
46 The computational complexity of probabilistic planning - Littman, Goldsmith et al. - 1998
42 Solving POMDPs by searching in policy space - Hansen - 1998
33 Succinct representations of graphs (context) - Galperin, Widgerson - 1988
29 The complexity of Markov decision processes (context) - Papadimitriou, Tsitsiklis - 1987
26 the complexity of space bounded interactive proofs (context) - Condon, Lipton - 1989
23 Provably difficult combinatorial games (context) - Stockmeyer, Chandra - 1979
21 and queueing theory: the mathematics of computer performance.. (context) - Nelson, stochastic - 1995
15 Solving POMDPs by searching the space of finite policies - Meuleau, Kim et al. - 1999
15 Complexity of finite-horizon Markov decision process problem.. - Mundhenk, Goldsmith et al. - 2000
12 Process-oriented planning and averagereward optimality - Boutilier, Puterman - 1995
10 Complexity of problems on graphs represented as OBDDs - Feigenbaum, Kannan et al. - 1999
6 The complexity of graph problems for succinctly represented .. (context) - Lozano, Balcazar - 1990
6 My brain is full: When more memory helps - Lusena, Li et al. - 1999
4 A note on succinct representations of graphs (context) - Papadimitriou, Yannakakis - 1986
3 The complexity of searching implicit graphs (context) - Balcazar - 1996
2 NP-hardness of succinct representations of graphs (context) - Lozano - 1988
2 the decidability of probabilistic planning and infinite-hori.. (context) - Madani, Hanks et al. - 1999
Documents on the same site (http://www.informatik.uni-freiburg.de/~ki/publikationen.html): More
Solving Hard Qualitative Temporal Reasoning Problems: Evaluating.. - Nebel (1997) (Correct)
A Cognitive Assessment of Topological Spatial Relations.. - Knauff, Rauh, Renz (1997) (Correct)
An Experimental Comparison of Localization Methods - Gutmann, Burgard, Fox, Konolige (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC