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

K. Hirayama, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

27 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages135-142
Number of pages8
ISBN (Electronic)0769506259, 9780769506258
DOIs
Publication statusPublished - Jan 1 2000
Externally publishedYes
Event4th International Conference on MultiAgent Systems, ICMAS 2000 - Boston, United States
Duration: Jul 10 2000Jul 12 2000

Publication series

NameProceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000

Other

Other4th International Conference on MultiAgent Systems, ICMAS 2000
CountryUnited States
CityBoston
Period7/10/007/12/00

Fingerprint

Constraint satisfaction problems
Coloring
Multi agent systems

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Control and Systems Engineering

Cite this

Hirayama, K., & Yokoo, M. (2000). An approach to over-constrained distributed constraint satisfaction problems: Distributed hierarchical constraint satisfaction. In Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000 (pp. 135-142). [858445] (Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICMAS.2000.858445

An approach to over-constrained distributed constraint satisfaction problems : Distributed hierarchical constraint satisfaction. / Hirayama, K.; Yokoo, Makoto.

Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000. Institute of Electrical and Electronics Engineers Inc., 2000. p. 135-142 858445 (Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hirayama, K & Yokoo, M 2000, An approach to over-constrained distributed constraint satisfaction problems: Distributed hierarchical constraint satisfaction. in Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000., 858445, Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000, Institute of Electrical and Electronics Engineers Inc., pp. 135-142, 4th International Conference on MultiAgent Systems, ICMAS 2000, Boston, United States, 7/10/00. https://doi.org/10.1109/ICMAS.2000.858445
Hirayama K, Yokoo M. An approach to over-constrained distributed constraint satisfaction problems: Distributed hierarchical constraint satisfaction. In Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000. Institute of Electrical and Electronics Engineers Inc. 2000. p. 135-142. 858445. (Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000). https://doi.org/10.1109/ICMAS.2000.858445
Hirayama, K. ; Yokoo, Makoto. / An approach to over-constrained distributed constraint satisfaction problems : Distributed hierarchical constraint satisfaction. Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000. Institute of Electrical and Electronics Engineers Inc., 2000. pp. 135-142 (Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000).
@inproceedings{0e8e351c5ddf4149899f5e90fe206f67,
title = "An approach to over-constrained distributed constraint satisfaction problems: Distributed hierarchical constraint satisfaction",
abstract = "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.",
author = "K. Hirayama and Makoto Yokoo",
year = "2000",
month = "1",
day = "1",
doi = "10.1109/ICMAS.2000.858445",
language = "English",
series = "Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "135--142",
booktitle = "Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000",
address = "United States",

}

TY - GEN

T1 - An approach to over-constrained distributed constraint satisfaction problems

T2 - Distributed hierarchical constraint satisfaction

AU - Hirayama, K.

AU - Yokoo, Makoto

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84962118508&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84962118508&partnerID=8YFLogxK

U2 - 10.1109/ICMAS.2000.858445

DO - 10.1109/ICMAS.2000.858445

M3 - Conference contribution

AN - SCOPUS:84962118508

T3 - Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000

SP - 135

EP - 142

BT - Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000

PB - Institute of Electrical and Electronics Engineers Inc.

ER -