Adopt: asynchronous distributed constraint optimization with quality guarantees

The Distributed Constraint Optimization Problem (DCOP) is a promising approach for modeling distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing methods for DCOP are not able to provide theoretical guarantees on global solution quality while allowing agents to operate asynchronously. We show how this failure can be remedied by allowing agents to make local decisions based on conservative cost estimates rather than relying on global certainty as previous approaches have done. This novel approach results in a polynomial-space algorithm for DCOP named Adopt that is guaranteed to find the globally optimal solution while allowing agents to execute asynchronously and in parallel. Detailed experimental results show that on benchmark problems Adopt obtains speedups of several orders of magnitude over other approaches. Adopt can also perform bounded-error approximation-it has the ability to quickly find approximate solutions and, unlike heuristic search methods, still maintain a theoretical guarantee on solution quality.

[1]  M. F. Mar,et al.  ModSAF Behavior Simulation and Control , 1993 .

[2]  Makoto Yokoo,et al.  Distributed Partial Constraint Satisfaction Problem , 1997, CP.

[3]  Makoto Yokoo,et al.  An approach to over-constrained distributed constraint satisfaction problems: distributed hierarchical constraint satisfaction , 2000, Proceedings Fourth International Conference on MultiAgent Systems.

[4]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..

[5]  Jean Oh,et al.  Electric Elves: Applying Agent Technology to Support Human Organizations , 2001, IAAI.

[6]  Makoto Yokoo,et al.  An asynchronous complete method for distributed constraint optimization , 2003, AAMAS '03.

[7]  Pedro Meseguer,et al.  Distributed Forward Checking , 2003, CP.

[8]  Francesca Rossi,et al.  Constraint Solving over Semirings , 1995, IJCAI.

[9]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[10]  Shuji Hashimoto,et al.  Proceedings of the IEEE International Conference on Systems, Man and Cybernetics , 1998 .

[11]  Hiroaki Kitano,et al.  RoboCup Rescue: search and rescue in large-scale disasters as a domain for autonomous agents research , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[12]  Michael J. Quinn,et al.  Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems , 1985, IJCAI.

[13]  Marius-Calin Silaghi,et al.  Asynchronous Search with Aggregations , 2000, AAAI/IAAI.

[14]  Milind Tambe,et al.  Distributed Constraint Reasoning under Unreliable Communication , 2007 .

[15]  相場亮.  Distributed Constraint Satisfaction： Foundations of Cooperation in Multi - Agent Systems , 2001 .

[16]  R. M. Oliver,et al.  Influence diagrams, belief nets and decision analysis , 1992 .

[17]  Wei-Min Shen,et al.  A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation , 2001, CP.

[18]  Makoto Yokoo,et al.  An Asynchronous Complete Method for General Distributed Constraint Optimization , 2002 .

[19]  Wei-Min Shen,et al.  Distributed constraint optimization for multiagent systems , 2003 .

[20]  Boi Faltings,et al.  Resource Allocation in Networks Using Abstraction and Constraint Satisfaction Techniques , 1999 .

[21]  Katia P. Sycara,et al.  Exploiting Problem Structure for Distributed Constraint Optimization , 1995, ICMAS.

[22]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[23]  Anthony Barrett.  AUTONOMY ARCHITECTURES FOR A CONSTELLATION OF SPACECRAFT , 2000 .

[24]  Michael Perry.  iSAIRAS '99 : Fifth International Symposium on Artificial Intelligence, Robotics and Automation in Space, ESTEC, Noordwijk, the Netherlands, 1-3 June 1999 , 1999 .

[25]  Boi Faltings,et al.  Resource Allocation and Constraint Satisfaction Techniques , 1999, CP.

[26]  相場 亮,et al.  Distributed Constraint Satisfaction : Foundations of Cooperation in Multi-Agent Systems, Mokoto Yokoo (著), Springer-Verlag, ISBN3540675965 , 2001 .

[27]  Christian Bessiere,et al.  Backtracking in Distributed Constraint Networks , 1998 .

[28]  Weixiong Zhang,et al.  Distributed breakout revisited , 2002, AAAI/IAAI.

[29]  Al Ward,et al.  Distributed Component-Centered Design as Agent-Based Distributed Constraint Optimization , 1997, AAAI Workshop: Constraints & Agents.

[30]  Makoto Yokoo,et al.  Distributed constraint satisfaction algorithm for complex local problems , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[31]  Thomas Schiex,et al.  Valued Constraint Satisfaction Problems: Hard and Easy Problems , 1995, IJCAI.

[32]  Shlomi Dolev,et al.  Self-Stabilizing Depth-First Search , 1994, Inf. Process. Lett..

[33]  Milind Tambe,et al.  Towards Flexible Teamwork , 1997, J. Artif. Intell. Res..

[34]  Gérard Verfaillie,et al.  An Incomplete Method for Solving Distributed Valued Constraint Satisfaction Problems , 1997, AAAI Workshop: Constraints & Agents.

[35]  Shmuel Katz,et al.  On the Feasibility of Distributed Constraint Satisfaction , 1991, IJCAI.

[36]  Stephen Fitzpatrick,et al.  An Experimental Assessment of a Stochastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs , 2001, SAGA.

[37]  Satoshi Murata,et al.  Self-reconfigurable robots , 2007, IEEE Robotics & Automation Magazine.

[38]  Milind Tambe,et al.  Distributed Sensor Networks: A Multiagent Perspective , 2003 .

[39]  Edmund H. Durfee,et al.  Dynamic Prioritization of Complex Agents in Distributed Constraint Satisfaction Problems , 1997, AAAI/IAAI.

[40]  Joël Quinqueton,et al.  Distributed Intelligent Backtracking , 1998, ECAI.