Planning and acting in partially observable stochastic domains

This publication has 17 references indexed in Scilit:

• The complexity of mean payoff games on graphs
  Theoretical Computer Science, 1996
• An algorithm for probabilistic planning
  Artificial Intelligence, 1995
• Planning under time constraints in stochastic domains
  Artificial Intelligence, 1995
• The complexity of stochastic games
  Information and Computation, 1992
• A survey of algorithmic methods for partially observed Markov decision processes
  Annals of Operations Research, 1991
• On the average cost optimality equation and the structure of optimal policies for partially observable Markov decision processes
  Annals 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 Algorithms
  Management Science, 1982
• Application of Jensen's inequality to adaptive suboptimal design
  Journal of Optimization Theory and Applications, 1980
• Optimal control of Markov processes with incomplete state information
  Journal of Mathematical Analysis and Applications, 1965