Omid Madani, Steve Hanks  Home/Search
Context Related
| cs.ubc.ca/~condon/papers/jair02.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.ubc.ca/~condon/ (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):
18.2%: On the Undecidability of Probabilistic Planning and.. - Madani, Hanks, al. (1999) (Correct)
11.8%: Complexity results for Infinite-Horizon Markov Decision Processes - Madani (2000) (Correct)
10.2%: On the Undecidability of Probabilistic Planning and.. - Madani, Hanks, Condon (2003) (Correct)
Active bibliography (related documents): More All
0.5: On Policy Iteration as a Newton's Method and Polynomial.. - Algorithms Omid Madani (Correct)
0.5: Genetic Algorithms for Approximating Solutions to POMDPs - Wells, Lusena, Goldsmith (1999) (Correct)
0.5: Complexity of Finite-Horizon Markov Decision Process.. - Mundhenk, Goldsmith.. (2000) (Correct)
Similar documents based on text: More All
0.5: Resume - Madani (Correct)
0.3: Optimal Information Gathering on the Internet with.. - Etzioni, Hanks.. (1996) (Correct)
0.3: Planning Under Uncertainty: Structural Assumptions and.. - Boutilier, Dean, Hanks (1996) (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/article/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/article/madani03undecidability.html" }
Citations (may not include all citations):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
230 Dynamic Programming: Deterministic and Stochastic Models (context) - Bertsekas - 1987
216 The optimal control of partially observable Markov processes.. (context) - Smallwood, Sondik - 1973
216 The optimal control of partially observable Markov processes.. (context) - Sondik - 1978
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
140 Probabilistic planning with information gathering and contin.. - Draper, Hanks et al. - 1994
106 A survey of partially observable Markov decision processes: .. (context) - Monahan - 1982
96 The complexity of Markov decision processes (context) - Papadimitriou, Tsitsiklis - 1987
73 Introduction to Probabilistic Automata (context) - Paz - 1971
64 Algorithms for Sequential Decision Making - Littman - 1996
52 Information and Control (context) - Rabin - 1963
46 The computational complexity of probabilistic planning - Littman, Goldsmith et al. - 1998
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
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
10 Complexity issues in Markov decision processes - Goldsmith, Mundhenk - 1998
8 Distinguishing tests for nondeterministic and probabilistic .. - Alur, Couroubetis et al. - 1995
6 The complexity of policy existence problem for partially-obs.. (context) - Mundhenk, Goldsmith et al. - 1997
5 horizon stationary Markov decision process in time proportio.. (context) - Tseng - 1990
5 The complexity of policy evaluation for finite-horizon parti.. - Mundhenk, Goldsmith et al. - 1997
3 Optimal control of partially observable Markovian systems (context) - Aoki - 1965
2 Complexity results for finite-horizon Markov decision proces.. (context) - Mundhenk, Goldsmith et al. - 2000
2 Complexity Results for Infinite-Horizon Markov Decision Proc.. - Madani - 2000
2 Complexity of probabilistic planning under average rewards - Rintanen - 2001
Documents on the same site (http://www.cs.ubc.ca/~condon/): More
Interactive Proof Systems with Polynomially Bounded Strategies - Condon, Ladner (1992) (Correct)
Random Debaters and the Hardness of Approximating.. - Condon, Feigenbaum.. (1995) (Correct)
On Approximation Algorithms for Hierarchical MAX-SAT - Agarwal, Condon (1997) (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