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...

ver descrição completa

Detalhes bibliográficos
Autores: Bessiere, Christian, Maestre, Arnold, Brito, Ismel, Meseguer, Pedro
Formato: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2005
País:España
Recursos:Consejo Superior de Investigaciones Científicas (CSIC)
Repositorio:DIGITAL.CSIC. Repositorio Institucional del CSIC
OAI Identifier:oai:digital.csic.es:10261/160029
Acesso em linha:http://hdl.handle.net/10261/160029
Access Level:acceso abierto
Palavra-chave:Search
Distributed problem solving
Constraint satisfaction
id ES_dbac907fea9d222522f2bbe13a3f0bf2
oai_identifier_str oai:digital.csic.es:10261/160029
network_acronym_str ES
network_name_str España
repository_id_str
spelling Asynchronous backtracking without adding links: A new member in the ABT familyBessiere, ChristianMaestre, ArnoldBrito, IsmelMeseguer, PedroSearchDistributed problem solvingConstraint satisfactionFollowing 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.Spanish project REPLI: TIC-2002-04470-C03Peer ReviewedElsevierMinisterio de Ciencia y Tecnología (España)Consejo Superior de Investigaciones Científicas [https://ror.org/02gfc7t72]2018201820052018info:eu-repo/semantics/articlehttp://purl.org/coar/resource_type/c_6501Postprintinfo:eu-repo/semantics/acceptedVersionhttp://hdl.handle.net/10261/160029reponame:DIGITAL.CSIC. Repositorio Institucional del CSICinstname:Consejo Superior de Investigaciones Científicas (CSIC)InglésSíinfo:eu-repo/semantics/openAccessoai:digital.csic.es:10261/1600292026-05-22T06:33:51Z
dc.title.none.fl_str_mv Asynchronous backtracking without adding links: A new member in the ABT family
title Asynchronous backtracking without adding links: A new member in the ABT family
spellingShingle Asynchronous backtracking without adding links: A new member in the ABT family
Bessiere, Christian
Search
Distributed problem solving
Constraint satisfaction
title_short Asynchronous backtracking without adding links: A new member in the ABT family
title_full Asynchronous backtracking without adding links: A new member in the ABT family
title_fullStr Asynchronous backtracking without adding links: A new member in the ABT family
title_full_unstemmed Asynchronous backtracking without adding links: A new member in the ABT family
title_sort Asynchronous backtracking without adding links: A new member in the ABT family
dc.creator.none.fl_str_mv Bessiere, Christian
Maestre, Arnold
Brito, Ismel
Meseguer, Pedro
author Bessiere, Christian
author_facet Bessiere, Christian
Maestre, Arnold
Brito, Ismel
Meseguer, Pedro
author_role author
author2 Maestre, Arnold
Brito, Ismel
Meseguer, Pedro
author2_role author
author
author
dc.contributor.none.fl_str_mv Ministerio de Ciencia y Tecnología (España)
Consejo Superior de Investigaciones Científicas [https://ror.org/02gfc7t72]
dc.subject.none.fl_str_mv Search
Distributed problem solving
Constraint satisfaction
topic Search
Distributed problem solving
Constraint satisfaction
description 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.
publishDate 2005
dc.date.none.fl_str_mv 2005
2018
2018
2018
dc.type.none.fl_str_mv info:eu-repo/semantics/article
http://purl.org/coar/resource_type/c_6501
Postprint
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10261/160029
url http://hdl.handle.net/10261/160029
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Sí
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:DIGITAL.CSIC. Repositorio Institucional del CSIC
instname:Consejo Superior de Investigaciones Científicas (CSIC)
instname_str Consejo Superior de Investigaciones Científicas (CSIC)
reponame_str DIGITAL.CSIC. Repositorio Institucional del CSIC
collection DIGITAL.CSIC. Repositorio Institucional del CSIC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869421697677918208
score 15,811543

Registos relacionados