Distributed constraint satisfaction for formalizing distributed problem solving

Makoto Yokoo, Toru Ishida, Edmund H. Durfee, Kazuhiro Kuwabara

研究成果: 著書/レポートタイプへの貢献会議での発言

220 引用 (Scopus)

抄録

Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. This formalism and algorithms for solving distributed constraint satisfaction problems (DCSPs) are compared. A technique called asynchronous backtracking that allows agents to act asynchronously and concurrently, in contrast to the traditional sequential backtracking techniques used in constraint satisfaction problems, is presented. Experimental results show that solving DCSPs in a distributed fashion is worthwhile when the problems solved by individual agents are loosely coupled.

元の言語英語
ホスト出版物のタイトルProceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992
出版者Institute of Electrical and Electronics Engineers Inc.
ページ614-621
ページ数8
ISBN(電子版)0818628650
DOI
出版物ステータス出版済み - 1 1 1992
外部発表Yes
イベント12th International Conference on Distributed Computing Systems, ICDCS 1992 - Yokohama, 日本
継続期間: 6 9 19926 12 1992

出版物シリーズ

名前Proceedings - International Conference on Distributed Computing Systems
1992-June

会議

会議12th International Conference on Distributed Computing Systems, ICDCS 1992
日本
Yokohama
期間6/9/926/12/92

Fingerprint

Constraint satisfaction problems

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

これを引用

Yokoo, M., Ishida, T., Durfee, E. H., & Kuwabara, K. (1992). Distributed constraint satisfaction for formalizing distributed problem solving. : Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992 (pp. 614-621). [235101] (Proceedings - International Conference on Distributed Computing Systems; 巻数 1992-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICDCS.1992.235101

Distributed constraint satisfaction for formalizing distributed problem solving. / Yokoo, Makoto; Ishida, Toru; Durfee, Edmund H.; Kuwabara, Kazuhiro.

Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992. Institute of Electrical and Electronics Engineers Inc., 1992. p. 614-621 235101 (Proceedings - International Conference on Distributed Computing Systems; 巻 1992-June).

研究成果: 著書/レポートタイプへの貢献会議での発言

Yokoo, M, Ishida, T, Durfee, EH & Kuwabara, K 1992, Distributed constraint satisfaction for formalizing distributed problem solving. : Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992., 235101, Proceedings - International Conference on Distributed Computing Systems, 巻. 1992-June, Institute of Electrical and Electronics Engineers Inc., pp. 614-621, 12th International Conference on Distributed Computing Systems, ICDCS 1992, Yokohama, 日本, 6/9/92. https://doi.org/10.1109/ICDCS.1992.235101
Yokoo M, Ishida T, Durfee EH, Kuwabara K. Distributed constraint satisfaction for formalizing distributed problem solving. : Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992. Institute of Electrical and Electronics Engineers Inc. 1992. p. 614-621. 235101. (Proceedings - International Conference on Distributed Computing Systems). https://doi.org/10.1109/ICDCS.1992.235101
Yokoo, Makoto ; Ishida, Toru ; Durfee, Edmund H. ; Kuwabara, Kazuhiro. / Distributed constraint satisfaction for formalizing distributed problem solving. Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992. Institute of Electrical and Electronics Engineers Inc., 1992. pp. 614-621 (Proceedings - International Conference on Distributed Computing Systems).
@inproceedings{368bb9220343410fa2b8b5bede86a971,
title = "Distributed constraint satisfaction for formalizing distributed problem solving",
abstract = "Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. This formalism and algorithms for solving distributed constraint satisfaction problems (DCSPs) are compared. A technique called asynchronous backtracking that allows agents to act asynchronously and concurrently, in contrast to the traditional sequential backtracking techniques used in constraint satisfaction problems, is presented. Experimental results show that solving DCSPs in a distributed fashion is worthwhile when the problems solved by individual agents are loosely coupled.",
author = "Makoto Yokoo and Toru Ishida and Durfee, {Edmund H.} and Kazuhiro Kuwabara",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/ICDCS.1992.235101",
language = "English",
series = "Proceedings - International Conference on Distributed Computing Systems",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "614--621",
booktitle = "Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992",
address = "United States",

}

TY - GEN

T1 - Distributed constraint satisfaction for formalizing distributed problem solving

AU - Yokoo, Makoto

AU - Ishida, Toru

AU - Durfee, Edmund H.

AU - Kuwabara, Kazuhiro

PY - 1992/1/1

Y1 - 1992/1/1

N2 - Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. This formalism and algorithms for solving distributed constraint satisfaction problems (DCSPs) are compared. A technique called asynchronous backtracking that allows agents to act asynchronously and concurrently, in contrast to the traditional sequential backtracking techniques used in constraint satisfaction problems, is presented. Experimental results show that solving DCSPs in a distributed fashion is worthwhile when the problems solved by individual agents are loosely coupled.

AB - Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. This formalism and algorithms for solving distributed constraint satisfaction problems (DCSPs) are compared. A technique called asynchronous backtracking that allows agents to act asynchronously and concurrently, in contrast to the traditional sequential backtracking techniques used in constraint satisfaction problems, is presented. Experimental results show that solving DCSPs in a distributed fashion is worthwhile when the problems solved by individual agents are loosely coupled.

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

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

U2 - 10.1109/ICDCS.1992.235101

DO - 10.1109/ICDCS.1992.235101

M3 - Conference contribution

AN - SCOPUS:85043435920

T3 - Proceedings - International Conference on Distributed Computing Systems

SP - 614

EP - 621

BT - Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992

PB - Institute of Electrical and Electronics Engineers Inc.

ER -