Sciweavers

Share
ATAL
2003
Springer

An asynchronous complete method for distributed constraint optimization

10 years 4 months ago
An asynchronous complete method for distributed constraint optimization
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 significantly more efficient tha...
Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Mak
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where ATAL
Authors Pragnesh Jay Modi, Wei-Min Shen, Milind Tambe, Makoto Yokoo
Comments (0)
books