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 language | English |
|---|---|
| Title of host publication | Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 135-142 |
| Number of pages | 8 |
| ISBN (Electronic) | 0769506259, 9780769506258 |
| DOIs | |
| Publication status | Published - Jan 1 2000 |
| Externally published | Yes |
| Event | 4th International Conference on MultiAgent Systems, ICMAS 2000 - Boston, United States Duration: Jul 10 2000 → Jul 12 2000 |
Publication series
| Name | Proceedings - 4th International Conference on MultiAgent Systems, ICMAS 2000 |
|---|
Other
| Other | 4th International Conference on MultiAgent Systems, ICMAS 2000 |
|---|---|
| Country | United States |
| City | Boston |
| Period | 7/10/00 → 7/12/00 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Artificial Intelligence
- Control and Systems Engineering
Cite this
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 proceeding › Conference contribution
}
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 -