The Witness Algorithm: Solving Partially Observable Markov Decision Processes
暂无分享,去创建一个
[1] Alvin W Drake,et al. Observation of a Markov process through a noisy channel , 1962 .
[2] Edward J. Sondik,et al. The optimal control of par-tially observable Markov processes , 1971 .
[3] Edward J. Sondik,et al. The Optimal Control of Partially Observable Markov Processes over a Finite Horizon , 1973, Oper. Res..
[4] Loren K. Platzman,et al. Finite memory estimation and control of finite probabilistic systems , 1977 .
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] James N. Eagle. The Optimal Search for a Moving Target When the Search Path Is Constrained , 1984, Oper. Res..
[7] Dimitri P. Bertsekas,et al. Dynamic Programming: Deterministic and Stochastic Models , 1987 .
[8] Ronald J. Williams,et al. Tight Performance Bounds on Greedy Policies Based on Imperfect Value Functions , 1993 .
[9] Leslie Pack Kaelbling,et al. Acting Optimally in Partially Observable Stochastic Domains , 1994, AAAI.
[10] Anthony R. Cassandra,et al. Optimal Policies for Partially Observable Markov Decision Processes , 1994 .
[11] Ben J. A. Kröse,et al. Learning from delayed rewards , 1995, Robotics Auton. Syst..