Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling

Distributed Constraint Optimization (DCOP) is an elegant formalism relevant to many areas in multiagent systems, yet complete algorithms have not been pursued for real world applications due to perceived complexity. To capably capture a rich class of complex problem domains, we introduce the Distributed Multi-Event Scheduling (DiMES) framework and design congruent DCOP formulations with binary constraints which are proven to yield the optimal solution. To approach real-world efficiency requirements, we obtain immense speedups by improving communication structure and precomputing best case bounds. Heuristics for generating better communication structures and calculating bound in a distributed manner are provided and tested on systematically developed domains for meeting scheduling and sensor networks, exemplifying the viability of complete algorithms.

[1]  Boi Faltings,et al.  ABT with Asynchronous Reordering , 2001 .

[2]  S. Haldar,et al.  An 'All Pairs Shortest Path' Distributed Algorithm Using 2n² Messages , 1993, WG.

[3]  Milind Tambe,et al.  Distributed Sensor Networks: A Multiagent Perspective , 2003 .

[4]  Norman M. Sadeh,et al.  Variable and Value Ordering Heuristics for the Job Shop Scheduling Constraint Satisfaction Problem , 1996, Artif. Intell..

[5]  Francesca Rossi,et al.  Multi-agent meeting scheduling with preferences: efficiency, privacy loss, and solution quality , 2002 .

[6]  Edmund H. Durfee,et al.  A formal study of distributed meeting scheduling: preliminary results , 1991, COCS '91.

[7]  Weixiong Zhang,et al.  Distributed breakout revisited , 2002, AAAI/IAAI.

[8]  Michel Lemaître,et al.  An Incomplete Method for Solving Distributed Valued Constraint Satisfaction Problems , 1997 .

[9]  Makoto Yokoo,et al.  An asynchronous complete method for distributed constraint optimization , 2003, AAMAS '03.

[10]  Milind Tambe,et al.  Distributed Sensor Networks: Introduction to a Multiagent Perspective , 2003 .

[11]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[12]  Wei-Min Shen,et al.  A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation , 2001, CP.

[13]  Milind Tambe,et al.  Towards Adjustable Autonomy for the Real World , 2002, J. Artif. Intell. Res..

[14]  Katia Sycara,et al.  Multiagent coordination in tightly coupled task scheduling , 1997 .

[15]  Stuart C. Shapiro,et al.  Encyclopedia of artificial intelligence, vols. 1 and 2 (2nd ed.) , 1992 .