Planning and acting in partially observable stochastic domains

Planning and acting in partially observable stochastic domains (1998)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Leslie Pack Kaelbling , Michael L. Littman , Anthony R. Cassandra

Venue:	ARTIFICIAL INTELLIGENCE
Citations:	822 - 31 self

BibTeX

@ARTICLE{Kaelbling98planningand,
    author = {Leslie Pack Kaelbling and Michael L. Littman and Anthony R. Cassandra},
    title = {Planning and acting in partially observable stochastic domains},
    journal = {ARTIFICIAL INTELLIGENCE},
    year = {1998},
    volume = {101},
    pages = {99--134}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

In this paper, we bring techniques from operations research to bear on the problem of choosing optimal actions in partially observable stochastic domains. We begin by introducing the theory of Markov decision processes (mdps) and partially observable mdps (pomdps). We then outline a novel algorithm for solving pomdps offline and show how, in some cases, a finite-memory controller can be extracted from the solution to a pomdp. We conclude with a discussion of how our approach relates to previous work, the complexity of finding exact solutions to pomdps, and of some possibilities for finding approximate solutions.

Citations

4248	A tutorial on hidden markov models and selected applications in speech recognition, in: Readings in speech recognition - Rabiner - 1990
2851	Genetic Programming: On the Programming of Computers by Means of Natural Selection - Koza - 1992
2077	A new approach to linear filtering and prediction problems - Kalman - 1960
1463	Theory of Linear and Integer Programming - Schrijver - 1986
958	Fast planning through planning graph analysis - Blum, Furst - 1997
580	Markov decision processes - Puterman - 2005
513	Dynamic Programming and Markov Processes - Howard - 1960
453	Dynamic Programming and Optimal Control. Athena Scientific - Bertsekas - 1995
412	UCPOP: A sound, complete, partial order planner for ADL - Penberthy, Weld - 1992
386	Systematic nonlinear planning - Mcallester, Rosenblitt - 1991
334	The optimal control of partially observable markov processes over the infinite horizon: Discounted costs - Sondik - 1978
324	Universal Plans for Reactive Robots in Unpredictable Environments - Schoppers - 1987
317	A formal theory of knowledge and action - Moore - 1985
292	The optimal control of partially observable markov processes over a finite horizon - Smallwood, Sondik - 1971
274	Acting optimally in partially observable stochastic domains - Cassandra, Kaelbling, et al. - 1994
258	An algorithm for probabilistic planning - Kushmerick, Hanks, et al. - 1995
234	Learning policies for partially observable environments: Scaling up - Littman, Cassandra, et al. - 1995
211	Conditional nonlinear planning - Peot, Smith - 1992
200	Probabilistic planning with information gathering and contingent execution - Draper, Hanks, et al. - 1994
193	Reinforcement learning with perceptual aliasing: The perceptual distinctions approach - Chrisman - 1992
191	A survey of partially observable Markov decision processes: Theory, models, and algorithms - Monahan - 1982
175	Algorithms for Sequential Decision Making - Littman - 1996
175	A survey of algorithmic methods for partially observable Markov decision processes - Lovejoy - 1991
162	Planning under time constraints in stochastic domains - Dean, Kaelbling, et al. - 1995
157	Incremental pruning: A simple, fast, exact method for partially observable Markov decision processes - Cassandra, Littman, et al. - 1997
153	The complexity of stochastic games - Condon - 1992
136	Exact and Approximate Algorithms for Partially Observable Markov Decision Processes - Cassandra - 1998
135	Hidden Markov model induction by Bayesian model merging - Stolcke, Omohundro
134	Information value theory - Howard - 1996
121	Optimal control of markov decision processes with incomplete state estimation - Ästrom - 1965
119	Theory of Linear and - Schrijver - 1998
112	Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations - Boutilier, Poole - 1996
107	Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction - Drummond, Bresina - 1990
106	Overcoming incomplete perception with utile distinction memory - McCallum - 1993
99	Planning for contingences: a decision-based approach - Pryor, Collins - 1996
95	Utility models for goal-directed, decision-theoretic planners - Haddawy, Hanks - 1998
95	Markov Decision Processes—Discrete Stochastic Dynamic Programming - Puterman - 1994
95	The complexity of mean payoff games on graphs - Zwick, Paterson - 1996
94	The frame problem and knowledgeproducing actions - Scherl, Levesque - 1993
93	Memoryless policies: Theoretical limitations and practical results - Littman - 1994
90	Instance-based utile distinctions for reinforcement learning with hidden state - McCallum - 1995
84	Dynamic Programming and Optimal Control, Vol - Bertsekas - 2001
83	Tight performance bounds on greedy policies based on imperfect value functions - Williams, Baird - 1994
75	Algorithms for Partially Observable Markov Decision Processes - Cheng - 1988
71	MAXPLAN: A new approach to probabilistic planning - Majercik, Littman - 1998
64	Knowledge preconditions for actions and plans - Morgenstern - 1987
52	Planning with external events - Blythe - 1994
44	1960)A new approach to linear ®ltering and prediction problems - Kalman
44	The witness algorithm: Solving partially observable markov decision processes - Littman
36	Control strategies for a stochastic planner - Tash, Russell - 1994