Asynchronous weak-commitment search for solving distributed constraint satisfaction problems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

82 Citations (Scopus)

Abstract

A distributed constraint satisfaction problem (Distributed CSP) is a CSP in which variables and constraints are distributed among multiple automated agents, and various application problems in Distributed Artificial Intelligence can be formalized as Distributed CSPs. We develop a new algorithm for solving Distributed CSPs called asynchronous weak-commitment search, which is inspired by the weak-commitment search algorithm for solving CSPs. This algorithm can revise a bad decision without an exhaustive search by changing the priority order of agents dynamically. Furthermore, agents can act asynchronously and concurrently based on their local knowledge without any global control, while guaranteeing the completeness of the algorithm. The experimental results on various example problems show that this algorithm is by far more efficient than the asynchronous backtracking algorithm for solving Distributed CSPs, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision making. Therefore, these results imply that a flexible agent organization, in which the hierarchical order is changed dynamically, actually performs better than an organization in which the hierarchical order is static and rigid.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings
EditorsUgo Montanari, Francesca Rossi
PublisherSpringer Verlag
Pages88-102
Number of pages15
ISBN (Print)3540602992, 9783540602996
DOIs
Publication statusPublished - Jan 1 1995
Externally publishedYes
Event1st International Conference on Principles and Practice of Constraint Programming, CP 1995 - Cassis, France
Duration: Sep 19 1995Sep 22 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume976
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Principles and Practice of Constraint Programming, CP 1995
CountryFrance
CityCassis
Period9/19/959/22/95

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Asynchronous weak-commitment search for solving distributed constraint satisfaction problems'. Together they form a unique fingerprint.

  • Cite this

    Yokoo, M. (1995). Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In U. Montanari, & F. Rossi (Eds.), Principles and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings (pp. 88-102). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 976). Springer Verlag. https://doi.org/10.1007/3-540-60299-2_6