Planning and acting in partially observable stochastic domains
- 1 May 1998
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 101 (1-2), 99-134
- https://doi.org/10.1016/s0004-3702(98)00023-x
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The complexity of mean payoff games on graphsTheoretical Computer Science, 1996
- An algorithm for probabilistic planningArtificial Intelligence, 1995
- Planning under time constraints in stochastic domainsArtificial Intelligence, 1995
- The complexity of stochastic gamesInformation and Computation, 1992
- A survey of algorithmic methods for partially observed Markov decision processesAnnals of Operations Research, 1991
- On the average cost optimality equation and the structure of optimal policies for partially observable Markov decision processesAnnals of Operations Research, 1991
- Solving H-horizon, stationary Markov decision problems in time proportional to log(H)Operations Research Letters, 1990
- State of the Art—A Survey of Partially Observable Markov Decision Processes: Theory, Models, and AlgorithmsManagement Science, 1982
- Application of Jensen's inequality to adaptive suboptimal designJournal of Optimization Theory and Applications, 1980
- Optimal control of Markov processes with incomplete state informationJournal of Mathematical Analysis and Applications, 1965