Sciweavers

Share
ECAI
2006
Springer

Asynchronous Forward-Bounding for Distributed Constraints Optimization

8 years 8 months ago
Asynchronous Forward-Bounding for Distributed Constraints Optimization
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. Experimantal evaluation shows AFB outperforms synchronous branch and bound by many orders of magnitude, and reveals a phase transition as the tighness of the problem increases. This demonstrates that asynchronous forwardbounding has an analogous effect to the phase transition that has been observed when local consistency maintainance is applied to MaxCSPs. Key Words: Distributed Optimization, Constraints, Distributed Search
Amir Gershman, Amnon Meisels, Roie Zivan
Added 22 Aug 2010
Updated 22 Aug 2010
Type Conference
Year 2006
Where ECAI
Authors Amir Gershman, Amnon Meisels, Roie Zivan
Comments (0)
books