Vidal's library
Title: An Asynchronous Complete Method for Distributed Constraint Optimization
Author: Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, and Makoto Yokoo
Book Tittle: Proceedings of Second International Joint Conference on Autonomous Agents and MultiAgent Systems
Month: July
Year: 2003
Abstract: We present a new polynomial-space algorithm, called Adopt, for distributed constraint optimization (DCOP). DCOP is able to model a large class of collaboration problems in multi-agent systems where a solution within given quality parameters must be found. Existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while operating both efficiently and asynchronously. Adopt is guaranteed to find an optimal solution, or a solution within a user-specified distance from the optimal, while allowing agents to execute asynchronously and in parallel. Adopt obtains these properties via a distributed search algorithm with several novel characteristics including the ability for each agent to make local decisions based on currently available information and without necessarily having global certainty. Theoretical analysis shows that Adopt provides provable quality guarantees, while experimental results show that Adopt is signifi- cantly more efficient than synchronous methods. The speedups are shown to be partly due to the novel search strategy employed and partly due to the asynchrony of the algorithm.

Cited by 69  -  Google Scholar

@InProceedings{modi03a,
  author =	 {Pragnesh Jay Modi and Wei-Min Shen and Milind Tambe
                  and Makoto Yokoo},
  title =	 {An Asynchronous Complete Method for Distributed
                  Constraint Optimization},
  booktitle =	 {Proceedings of Second International Joint Conference
                  on Autonomous Agents and MultiAgent Systems},
  year =	 2003,
  month =	 {July},
  abstract =	 {We present a new polynomial-space algorithm, called
                  Adopt, for distributed constraint optimization
                  (DCOP). DCOP is able to model a large class of
                  collaboration problems in multi-agent systems where
                  a solution within given quality parameters must be
                  found. Existing methods for DCOP are not able to
                  provide theoretical guarantees on global solution
                  quality while operating both efficiently and
                  asynchronously. Adopt is guaranteed to find an
                  optimal solution, or a solution within a
                  user-specified distance from the optimal, while
                  allowing agents to execute asynchronously and in
                  parallel. Adopt obtains these properties via a
                  distributed search algorithm with several novel
                  characteristics including the ability for each agent
                  to make local decisions based on currently available
                  information and without necessarily having global
                  certainty. Theoretical analysis shows that Adopt
                  provides provable quality guarantees, while
                  experimental results show that Adopt is signifi-
                  cantly more efficient than synchronous methods. The
                  speedups are shown to be partly due to the novel
                  search strategy employed and partly due to the
                  asynchrony of the algorithm.},
  keywords =     {multiagent dcop},
  url =		 {http://jmvidal.cse.sc.edu/library/modi03a.pdf},
  comment =	 {Adopt algorithm.},
  googleid = 	 {EajgU--8R3EJ:scholar.google.com/},
  cluster = 	 {8162700585722750993}
}
Last modified: Wed Mar 9 10:15:43 EST 2011