多重エイジェントの動的優先順位決定アルゴリズム

カテゴリ: 部門大会

論文No: MC1-1

グループ名: 【C】平成17年電気学会電子・情報・システム部門大会講演論文集

発行日: 2005/09/06

タイトル(英語): Dynamic Priority Decision Algorithm Of Multi-Agent

著者名: 金澤千 (培材大学校),鄭會京 (培材大学校),金珍秀 (培材大学校)

著者名(英語): tak cheun Kim (Paichai University),Hoe Kyung Jung (Paichai University),Jin Soo Kim (Paichai University)

キーワード: 多重エイジェント|動的優先順位|multiagent|Dynamic Priority

要約(日本語): A distributed constraint satisfaction problem (distributed CSP) is a constraint satisfaction problem (CSP) in which variables and constraints are distributed among multiple automated agents. ACSP is a problem to find a consistent assignment of values to variables. Even though the definition of a CSP is very simple, a surprisingly wide variety of AI problems can be formalized as CSPs.
In recent years, many new backtracking algorithms for solving distributed CSPs have been proposed. But most of all, they have common drawbacks that the algorithm assumes the priority of agents is static.
In this thesis, we establish a basic algorithm for solving distributed CSPs called dynamic priority search algorithm that is more efficient than common backtracking algorithms in which the priority order is static.
The experimental results on example problems show that this algorithm is by far more efficient than the backtracking algorithm, in which the priority order is static. The priority order represents a hierarchy of agent authority, i.e., the priority of decision-making.

PDFファイルサイズ: 1,454 Kバイト