A Generic Domain Pruning Technique for GDL Based DCOP Algorithms in Cooperative Multi Agent Systems
Generalized Distributive Law (GDL) based message passing algorithms, such as Max Sum and Bounded Max Sum, are often used to solve distributed constraint optimization problems in cooperative multi agent systems (MAS) However, scalability becomes a challenge when these algorithms have to deal with constraint functions with high arity or variables with a large domain size. In either case, the ensuing exponential growth of search space can make such algorithms computationally infeasible in practice. To address this issue, we develop a generic domain pruning technique that enables these algorithms to be effectively applied to larger and more complex problems. We theoretically prove that the pruned search space obtained by our approach does not affect the outcome of the algorithms. Moreover, our empirical evaluation illustrates a significant reduction of the search space, ranging from 33% to 81% without affecting the solution quality of the algorithms, compared to the state of the art.
AAMAS