Optimizing Memory-Bounded Controllers for Decentralized POMDPs
arXiv:1206.5258
Abstract
We present a memory-bounded optimization approach for solving infinite-horizon decentralized POMDPs. Policies for each agent are represented by stochastic finite state controllers. We formulate the problem of optimizing these policies as a nonlinear program, leveraging powerful existing nonlinear optimization techniques for solving the problem. While existing solvers only guarantee locally optimal solutions, we show that our formulation produces higher quality controllers than the state-of-the-art approach. We also incorporate a shared source of randomness in the form of a correlation device to further increase solution quality with only a limited increase in space and time. Our experimental results show that nonlinear optimization can be used to provide high quality, concise solutions to decentralized decision problems under uncertainty.
Appears in Proceedings of the Twenty-Third Conference on Uncertainty in Artificial Intelligence (UAI2007)
References in corpus (1)
Cited by in corpus (6)
- Policy Iteration for Decentralized Control of Markov Decision Processes
- Incremental Clustering and Expansion for Faster Optimal Planning in Dec-POMDPs
- An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
- Memory-Limited Partially Observable Stochastic Control and its Mean-Field Control Approach
- Reinforcement Learning for Heterogeneous Teams with PALO Bounds
- Mean-Field Control Approach to Decentralized Stochastic Control with Finite-Dimensional Memories