Using a Conflict-Based Method to Solve Distributed Constraint Satisfaction Problems

Download Now Free registration required

Executive Summary

A broad range of AI and multi-Agent problems fall in to the Distributed Constraint Satisfaction Problems category. Many of the problems in this domain are real-world problems. This fact makes DisCSPs an effective area of research. Considering all of the efforts that have recently been accomplished for solving these kinds of the problems, the most successful algorithm proposed is Asynchronous Partial Overlay (APO), which is a mediation-based algorithm. APO tries to solve the problem first by dividing the whole problem in to smaller portions and then solving these sub-problems by choosing some agents as mediators. This paper presents a new and effective strategy to select these mediators; moreover, it introduces two new expansion algorithms of APO that use this new strategy.

  • Format: PDF
  • Size: 410.5 KB