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:	737 - 28 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

3946	A tutorial on hidden Markov models and selected applications in speech recognition - Rabiner - 1989
2742	Genetic Programming: On the Programming of Computers by Means of Natural Selection - Koza - 1992
1841	A new approach to linear filtering and prediction problems - Kalman - 1960
1375	Theory of Linear and Integer Programming - Schrijver - 1998
936	Fast planning through planning graph analysis - Blum, Furst - 1995
556	Markov Decision Processes - Puterman - 1994
481	Dynamic Programming and Markov Processes - Howard - 1960
409	Dynamic Programming and Optimal Control. Athena Scientific - Bertsekas - 1995
406	UCPOP: A sound, complete, partial order planner for ADL - Penberthy, Weld - 1992
382	Systematic nonlinear planning - McAllester, Rosenblitt - 1991
317	Universal plans for reactive robots in unpredictable environments - Schoppers - 1987
316	The Optimal Control of Partially Observable Markov Decision Processes - Sondik - 1971
312	A Formal Theory of Knowledge and Action - Moore - 1985
273	The Optimal Control of Partially Observable Markov Processes over a Finite Horizon - Smallwood, Sondik - 1973
262	Acting optimally in partially observable stochastic domains - Cassandra, Kaelbling, et al. - 1994
255	An algorithm for probabilistic planning - Kushmerick, Hanks, et al. - 1995
222	Learning policies for partially observable environments: Scaling up - Littman, Cassandra, et al. - 1995
208	Conditional nonlinear planning - Peot, Smith - 1992
199	Probabilistic planning with information gathering and contingent execution - Draper, Hanks, et al. - 1994
189	Reinforcement Learning with Perceptual Aliasing: the perceptual distinctions approach - Chrisman - 1992
180	A survey of partially observable markov decision processes: Theory, models, and algorithms - Monahan - 1982
171	Algorithms for sequential decision making - Littman - 1996
168	A survey of algorithmic methods for partially observed markov decision processes - Lovejoy - 1991
162	Planning under time constraints in stochastic domains - Dean, Kaelbling, et al. - 1995
151	Incremental pruning: A simple, fast, exact method for partially observable Markov decision processes - CASSANDRA, LITTMAN, et al. - 1997
142	The complexity of stochastic games - Condon - 1992
133	Hidden Markov Model induction by Bayesian model merging - Stolcke, Omohundro - 1993
132	Exact and Approximate Algorithms for Partially Observable Markov Decision Processes - Cassandra - 1998
128	Information value theory - Howard
116	Theory of Linear and - Schrijver - 1986
110	Optimal Control of Markov Decision Processes with Incomplete State Estimation - Astrom - 1965
106	Anytime synthetic projection: Maximizing the probability of goal satisfaction - Drummond, Bresina - 1990
104	Overcoming incomplete perception with utile distinction memory - McCallum - 1993
101	Computing optimal policies for partially observable decision processes using compact representations - Boutilier, Poole - 1996
97	Planning for contingencies: A decision-based approach - Pryor, Collins - 1996
94	The frame problem and knowledge-producing actions - Scherl, Levesque - 1993
93	Utility models for goal-directed, decision-theoretic planners - Haddawy, Hanks - 1998
93	Memoryless Policies: Theoretical Limitations and Practical Results - Littman - 1994
89	Instance-based utile distinctions for reinforcement learning with hidden state - McCallum - 1995
85	Markov Decision Processes—Discrete Stochastic Dynamic Programming - Puterman - 1994
79	The complexity of mean payoff games on graphs - Zwick, Paterson - 1996
79	Dynamic Programming and Optimal Control Vol - Bertsekas
75	Tight performance bounds on greedy policies based on imperfect value functions - Williams, Baird - 1993
71	Algorithms for Partially Observable Markov Decision Processes - Cheng - 1988
68	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	The witness algorithm: Solving partially observable markov decision processes - Littman
39	A new approach to linear …ltering and prediction problems - Kalman - 1960
36	Control strategies for a stochastic planner - Tash, Russell - 1994