ODPOP: An Algorithm for Open/Distributed Constraint Optimization

We propose ODPOP, a new distributed algorithm for open multiagent combinatorial optimization that feature unbounded domains (Faltings & Macho-Gonzalez 2005). The ODPOP algorithm explores the same search space as the dynamic programming algorithm DPOP (Petcu & Faltings 2005b) or ADOPT (Modi et at. 2005). but does so in an incremental, best-first fashion suitable for open problems. ODPOP has several advantages over DPOP. First, it uses messages whose size only grows linearly with the treewidth of the problem. Second, by letting agents explore values in a best-first order, it avoids incurring always the worst case complexity as DPOP, and on average it saves a significant amount of computation and information exchange. To show the merits of our approach, we report on experiments with practically sized distributed meeting scheduling problems on a multiagent system.

[1]  Eugene C. Freuder.  A sufficient condition for backtrack-bounded search , 1985, JACM.

[2]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

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

[4]  Ehud Gudes,et al.  Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs) , 1996, CP.

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

[6]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[7]  Shmuel Katz,et al.  Self-Stabilizing Distributed Constraint Satisfaction , 1999, Chic. J. Theor. Comput. Sci..

[8]  Marius-Calin Silaghi,et al.  Distributed asynchronous search with private constraints (extended abstract) , 2000, AGENTS '00.

[9]  M. Silaghi,et al.  Distributed Asynchronous Search with Private Constraints , 2000 .

[10]  R. Dechter,et al.  Unifying Cluster-Tree Decompositions for Automated Reasoning , 2003 .

[11]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[12]  Amnon Meisels,et al.  Concurrent Dynamic Backtracking for Distributed CSPs , 2004, CP.

[13]  Milind Tambe,et al.  Taking DCOP to the real world: efficient complete solutions for distributed multi-event scheduling , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[14]  Boi Faltings,et al.  S-DPOP: Superstabilizing, Fault-containing Multiagent Combinatorial Optimization , 2005, AAAI 2005.

[15]  Boi Faltings,et al.  A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

[16]  Boi Faltings,et al.  Approximations in Distributed Optimization , 2005, CP.

[17]  Boi Faltings,et al.  Superstabilizing, Fault-Containing Distributed Combinatorial Optimization , 2005, AAAI.

[18]  Boi Faltings,et al.  Open constraint programming , 2005, Artif. Intell..

[19]  Javier Larrosa,et al.  Unifying tree decompositions for reasoning in graphical models , 2005, Artif. Intell..

[20]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[21]  Boi Faltings,et al.  MDPOP: faithful distributed implementation of efficient social choice problems , 2006, AAMAS '06.

[22]  B. Faltings,et al.  Superstabilizing , Fault-containing Multiagent Combinatorial Optimization , 2022 .