A Point-Based Approximate Algorithm for One-Sided Partially Observable Pursuit-Evasion Games
暂无分享,去创建一个
[1] L. Shapley,et al. Stochastic Games* , 1953, Proceedings of the National Academy of Sciences.
[2] M. K. Ghosh,et al. Zero-Sum Stochastic Games with Partial Information , 2004 .
[3] Branislav Bosanský,et al. Dynamic Programming for One-sided Partially Observable Pursuit-evasion Games , 2017, ICAART.
[4] Joelle Pineau,et al. Point-based value iteration: An anytime algorithm for POMDPs , 2003, IJCAI.
[5] Michael H. Bowling,et al. Online Monte Carlo Counterfactual Regret Minimization for Search in Imperfect Information Games , 2015, AAMAS.
[6] S. Shankar Sastry,et al. Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation , 2002, IEEE Trans. Robotics Autom..
[7] Reid G. Simmons,et al. Point-Based POMDP Algorithms: Improved Analysis and Implementation , 2005, UAI.
[8] Geoffrey A. Hollinger,et al. Search and pursuit-evasion in mobile robotics , 2011, Auton. Robots.
[9] Reid G. Simmons,et al. Heuristic Search Value Iteration for POMDPs , 2004, UAI.