• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Planning and acting in partially observable stochastic domains (1998)

Cached

  • Download as a PDF

Download Links

  • [www.cis.upenn.edu]
  • [www.cs.tufts.edu]
  • [ftp.cs.brown.edu]
  • [www.cs.duke.edu]
  • [www.cis.upenn.edu]
  • [www.cs.duke.edu]
  • [www.cs.brown.edu]
  • [msl.cs.uiuc.edu]
  • [www.cs.ubc.ca]
  • [www.ai.mit.edu]
  • [csail.mit.edu]
  • [people.csail.mit.edu]
  • [staff.science.uva.nl]
  • [www.cs.rutgers.edu]
  • [classes.engr.oregonstate.edu]
  • [elite.polito.it]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Leslie Pack Kaelbling , Michael L. Littman , Anthony R. Cassandra
Venue:ARTIFICIAL INTELLIGENCE
Citations:629 - 24 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

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

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

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

3116 A tutorial on hidden Markov models and selected applications in speech recognition - Rabiner - 1989
2458 Genetic Programming: On the Programming of Computers by Means of Natural Selection - Koza - 1992
1446 A new approach to linear filtering and prediction problems - Kalman - 1960
1232 Theory of Linear and Integer Programming - SCHRIJVER - 1986
852 Fast planning through planning graph analysis - Blum, Furst - 1997
498 Markov Decision Processes - Puterman - 1994
434 Dynamic programming and Markov processes - Howard - 1960
381 UCPOP: A sound, complete, partial order planner for ADL - Penberthy, Weld - 1992
358 Systematic nonlinear planning - McAllester, Rosenblitt - 1991
342 Dynamic Programming and Optimal Control, Athena Scientific - Bertsekas - 2000
306 Universal plans for reactive robots in unpredictable environments - Schoppers - 1987
293 A formal theory of knowledge and action - Moore - 1985
285 The Optimal Control of Partially Observable Markov Processes - Sondik - 1971
243 Acting optimally in partially observable stochastic domains - Cassandra, Kaelbling, et al. - 1994
235 An algorithm for probabilistic planning - Kushmerick, Hanks, et al. - 1995
235 The optimal control of partially observable Markov processes over a finite horizon - Smallwood, Sondik - 1973
202 Learning policies for partially observable environments: Scaling up - Littman, Cassandra, et al.
202 Conditional Nonlinear Planning - Peot, Smith - 1992
192 Probabilistic planning with information gathering and contingent execution - Draper, Hanks, et al. - 1994
173 Reinforcement learning with perceptual aliasing: The perceptual distinctions approach - Chrisman - 1992
165 Survey of partially observable markov decision processes: Theory, models, and algorithms - Monahan - 1982
158 Algorithms for sequential decision making - Littman - 1996
151 A survey of algorithmic methods for partially observed Markov decision processes - Lovejoy - 1991
150 Planning under time constraints in stochastic domains - DEAN, KAELBLING, et al.
144 Incremental pruning: a simple, fast, exact method for partially observable Markov decision processes - Cassandra, Littman, et al. - 1997
126 The complexity of stochastic games - Condon - 1992
124 Hidden Markov Model Induction by Bayesian Model Merging - Stolcke, Omohundro - 1993
113 Theory of Linear and - Schrijver - 1986
111 Exact and approximate algorithms for partially observable Markov decision processes - Cassandra - 1998
109 Information value theory - Howard - 1966
101 Anytime synthetic projection: Maximizing the probability of goal satisfaction - Drummond, Bresina
99 Optimal control of Markov decision processes with incomplete state estimation - Astrom - 1965
96 Overcoming incomplete perception with utile distinction memory - McCallum - 1993
94 Computing optimal policies for partially observable decision processes using compact representations - Boutilier, Poole - 1996
88 Utility models for goal-directed decisiontheoretic planners - Haddawy, Hanks - 1998
88 Memoryless policies: Theoretical limitations and practical results. In From Animals to Animats 3 - Littman - 1994
88 Planning for contingencies: A decisionbased approach - Pryor, Collins - 1996
84 Instance-based utile distinctions for reinforcement learning with hidden state - McCallum - 1995
83 The frame problem and knowledge-producing actions - Scherl, Levesque - 1993
72 Tight performance bounds on greedy policies based on imperfect value functions - Williams, Baird - 1994
69 Algorithms for partially observable Markov decision processes. Doctoral dissertation - Cheng - 1988
69 Dynamic Programming and Optimal Control, vols - Bertsekas - 1995
68 Markov Decision Processes-Discrete Stochastic Dynamic Programming - Puterman - 1994
68 The complexity of mean payoff games on graphs - Zwick, Paterson - 1996
63 MAXPLAN: A new approach to probabilistic planning - Majercik, Littman - 1998
62 Knowledge preconditions for actions and plans - Morgenstern - 1987
51 Planning with external events - Blythe - 1994
41 The witness algorithm: Solving partially observable markov decision processes. Brown university department of computer science technical report - Littman - 1994
35 Conditional linear planning - Goldman, Boddy - 1994
34 Control strategies for a stochastic planner - Tash, Russell - 1994
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University