Fast Exact Planning in Markov Decision Processes DRAFT — please check for updates before redistributing
暂无分享,去创建一个
[1] C. Atkeson,et al. Prioritized Sweeping: Reinforcement Learning with Less Data and Less Time , 1993, Machine Learning.
[2] David Andre,et al. Generalized Prioritized Sweeping , 1997, NIPS.
[3] Shlomo Zilberstein,et al. LAO*: A heuristic search algorithm that finds solutions with loops , 2001, Artif. Intell..
[4] Blai Bonet,et al. Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback , 2003, IJCAI.
[5] Anshul Gupta,et al. Recent advances in direct methods for solving unsymmetric sparse systems of linear equations , 2002, TOMS.
[6] Leslie Pack Kaelbling,et al. Planning With Deadlines in Stochastic Domains , 1993, AAAI.
[7] Thomas Dean,et al. Decomposition Techniques for Planning in Stochastic Domains , 1995, IJCAI.
[8] Blai Bonet,et al. Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming , 2003, ICAPS.
[9] I. Duff,et al. Direct Methods for Sparse Matrices , 1987 .
[10] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[11] William H. Press,et al. Numerical recipes in C , 2002 .
[12] Marco Wiering,et al. Explorations in efficient reinforcement learning , 1999 .
[13] Richard Barrett,et al. Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods , 1994, Other Titles in Applied Mathematics.
[14] Andrew G. Barto,et al. Learning to Act Using Real-Time Dynamic Programming , 1995, Artif. Intell..
[15] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .