Sciweavers

Share
AIPS
2007

Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps

8 years 10 months ago
Mixed Integer Linear Programming for Exact Finite-Horizon Planning in Decentralized Pomdps
We consider the problem of finding an n-agent jointpolicy for the optimal finite-horizon control of a decentralized Pomdp (Dec-Pomdp). This is a problem of very high complexity (NEXP-hard in n ≥ 2). In this paper, we propose a new mathematical programming approach for the problem. Our approach is based on two ideas: First, we represent each agent’s policy in the sequence-form and not in the tree-form, thereby obtaining a very compact representation of the set of joint-policies. Second, using this compact representation, we solve this problem as an instance of combinatorial optimization for which we formulate a mixed integer linear program (MILP). The optimal solution of the MILP directly yields an optimal joint-policy for the Dec-Pomdp. Computational experience shows that formulating and solving the MILP requires significantly less time to solve benchmark Dec-Pomdp problems than existing algorithms. For example, the multi-agent tiger problem for horizon 4 is solved in 72 secs w...
Raghav Aras, Alain Dutech, François Charpil
Added 02 Oct 2010
Updated 02 Oct 2010
Type Conference
Year 2007
Where AIPS
Authors Raghav Aras, Alain Dutech, François Charpillet
Comments (0)
books