Vidal's library
Title: An Approach to Over-constrained Distributed Constraint Satisfaction Problems: Distributed Hierarchical Constraint Satisfaction
Author: Katsutoshi Hirayama and Makoto Yokoo
Book Tittle: Proceedings of the Fourth International Conference on Multiagent Systems
Year: 2000
Abstract: Many problems in multi-agent systems can be described as a distributed CSP. However, some real-life problem can be over-constrained and without a set of consistent variable values when described as a distributed CSP. We have presented a distributed partial CSP for handling such an over-constrained situation and a distributed maximal CSP as a subclass of distributed partial CSP. In this paper, we first show another subclass of distributed partial CSP, a 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 the new algorithms on distributed 3-coloring problems in terms of optimality and anytime characteristics.

Cited by 27  -  Google Scholar

@InProceedings{hirayama00a,
  author =	 {Katsutoshi Hirayama and Makoto Yokoo},
  title =	 {An Approach to Over-constrained Distributed
                  Constraint Satisfaction Problems: Distributed
                  Hierarchical Constraint Satisfaction},
  googleid =	 {aSAu0cuNHy4J:scholar.google.com/},
  booktitle =	 {Proceedings of the Fourth International Conference
                  on Multiagent Systems },
  year =	 2000,
  abstract =	 {Many problems in multi-agent systems can be
                  described as a distributed CSP. However, some
                  real-life problem can be over-constrained and
                  without a set of consistent variable values when
                  described as a distributed CSP. We have presented a
                  distributed partial CSP for handling such an
                  over-constrained situation and a distributed maximal
                  CSP as a subclass of distributed partial CSP. In
                  this paper, we first show another subclass of
                  distributed partial CSP, a 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 the new algorithms on
                  distributed 3-coloring problems in terms of
                  optimality and anytime characteristics.},
  keywords =     {multiagent dcsp},
  url =		 {http://jmvidal.cse.sc.edu/library/hirayama00a.pdf},
  cluster = 	 {3323530956550053993}
}
Last modified: Wed Mar 9 10:14:57 EST 2011