Asynchronous weak-commitment search for solving distributed constraint satisfaction problems

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

90 被引用数 (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
国/地域フランス
CityCassis
Period9/19/959/22/95

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Asynchronous weak-commitment search for solving distributed constraint satisfaction problems」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル