Asynchronous backtracking without adding links: a new member in the ABT family Export

@article{bessiere05a, abstract = {Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constraint networks. They differ in the way they store nogoods, but they all use additional communication links between unconnected agents to detect obsolete information. In this paper, we propose a new asynchronous backtracking algorithm which does not need to add links between initially unconnected agents. To make the description simpler and to facilitate the comparisons between algorithms, we present a unifying framework from which the new algorithm we propose, as well as existing ones, are derived. We provide an experimental evaluation of these algorithms.}, author = {Bessi\`{e}re, Christian and Maestre, Arnold and Brito, Ismel and Meseguer, Pedro}, citeulike-article-id = {1585780}, citeulike-linkout-0 = {http://jmvidal.cse.sc.edu/library/bessiere05a.pdf}, doi = {10.1016/j.artint.2004.10.002}, journal = {Artificial Intelligence}, keywords = {bibtex-import, dcsp, multiagent}, pages = {7--24}, posted-at = {2007-08-23 14:42:25}, priority = {2}, title = {Asynchronous backtracking without adding links: a new member in the {ABT} family}, url = {10.1016/j.artint.2004.10.002}, volume = {161}, year = {2005} }

TY - JOUR ID - bessiere05a L3 - citeulike-article-id:1585780 N2 - Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtracking) algorithm, several ABT-based procedures have been proposed for solving distributed constraint networks. They differ in the way they store nogoods, but they all use additional communication links between unconnected agents to detect obsolete information. In this paper, we propose a new asynchronous backtracking algorithm which does not need to add links between initially unconnected agents. To make the description simpler and to facilitate the comparisons between algorithms, we present a unifying framework from which the new algorithm we propose, as well as existing ones, are derived. We provide an experimental evaluation of these algorithms. JF - Artificial Intelligence EP - 24 TI - Asynchronous backtracking without adding links: a new member in the {ABT} family VL - 161 SP - 7 KW - bibtex-import KW - dcsp KW - multiagent AU - Bessi\`{e}re, Christian AU - Maestre, Arnold AU - Brito, Ismel AU - Meseguer, Pedro PY - 2005/// UR - http://jmvidal.cse.sc.edu/library/bessiere05a.pdf ER -