By Topic

An approach to over-constrained distributed constraint satisfaction problems: distributed hierarchical constraint satisfaction

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hirayama, K. ; Kobe Univ. of Mercantile Marine, Japan ; Yokoo, M.

Many problems in multi-agent systems can be described as distributed CSPs. However some real-life problems can be over-constrained and without a set of consistent variable values when described as a distributed CSP. We have presented the distributed partial CSP for handling such an over-constrained situation and the distributed maximal CSP as a subclass of distributed partial CSP. We first show another subclass of distributed partial CSP, the distributed hierarchical CSP. Next, we present a series of new algorithms for solving a distributed hierarchical CSP, each of which is designed based on our previous distributed constraint satisfaction algorithms. Finally we evaluate the performance of our new algorithms on distributed 3-coloring problems in terms of optimality and anytime characteristics. The results show that our new algorithms perform much better than the previous algorithm for finding an optimal solution and produce good results for anytime characteristics

Published in:

MultiAgent Systems, 2000. Proceedings. Fourth International Conference on

Date of Conference: