@inproceedings{a58a96b1c3044acdba162e789aafa751,
title = "BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm",
abstract = "Distributed constraint optimization (DCOP) problems are a popular way of formulating and solving agent-coordination problems. It is often desirable to solve DCOP problems optimally with memory-bounded and asynchronous algorithms. We introduce Branch-and-Bound ADOPT (BnB-ADOPT), a memory-bounded asynchronous DCOP algorithm that uses the message passing and communication framework of ADOPT, a well known memory-bounded asynchronous DCOP algorithm, but changes the search strategy of ADOPT from best-first search to depth-first braneh-and-bound search. Our experimental results show that BnB-ADOPT is up to one order of magnitude faster than ADOPT on a variety of large DCOP problems and faster than NCBB, a memory-bounded synchronous DCOP algorithm, on most of these DCOP problems.",
keywords = "Agent cooperation, Distributed problem solving",
author = "William Yeoh and Ariel Feiner and Sven Koenig",
year = "2008",
month = jan,
day = "1",
language = "English",
isbn = "9781605604701",
series = "Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS",
publisher = "International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)",
pages = "582--589",
booktitle = "7th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2008",
note = "7th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2008 ; Conference date: 12-05-2008 Through 16-05-2008",
}