The impact of the conflict on solving distributed constraint satisfaction problems

Authors

  • Samaneh Hosseini
  • Kamran Zamanifar

Abstract

Distributed Constraint Satisfaction Problems (DCSPs) involve a vast number of AI andMulti-Agent problems. Many important efforts have been recen accomplished for solving these kinds of problems using both backtracking-based and mediation-based methods. One of the most successful mediation based algorithms in this field is Asynchronous Partial Overlay (APO) algorithm. By choosing some agents as mediators, APO tries to centralize portions of the distributed problem, and then each mediator tries to solve its centralized sub-problem. This work continues until the whole problem is solved. This paper presents a new strategy to select mediators. The main idea behind this strategy is that the number of mediators conflicts (violated constraints) impacts directly on its performance. Experimental results show that choosing the mediators with the most number of conflicts not only leads to considerable decrease in APO complexity, but also it can decrease the complexity of the other extensions of the APO such as IAPO algorithm. MaxCAPO and MaxCIAPO are two new expansions of APO which introduce this idea and are presented in this article. The results of using this mediator selection strategy show a rapid and desirable improvement over various parameters in comparison with APO and IAPO

Downloads

Download data is not yet available.

Downloads

Published

2012-01-26

How to Cite

Hosseini, S., & Zamanifar, K. (2012). The impact of the conflict on solving distributed constraint satisfaction problems. COMPUTING AND INFORMATICS, 28(5), 673–693. Retrieved from http://www.cai.sk/ojs/index.php/cai/article/view/55