Distributed constraint satisfaction algorithm for complex local problems

Makoto Yokoo, Katsutoshi Hirayama

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

72 Citations (Scopus)

Abstract

A distributed constraint satisfaction problem can formalize various application problems in MAS, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable these algorithms to handle multiple local variables, obtained algorithms are neither efficient nor scalable to larger problems. We develop a new algorithm that can handle multiple local variables efficiently, which is based on the asynchronous weak-commitment search algorithm. In this algorithm, a bad local solution can be modified without forcing other agents to exhaustively search local problems. Also, the number of interactions among agents can be decreased since agents communicate only when they find local solutions that satisfy all of the local constraints. Experimental evaluations show that this algorithm is far more efficient than an algorithm that uses the prioritization among agents.

Original languageEnglish
Title of host publicationProceedings - International Conference on Multi Agent Systems, ICMAS 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages372-379
Number of pages8
ISBN (Print)081868500X, 9780818685002
DOIs
Publication statusPublished - Jan 1 1998
Externally publishedYes
Event1998 International Conference on Multi Agent Systems, ICMAS 1998 - Pans, France
Duration: Jul 3 1998Jul 7 1998

Publication series

NameProceedings - International Conference on Multi Agent Systems, ICMAS 1998

Other

Other1998 International Conference on Multi Agent Systems, ICMAS 1998
CountryFrance
CityPans
Period7/3/987/7/98

Fingerprint

Constraint satisfaction
Constraint satisfaction problems
commitment
interaction
evaluation
Problem solving
Local search
Constraint satisfaction problem
Prioritization
Interaction
Evaluation

All Science Journal Classification (ASJC) codes

  • Management Information Systems
  • Communication
  • Computer Networks and Communications
  • Information Systems and Management

Cite this

Yokoo, M., & Hirayama, K. (1998). Distributed constraint satisfaction algorithm for complex local problems. In Proceedings - International Conference on Multi Agent Systems, ICMAS 1998 (pp. 372-379). [699222] (Proceedings - International Conference on Multi Agent Systems, ICMAS 1998). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICMAS.1998.699222

Distributed constraint satisfaction algorithm for complex local problems. / Yokoo, Makoto; Hirayama, Katsutoshi.

Proceedings - International Conference on Multi Agent Systems, ICMAS 1998. Institute of Electrical and Electronics Engineers Inc., 1998. p. 372-379 699222 (Proceedings - International Conference on Multi Agent Systems, ICMAS 1998).

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

Yokoo, M & Hirayama, K 1998, Distributed constraint satisfaction algorithm for complex local problems. in Proceedings - International Conference on Multi Agent Systems, ICMAS 1998., 699222, Proceedings - International Conference on Multi Agent Systems, ICMAS 1998, Institute of Electrical and Electronics Engineers Inc., pp. 372-379, 1998 International Conference on Multi Agent Systems, ICMAS 1998, Pans, France, 7/3/98. https://doi.org/10.1109/ICMAS.1998.699222
Yokoo M, Hirayama K. Distributed constraint satisfaction algorithm for complex local problems. In Proceedings - International Conference on Multi Agent Systems, ICMAS 1998. Institute of Electrical and Electronics Engineers Inc. 1998. p. 372-379. 699222. (Proceedings - International Conference on Multi Agent Systems, ICMAS 1998). https://doi.org/10.1109/ICMAS.1998.699222
Yokoo, Makoto ; Hirayama, Katsutoshi. / Distributed constraint satisfaction algorithm for complex local problems. Proceedings - International Conference on Multi Agent Systems, ICMAS 1998. Institute of Electrical and Electronics Engineers Inc., 1998. pp. 372-379 (Proceedings - International Conference on Multi Agent Systems, ICMAS 1998).
@inproceedings{040288dcc3c443ffb35512ba527b4dce,
title = "Distributed constraint satisfaction algorithm for complex local problems",
abstract = "A distributed constraint satisfaction problem can formalize various application problems in MAS, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable these algorithms to handle multiple local variables, obtained algorithms are neither efficient nor scalable to larger problems. We develop a new algorithm that can handle multiple local variables efficiently, which is based on the asynchronous weak-commitment search algorithm. In this algorithm, a bad local solution can be modified without forcing other agents to exhaustively search local problems. Also, the number of interactions among agents can be decreased since agents communicate only when they find local solutions that satisfy all of the local constraints. Experimental evaluations show that this algorithm is far more efficient than an algorithm that uses the prioritization among agents.",
author = "Makoto Yokoo and Katsutoshi Hirayama",
year = "1998",
month = "1",
day = "1",
doi = "10.1109/ICMAS.1998.699222",
language = "English",
isbn = "081868500X",
series = "Proceedings - International Conference on Multi Agent Systems, ICMAS 1998",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "372--379",
booktitle = "Proceedings - International Conference on Multi Agent Systems, ICMAS 1998",
address = "United States",

}

TY - GEN

T1 - Distributed constraint satisfaction algorithm for complex local problems

AU - Yokoo, Makoto

AU - Hirayama, Katsutoshi

PY - 1998/1/1

Y1 - 1998/1/1

N2 - A distributed constraint satisfaction problem can formalize various application problems in MAS, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable these algorithms to handle multiple local variables, obtained algorithms are neither efficient nor scalable to larger problems. We develop a new algorithm that can handle multiple local variables efficiently, which is based on the asynchronous weak-commitment search algorithm. In this algorithm, a bad local solution can be modified without forcing other agents to exhaustively search local problems. Also, the number of interactions among agents can be decreased since agents communicate only when they find local solutions that satisfy all of the local constraints. Experimental evaluations show that this algorithm is far more efficient than an algorithm that uses the prioritization among agents.

AB - A distributed constraint satisfaction problem can formalize various application problems in MAS, and several algorithms for solving this problem have been developed. One limitation of these algorithms is that they assume each agent has only one local variable. Although simple modifications enable these algorithms to handle multiple local variables, obtained algorithms are neither efficient nor scalable to larger problems. We develop a new algorithm that can handle multiple local variables efficiently, which is based on the asynchronous weak-commitment search algorithm. In this algorithm, a bad local solution can be modified without forcing other agents to exhaustively search local problems. Also, the number of interactions among agents can be decreased since agents communicate only when they find local solutions that satisfy all of the local constraints. Experimental evaluations show that this algorithm is far more efficient than an algorithm that uses the prioritization among agents.

UR - http://www.scopus.com/inward/record.url?scp=85017332139&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85017332139&partnerID=8YFLogxK

U2 - 10.1109/ICMAS.1998.699222

DO - 10.1109/ICMAS.1998.699222

M3 - Conference contribution

AN - SCOPUS:85017332139

SN - 081868500X

SN - 9780818685002

T3 - Proceedings - International Conference on Multi Agent Systems, ICMAS 1998

SP - 372

EP - 379

BT - Proceedings - International Conference on Multi Agent Systems, ICMAS 1998

PB - Institute of Electrical and Electronics Engineers Inc.

ER -