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

https://doi.org/10.1016/j.artint.2004.10.002Get rights and content
Under an Elsevier user license
open archive

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.

Keywords

Distributed problem solving
Constraint satisfaction
Search

Cited by (0)

The work of Ismel Brito and Pedro Meseguer is supported by the Spanish project REPLI: TIC-2002-04470-C03-03.