Preprocessing techniques for accelerating the DCOP algorithm ADOPT

Methods for solving Distributed Constraint Optimization Problems (DCOP) have emerged as key techniques for distributed reasoning. Yet, their application faces significant hurdles in many multiagent domains due to their inefficiency. Preprocessing techniques have successfully been used to speed up algorithms for centralized constraint satisfaction problems. This paper introduces a framework of different preprocessing techniques that are based on dynamic programming and speed up ADOPT, an asynchronous complete and optimal DCOP algorithm. We investigate when preprocessing is useful and which factors influence the resulting speedups in two DCOP domains, namely graph coloring and distributed sensor networks. Our experimental results demonstrate that our preprocessing techniques are fast and can speed up ADOPT by an order of magnitude. Categories and Subject Descriptors I.2.8 [Artificial Intelligence]: Distributed Artificial Intelligence—Multiagent Systems General Terms Algorithms Key...

• Type: Conference
• Year: 2005
• Where: ATAL
• Authors: Syed Muhammad Ali, Sven Koenig, Milind Tambe
• Keywords: ATAL 2005, Constraint Optimization Problems, Distributed Constraint Optimization, Preprocessing