Conference Proceeding Article
Distributed constraint optimization (DCOP) is an important framework for coordinated multiagent decision making. We address a practically useful variant of DCOP, called resource-constrained DCOP (RC-DCOP), which takes into account agents’ consumption of shared limited resources. We present a promising new class of algorithm for RC-DCOPs by translating the underlying co- ordination problem to probabilistic inference. Using inference techniques such as expectation- maximization and convex optimization machinery, we develop a novel convergent message-passing algorithm for RC-DCOPs. Experiments on standard benchmarks show that our approach provides better quality than previous best DCOP algorithms and has much lower failure rate. Comparisons against an efficient centralized solver show that our approach provides near-optimal solutions, and is significantly faster on larger instances.
Databases and Information Systems
Intelligent Systems and Decision Analytics
Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)
City or Country
Buenos Aires, Argentina
SUPRIYO GHOSH, Akshat KUMAR, and Pradeep VARAKANTHAM.
Probabilistic Inference Based Message-Passing for Resource Constrained DCOPs. (2015). Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). 411-417. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/3155
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.