
## References

Astrom, K. J. (1965). Optimal control of Markov decision processes with incomplete state estimation. Journal of Mathematical Analysis and Applications, 10, 174-205.

Baird, L. C. (1995). Residual algorithms: Reinforcement learning with function approximation. In Proceedings of the Twelfth International Conference on Machine Learning,

p. 30-37.
Barto, A. G., Bradtke, S. J., & Singh, S. P. (1995). Learning to act using real-time dynamic programming. Artificial Intelligence, 72, 81-138.

Bellman, R. E. (1957). Dynamic programming. Princeton University Press, Princeton, NJ.

Bertsekas, D. P. (1994). A counter-example to temporal differences learning. Neural Computation, 7, 270-279.

Bertsekas, D. P. (1995). Dynamic programming and optimal control. Athena Scientific.

Bonet, B., & Geffner, H. (1998).  Learning sorting and classification with POMDPs.  In Proceedings of the Fifteenth International Conference on Machine Learning.

Boutilier, C., Dean, T., & Hanks, S. (1999). Decision-theoretic planning: Structural assumptions and computational leverage. Artificial Intelligence, 11, 1–94.

Boutilier, C., & Poole, D. (1996). Exploiting structure in policy construction. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 1168–1175.

Boyan, J. A., & Moore, A. A. (1995).  Generalization in reinforcement learning:  safely approximating the value function. In Advances in Neural Information Processing Systems 7. MIT Press.

Boyen, X., & Koller, D. (1998). Tractable inference for complex stochastic processes. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, pp.

3-42.

Boyen, X., & Koller, D. (1999). Exploiting the architecture of dynamic systems. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pp. 313-320.

Brafman, R. I. (1997). A heuristic variable grid solution method for POMDPs. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 727–233.

Burago, D., Rougemont, M. D., & Slissenko, A. (1996).  On the complexity of partially observed Markov decision processes. Theoretical Computer Science, 157, 161–183.

Cassandra, A. R. (1998). Exact and approximate algorithms for partially observable Markov decision processes. Ph.D. thesis, Brown University, Cassandra, A. R., Littman, M. L., & Zhang, N. L. (1997). Incremental pruning: a simple, fast, exact algorithm for partially observable Markov decision processes. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, pp. 54–61.