Conference Proceeding Article
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.
Artificial Intelligence and Robotics | Business | Operations Research, Systems Engineering and Industrial Engineering
Intelligent Systems and Decision Analytics
AAMAS '04: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems: New York, USA, July 19-23, 2004
IEEE Computer Society
City or Country
Los Alamitos, CA
MAHESWARAN, Rajiv; Tambe, Milind; Bowring, Emma; Pearce, Jonathan; and VARAKANTHAM, Pradeep.
Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Event Scheduling. (2004). AAMAS '04: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems: New York, USA, July 19-23, 2004. 310-317. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/935
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.