Omid Madani, Steve Hanks, Anne Condon  Home/Search
Context Related
Links: ACM DBLP | cs.ualberta.ca/~madani/aij02.ps 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: cs.ualberta.ca/~madani...research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Automated planning, the problem of how an agent achieves a goal given a repertoire of actions, is one of the foundational and most widely studied problems in the AI literature. The original formulation of the problem makes strong assumptions regarding the agent's knowledge and control over the world, namely that its information is complete and correct, and that the results of its actions are deterministic and known. (Update)
Context of citations to this paper: More
...the problem more difficult. Without observability the problem of existence of plans with success probability c is undecidable [Madani et al. 2003] . Both full observability and restriction to exponentially long plan executions make the problem decidable and bring it down to...
Cited by: More
A Particle Filtering Algorithm for Interactive POMDPs - Prashant Doshi And (2004) (Correct)
Complexity of Planning with Partial Observability - Rintanen (2004) (Correct)
Similar documents (at the sentence level):
8.9%: On the Undecidability of Probabilistic Planning and Related.. - Madani, Hanks (2003) (Correct)
8.6%: Complexity results for Infinite-Horizon Markov Decision Processes - Madani (2000) (Correct)
7.3%: On the Undecidability of Probabilistic Planning and.. - Madani, Hanks, al. (1999) (Correct)
Active bibliography (related documents): More All
0.6: Undecidable Problems for Probabilistic Automata of Fixed.. - Blondel, Canterini (2001) (Correct)
0.5: Algorithms for Partially Observable Markov Decision Processes - Zhang (2001) (Correct)
0.5: Complexity of Finite-Horizon Markov Decision Process.. - Mundhenk, Goldsmith.. (2000) (Correct)
Similar documents based on text: More All
0.3: Resume - Madani (Correct)
0.3: Optimal Information Gathering on the Internet with.. - Etzioni, Hanks.. (1996) (Correct)
0.3: On the Computability of Infinite-Horizon Partially Observable.. - Madani (1998) (Correct)
BibTeX entry: (Update)
Omid Madani, Steve Hanks, and Anne Condon. On the undecidability of probabilistic planning and related stochastic optimization problems. Artificial Intelligence, 2003. to appear. http://citeseer.ist.psu.edu/madani03undecidability.html More
@misc{ madani03undecidability,
author = "O. Madani and S. Hanks and A. Condon",
title = "the undecidability of probabilistic planning and related stochastic optimization
problems",
text = "Omid Madani, Steve Hanks, and Anne Condon. On the undecidability of probabilistic
planning and related stochastic optimization problems. Artificial Intelligence,
2003. to appear.",
year = "2003",
url = "citeseer.ist.psu.edu/madani03undecidability.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
891 STRIPS: a new approach to the application of theorem proving.. (context) - Fikes, Nilsson - 1971
451 Planning for conjunctive goals (context) - Chapman - 1987
246 Markov Decision Processes (context) - Puterman - 1994 ACM
230 Dynamic Programming: Deterministic and Stochastic Models (context) - Bertsekas - 1987 ACM
216 The optimal control of partially observable Markov processes.. (context) - Sondik - 1978
216 The optimal control of partially observable Markov processes.. (context) - Smallwood, Sondik - 1973
188 Decision theoretic planning: Structural assumptions and comp.. - Boutilier, Dean et al. - 2000
147 The computational complexity of propositional STRIPS plannin.. - Bylander - 1994
146 An algorithm for probabilistic planning - Kushmerick, Hanks et al. - 1995 ACM DBLP
140 Probabilistic planning with information gathering and contin.. - Draper, Hanks et al. - 1994 DBLP
106 A survey of partially observable Markov decision processes: .. (context) - Monahan - 1982
96 The complexity of Markov decision processes (context) - Papadimitriou, Tsitsiklis - 1987
87 Arthur-merlin games: a randomized proof system (context) - Moran, Babai - 1988
73 Introduction to Probabilistic Automata (context) - Paz - 1971
64 Algorithms for Sequential Decision Making - Littman - 1996 ACM
59 the complexity of solving Markov decision problems - Littman, Dean et al. - 1995
53 Probabilistic propositional planning: Representations and co.. - Littman - 1997 DBLP
52 Information and Control (context) - Rabin - 1963
47 A survey of computational complexity results in systems and .. - Blondel, Tsitsiklis - 2000
46 The computational complexity of probabilistic planning - Littman, Goldsmith et al. - 1998
45 Decision problems for semi-thue systems with a few rules - Matiyasevich, Senizergues - 1996 ACM DBLP
35 Exact and Approximate Algorithms for Partially Observable Ma.. (context) - Cassandra - 1998 ACM
32 A survey of algorithmic methods for partially observable Mar.. (context) - Lovejoy - 1991
28 Finite Memory Control of Partially Observable Systems (context) - Hansen - 1998
26 the complexity of space bounded interactive proofs (context) - Condon, Lipton - 1989
26 Markov Decision Processes (context) - White - 1993
23 Probabilistic two way machines (context) - Freivalds - 1981
19 the complexity of partially observed Markov decision process.. - Burago, De Rougemont et al. - 1996
18 Observation of a Markov Process Through a Noisy Channel (context) - Drake - 1962
15 Optimal control of Markov processes with incomplete state in.. (context) - Astrom - 1965
13 A subexponential randomized algorithm for the simple stochas.. (context) - Ludwig - 1995 ACM DBLP
11 Learning nite-state controllers for partially observable env.. (context) - Meuleau, Peshkin et al. - 1999
10 Complexity issues in Markov decision processes - Goldsmith, Mundhenk - 1998 ACM DBLP
8 Distinguishing tests for nondeterministic and probabilistic .. - Alur, Couroubetis et al. - 1995
5 horizon stationary Markov decision process in time proportio.. (context) - Tseng - 1990
5 The complexity of simple stochastic games (context) - Condon - 1992
5 Nonapproximability results for partially observable Markov d.. - Lusena, Goldsmith et al. - 2001
5 Some recursively unsolvable problems relating to isolated cu.. (context) - Bertoni, Mauri et al. - 1977
3 Optimal control of partially observable Markovian systems (context) - Aoki - 1965
3 Complexity results for nite-horizon Markov decision processs.. (context) - Mundhenk, Goldsmith et al. - 2000
3 Lectures on classical and probabilistic automata (context) - Rabin - 1966
2 The complexity of policy evaluation for nite-horizon partial.. (context) - Mundhenk, Goldsmith et al. - 1997
2 the computability of in nitehorizon partially observable Mar.. (context) - Madani, Hanks et al. - 1999
2 Complexity of probabilistic planning under average rewards - Rintanen - 2001 DBLP
1 Approximate solutions to factored Markov decision processes .. - Dean, Kim et al. - 2000
1 The solution to problems relative to probabilistic automata .. (context) - Bertoni - 1975
1 Undecidable problems for probabilistic nite automata of xed .. (context) - Blondel, Canterini - 2001
1 Complexity Results for In nite-Horizon Markov Decision Proce.. (context) - Madani - 2000
Documents on the same site (http://www.cs.ualberta.ca/~madani/research.html): More
Polynomial Value Iteration Algorithms for Deterministic MDPs - Madani (2002) (Correct)
On Policy Iteration as a Newton's Method and Polynomial.. - Algorithms Omid Madani (Correct)
Complexity results for Infinite-Horizon Markov Decision Processes - Madani (2000) (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