@inbook{42f745a1427c43bc856dca59ae50cd18,
title = "Asynchronous forward-bounding for distributed constraints optimization",
abstract = "A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchronously. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps one consistent partial assignment at all times. Forward bounding propagates the bounds on the cost of solutions by sending copies of the partial assignment to all unassigned agents concurrently. The algorithm is described in detail and its correctness proven. Experimental evaluation of AFB on random Max-DisCSPs reveals a phase transition as the tightness of the problem increases. This effect is analogous to the phase transition of Max-CSP when local consistency maintenance is applied [3]. AFB outperforms Synchronous Branch & Bound (SBB) as well as the asynchronous state-of-the-art ADOPT algorithm, for the harder problem instances. Both asynchronous algorithms outperform SBB by a large factor.",
author = "Amir Gershman and Amnon Meisels and Roie Zivan",
note = "Funding Information: 1 The research was supported by the Lynn and William Frankel Center for Computer Science, and by the Paul Ivanier Center for Robotics. 2 Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel. email: {amirger,am,zivanr}@cs.bgu.ac.il",
year = "2006",
month = jan,
day = "1",
language = "English",
isbn = "9781586036423",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press BV",
pages = "103--107",
editor = "Gerhard Brewka and Silvia Coradeschi and Anna Perini and Paolo Traverso",
booktitle = "ECAI 2006",
address = "Netherlands",
}