暂无分享,去创建一个
Shlomo Zilberstein | Eric A. Hansen | Christopher Amato | Daniel S. Bernstein | S. Zilberstein | E. Hansen | D. Bernstein | Chris Amato
[1] Reid G. Simmons,et al. Point-Based POMDP Algorithms: Improved Analysis and Implementation , 2005, UAI.
[2] Kee-Eung Kim,et al. Learning to Cooperate via Policy Search , 2000, UAI.
[3] Stephen S. Lee,et al. Planning with Partially Observable Markov Decision Processes: Advances in Exact Solution Method , 1998, UAI.
[4] Shlomo Zilberstein,et al. Improved Memory-Bounded Dynamic Programming for Decentralized POMDPs , 2007, UAI.
[5] Weihong Zhang,et al. Speeding Up the Convergence of Value Iteration in Partially Observable Markov Decision Processes , 2011, J. Artif. Intell. Res..
[6] Karl Johan Åström,et al. Optimal control of Markov processes with incomplete state information , 1965 .
[7] Leslie Pack Kaelbling,et al. Learning Policies for Partially Observable Environments: Scaling Up , 1997, ICML.
[8] Makoto Yokoo,et al. Networked Distributed POMDPs: A Synergy of Distributed Constraint Optimization and POMDPs , 2005, IJCAI.
[9] Shlomo Zilberstein,et al. Efficient Maximization in Solving POMDPs , 2005, AAAI.
[10] Shlomo Zilberstein,et al. Dynamic Programming for Partially Observable Stochastic Games , 2004, AAAI.
[11] Craig Boutilier,et al. Bounded Finite State Controllers , 2003, NIPS.
[12] Eric A. Hansen,et al. Solving POMDPs by Searching in Policy Space , 1998, UAI.
[13] Leslie Pack Kaelbling,et al. Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..
[14] Blai Bonet,et al. Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.
[15] David Anthony Parker,et al. Implementation of symbolic model checking for probabilistic systems , 2003 .
[16] R. Aumann. Subjectivity and Correlation in Randomized Strategies , 1974 .
[17] Shlomo Zilberstein,et al. Region-Based Incremental Pruning for POMDPs , 2004, UAI.
[18] Edward J. Sondik,et al. The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs , 1978, Oper. Res..
[19] Michael I. Jordan,et al. Learning Without State-Estimation in Partially Observable Markovian Decision Processes , 1994, ICML.
[20] Reid G. Simmons,et al. Probabilistic Robot Navigation in Partially Observable Environments , 1995, IJCAI.
[21] Neil Immerman,et al. The Complexity of Decentralized Control of Markov Decision Processes , 2000, UAI.
[22] Shlomo Zilberstein,et al. Finite-memory control of partially observable systems , 1998 .
[23] C. White,et al. Applications of best-first heuristic search to finite-horizon partially observed markov decision processes , 1990 .
[24] David R. Thompson,et al. Generating Exponentially Smaller POMDP Models Using Conditionally Irrelevant Variable Abstraction , 2007, ICAPS.
[25] Jeff G. Schneider,et al. Approximate solutions for partially observable stochastic games with common payoffs , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..
[26] François Charpillet,et al. An Optimal Best-First Search Algorithm for Solving Infinite Horizon DEC-POMDPs , 2005, ECML.
[27] Michael L. Littman,et al. Incremental Pruning: A Simple, Fast, Exact Method for Partially Observable Markov Decision Processes , 1997, UAI.
[28] Shlomo Zilberstein,et al. Optimizing Memory-Bounded Controllers for Decentralized POMDPs , 2007, UAI.
[29] N. Zhang,et al. Algorithms for partially observable markov decision processes , 2001 .
[30] Satinder Singh,et al. Learning to Solve Markovian Decision Processes , 1993 .
[31] Makoto Yokoo,et al. Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings , 2003, IJCAI.
[32] Edward J. Sondik,et al. The Optimal Control of Partially Observable Markov Processes over a Finite Horizon , 1973, Oper. Res..
[33] Joelle Pineau,et al. Point-based value iteration: An anytime algorithm for POMDPs , 2003, IJCAI.
[34] Daphne Koller,et al. Multi-Agent Influence Diagrams for Representing and Solving Games , 2001, IJCAI.
[35] Shlomo Zilberstein,et al. Bounded Policy Iteration for Decentralized POMDPs , 2005, IJCAI.
[36] François Charpillet,et al. Point-based Dynamic Programming for DEC-POMDPs , 2006, AAAI.
[37] Shlomo Zilberstein,et al. Memory-Bounded Dynamic Programming for DEC-POMDPs , 2007, IJCAI.
[38] Pierfrancesco La Mura. Game Networks , 2000, UAI.
[39] R. Simmons,et al. Probabilistic Navigation in Partially Observable Environments , 1995 .
[40] H. Witsenhausen. Separation of estimation and control for discrete time systems , 1971 .
[41] François Charpillet,et al. MAA*: A Heuristic Search Algorithm for Solving Decentralized POMDPs , 2005, UAI.
[42] Hui Li,et al. Point-Based Policy Iteration , 2007, AAAI.