Asynchronous weak-commitment search for solving distributed constraint satisfaction problems

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

79 引用 (Scopus)

抄録

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.

元の言語英語
ホスト出版物のタイトルPrinciples and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings
編集者Ugo Montanari, Francesca Rossi
出版者Springer Verlag
ページ88-102
ページ数15
ISBN(印刷物)3540602992, 9783540602996
DOI
出版物ステータス出版済み - 1 1 1995
イベント1st International Conference on Principles and Practice of Constraint Programming, CP 1995 - Cassis, フランス
継続期間: 9 19 19959 22 1995

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
976
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他1st International Conference on Principles and Practice of Constraint Programming, CP 1995
フランス
Cassis
期間9/19/959/22/95

Fingerprint

Constraint satisfaction problems
Constraint Satisfaction Problem
Distributed Artificial Intelligence
Backtracking
Exhaustive Search
Search Algorithm
Completeness
Decision Making
Artificial intelligence
Commitment
Imply
Decision making
Experimental Results

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Yokoo, M. (1995). Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. : U. Montanari, & F. Rossi (版), 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); 巻数 976). Springer Verlag. https://doi.org/10.1007/3-540-60299-2_6

Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. / Yokoo, Makoto.

Principles and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings. 版 / Ugo Montanari; Francesca Rossi. Springer Verlag, 1995. p. 88-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 976).

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

Yokoo, M 1995, Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. : U Montanari & F Rossi (版), Principles and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 976, Springer Verlag, pp. 88-102, 1st International Conference on Principles and Practice of Constraint Programming, CP 1995, Cassis, フランス, 9/19/95. https://doi.org/10.1007/3-540-60299-2_6
Yokoo M. Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. : Montanari U, Rossi F, 編集者, Principles and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings. Springer Verlag. 1995. p. 88-102. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-60299-2_6
Yokoo, Makoto. / Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. Principles and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings. 編集者 / Ugo Montanari ; Francesca Rossi. Springer Verlag, 1995. pp. 88-102 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{cae80807b3aa4d66bfa85647bbb2ca6e,
title = "Asynchronous weak-commitment search for solving distributed constraint satisfaction problems",
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.",
author = "Makoto Yokoo",
year = "1995",
month = "1",
day = "1",
doi = "10.1007/3-540-60299-2_6",
language = "English",
isbn = "3540602992",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "88--102",
editor = "Ugo Montanari and Francesca Rossi",
booktitle = "Principles and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Asynchronous weak-commitment search for solving distributed constraint satisfaction problems

AU - Yokoo, Makoto

PY - 1995/1/1

Y1 - 1995/1/1

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

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

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

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

U2 - 10.1007/3-540-60299-2_6

DO - 10.1007/3-540-60299-2_6

M3 - Conference contribution

AN - SCOPUS:84958042223

SN - 3540602992

SN - 9783540602996

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 88

EP - 102

BT - Principles and Practice of Constraint Programming — CP 1995 - 1st International Conference, CP 1995, Proceedings

A2 - Montanari, Ugo

A2 - Rossi, Francesca

PB - Springer Verlag

ER -