Linear Support for Multi−Objective Coordination Graphs
Diederik Roijers‚ Shimon Whiteson and Frans Oliehoek
Many real-world decision problems require making trade-offs among multiple objectives. However, in some cases, the relative importance of these objectives is not known when the problem is solved, precluding the use of single-objective methods. Instead, multi-objective methods, which compute the set of all potentially useful solutions, are required. This paper proposes variable elimination linear support (VELS), a new multi-objective algorithm for multi-agent coordination that exploits loose couplings to compute the convex coverage set (CCS): the set of optimal solutions for all possible weights for linearly weighted objectives. Unlike existing methods, VELS exploits insights from POMDP solution methods to build the CCS incrementally. We prove the correctness of VELS and show that for moderate numbers of objectives its complexity is better than that of previous methods. Furthermore, we present empirical results showing that VELS can tackle both random and realistic problems with many more agents than was previously feasible. The incremental nature of VELS also makes it an anytime algorithm, i.e., its intermediate results constitute epsilon-optimal approximations of the CCS, with epsilon decreasing the longer it runs. Our empirical results show that, by allowing even very small ε, VELS can enable large additional speedups.