Asynchronous backtracking without adding links: A new member in the ABT family
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 unconne...
| Authors: | , , , |
|---|---|
| Format: | article |
| Status: | Versión aceptada para publicación |
| Publication Date: | 2005 |
| Country: | España |
| Institution: | Consejo Superior de Investigaciones Científicas (CSIC) |
| Repository: | DIGITAL.CSIC. Repositorio Institucional del CSIC |
| OAI Identifier: | oai:digital.csic.es:10261/160029 |
| Online Access: | http://hdl.handle.net/10261/160029 |
| Access Level: | Open access |
| Keyword: | Search Distributed problem solving Constraint satisfaction |
| Summary: | 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. ©2004 Elsevier B.V. All rights reserved. |
|---|