分散不完全制約充足問題

概要

論文の詳細を見る
Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to find a set of assignments to variables that satisfies all constraints among agents. However, when real-life problems are formalized as distributed CSPs, they are often over-constrained and have no solution that satisfies all constraints. This paper provides the Distributed Partial Constraint Satisfaction Problem (DPCSP) as a new framework for dealing with over-constrained situations. We also present new algorithms for solving Distributed Maxima1 Constraint Satisfaction Problems (DMCSPs), which belong to an important class of DPCSP. These algorithms are called the Synchronous Branch and Bound (SBB) and the Iterative Distributed Breakout (IDB). Both algorithms were tested on hard classes of over-constrained random binary distributed CSPs. The results can be summarized as SBB is preferable when we are mainly concerned with the optimality of a solution, while IDB is preferable when we want to get a nearly optimal solution quickly.
社団法人人工知能学会の論文
1999-07-01