Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

  • Authors:
  • Rajiv T. Maheswaran;Milind Tambe;Emma Bowring;Jonathan P. Pearce;Pradeep Varakantham

  • Affiliations:
  • University of Southern California;University of Southern California;University of Southern California;University of Southern California;University of Southern California

  • Venue:
  • AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
  • Year:
  • 2004

Quantified Score

Hi-index 0.01

Visualization

Abstract

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.