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.
| Original language | English |
|---|---|
| Title of host publication | ECAI 2006 |
| Subtitle of host publication | 17th European Conference on Artificial Intelligence August 29 - September 1, 2006, Riva del Garda, Italy |
| Editors | Gerhard Brewka, Silvia Coradeschi, Anna Perini, Paolo Traverso |
| Publisher | IOS Press BV |
| Pages | 103-107 |
| Number of pages | 5 |
| ISBN (Print) | 9781586036423 |
| State | Published - 2006 |
| Externally published | Yes |
Publication series
| Name | Frontiers in Artificial Intelligence and Applications |
|---|---|
| Volume | 141 |
| ISSN (Print) | 0922-6389 |
| ISSN (Electronic) | 1879-8314 |
Bibliographical 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
Funding
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
| Funders | Funder number |
|---|---|
| Lynn and William Frankel Center for Computer Science |