Asynchronous Forward Bounding Revisited

The Distributed Constraint Optimization Problem DCOP is a powerful framework for modeling and solving applications in multi-agent coordination. Asynchronous Forward Bounding AFB_BJ is one of the best algorithms to solve DCOPs.We propose AFB_BJ+, a revisited version of AFB_BJ in which we refine the lower bound computations. We also propose to compute lower bounds for the whole domain of the last assigned agent instead of only doing this for its current assignment. This reduces both the number of messages needed and the time future agents remain idle. In addition, these lower bounds can be used as a value ordering heuristic in AFB_BJ+. The experimental evaluation on standard benchmark problems shows the efficiency of AFB_BJ+ compared to other algorithms for DCOPs.

[1]  Boi Faltings,et al.  Dynamic Distributed BackJumping , 2004, CSCLP.

[2]  Boi Faltings,et al.  A Value Ordering Heuristic for Local Search in Distributed Resource Allocation , 2004, CSCLP.

[3]  Amnon Meisels,et al.  Message delay and DisCSP search algorithms , 2006, Annals of Mathematics and Artificial Intelligence.

[4]  Pedro Meseguer,et al.  Saving Redundant Messages in BnB-ADOPT , 2010, AAAI.

[5]  Milind Tambe,et al.  Argumentation as distributed constraint satisfaction: applications and results , 2001, AGENTS '01.

[6]  Christian Bessiere,et al.  Nogood-based asynchronous forward checking algorithms , 2013, Constraints.

[7]  Sven Koenig,et al.  BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm , 2008, AAMAS.

[8]  Francesca Rossi,et al.  Recent Advances in Constraints (vol. # 3419) : Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and , 2005 .

[9]  Milind Tambe,et al.  Preprocessing techniques for accelerating the DCOP algorithm ADOPT , 2005, AAMAS '05.

[10]  Boi Faltings,et al.  Coordinating Logistics Operations with Privacy Guarantees , 2011, IJCAI.

[11]  Amnon Meisels,et al.  Asynchronous Forward-Bounding for Distributed Constraints Optimization , 2006, ECAI.

[12]  Carmel Domshlak,et al.  Sensor networks and distributed CSP: communication, computation and complexity , 2005, Artif. Intell..

[13]  Pedro Meseguer,et al.  Removing Redundant Messages in N-ary BnB-ADOPT , 2012, J. Artif. Intell. Res..

[14]  Felix A. Fischer,et al.  An integrated framework for adaptive reasoning about conversation patterns , 2005, AAMAS '05.

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

[16]  Christian Bessiere,et al.  Agile Asynchronous Backtracking for Distributed Constraint Satisfaction Problems , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[17]  Katia P. Sycara,et al.  No-commitment branch and bound search for distributed constraint optimization , 2006, AAMAS '06.

[18]  Milind Tambe,et al.  Multiply-Constrained DCOP for Distributed Planning and Scheduling , 2006 .

[19]  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..

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

[21]  Christian Bessiere,et al.  DisChoco 2: A Platform for Distributed Constraint Reasoning , 2011 .

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

[23]  Amnon Meisels,et al.  Asynchronous Forward Bounding for Distributed COPs , 2014, J. Artif. Intell. Res..