Asynchronous Backtracking Without Adding Links: A New Member in the ABT Family - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Artificial Intelligence Year : 2005

Asynchronous Backtracking Without Adding Links: A New Member in the ABT Family

Abstract

Following the pioneer work of Yokoo and colleagues on the ABT (asynchronous backtrack-ing) 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.
Fichier principal
Vignette du fichier
aij05-abt.pdf (170.79 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00105347 , version 1 (12-10-2019)

Identifiers

Cite

Christian Bessiere, Arnold Maestre, Ismel Brito, Pedro Meseguer. Asynchronous Backtracking Without Adding Links: A New Member in the ABT Family. Artificial Intelligence, 2005, 161 (1-2), pp.7-24. ⟨10.1016/j.artint.2004.10.002⟩. ⟨lirmm-00105347⟩
152 View
62 Download

Altmetric

Share

Gmail Facebook X LinkedIn More