Anytime Coordination Using Separable Bilinear Programs
暂无分享,去创建一个
[1] Kristin P. Bennett,et al. Bilinear separation of two sets inn-space , 1993, Comput. Optim. Appl..
[2] 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..
[3] R. Horst,et al. Global Optimization: Deterministic Approaches , 1992 .
[4] Katta G. Murty,et al. Linear complementarity, linear and nonlinear programming , 1988 .
[5] Geoffrey J. Gordon,et al. Point-based approximations for fast POMDP solving , 2006 .
[6] Martin L. Puterman,et al. Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .
[7] Shlomo Zilberstein,et al. Memory-Bounded Dynamic Programming for DEC-POMDPs , 2007, IJCAI.
[8] Jeffrey C. Trinkle,et al. A complementarity approach to a quasistatic multi-rigid-body contact problem , 1996, Comput. Optim. Appl..
[9] Joelle Pineau,et al. Anytime Point-Based Approximations for Large POMDPs , 2006, J. Artif. Intell. Res..
[10] Claudia V. Goldman,et al. Solving Transition Independent Decentralized Markov Decision Processes , 2004, J. Artif. Intell. Res..
[11] Olvi L. Mangasarian,et al. The linear complementarity problem as a separable bilinear program , 1995, J. Glob. Optim..
[12] Marek Petrik,et al. Average-Reward Decentralized Markov Decision Processes , 2007, IJCAI.
[13] William S. Lovejoy,et al. Computationally Feasible Bounds for Partially Observed Markov Decision Processes , 1991, Oper. Res..
[14] Robert J. Vanderbei,et al. Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.
[15] Makoto Yokoo,et al. Exploiting Locality of Interaction in Networked Distributed POMDPs , 2006, AAAI Spring Symposium: Distributed Plan and Schedule Management.
[16] S. Zilberstein,et al. Formal Models and Algorithms for Decentralized Control of Multiple Agents Technical Report UM-CS-2005-068 , 2005 .