Improving DPOP with Branch Consistency for Solving Distributed Constraint Optimization Problems

The DCOP model has gained momentum in recent years thanks to its ability to capture problems that are naturally distributed and cannot be realistically addressed in a centralized manner. Dynamic programming based techniques have been recognized to be among the most effective techniques for building complete DCOP solvers (e.g., DPOP). Unfortunately, they also suffer from a widely recognized drawback: their messages are exponential in size. Another limitation is that most current DCOP algorithms do not actively exploit hard constraints, which are common in many real problems. This paper addresses these two limitations by introducing an algorithm, called BrC-DPOP, that exploits arc consistency and a form of consistency that applies to paths in pseudo-trees to reduce the size of the messages. Experimental results shows that BrC-DPOP uses messages that are up to one order of magnitude smaller than DPOP, and that it can scale up well, being able to solve problems that its counterpart can not.

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

[2]  Radoslaw Szymanek,et al.  FRODO 2.0: An Open-Source Framework for Distributed Constraint Optimization , 2009, IJCAI 2009.

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

[4]  Pedro Meseguer,et al.  Improving DPOP with function filtering , 2010, AAMAS.

[5]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[6]  Pedro Meseguer,et al.  Generalizing ADOPT and BnB-ADOPT , 2011, IJCAI.

[7]  Robert N. Lass,et al.  DCOPolis: a framework for simulating and deploying distributed constraint reasoning algorithms , 2008, AAMAS.

[8]  Boi Faltings,et al.  H-DPOP: Using Hard Constraints for Search Space Pruning in DCOP , 2008, AAAI.

[9]  Christian Bessiere,et al.  Refining the Basic Constraint Propagation Algorithm , 2001, JFPLC.

[10]  Simon de Givry,et al.  Radio Link Frequency Assignment , 1999, Constraints.

[11]  Christian Bessiere,et al.  Including Soft Global Constraints in DCOPs , 2012, CP.

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

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

[14]  Boi Faltings,et al.  ODPOP: An Algorithm for Open/Distributed Constraint Optimization , 2006, AAAI.

[15]  Nicholas R. Jennings,et al.  Decentralised coordination of low-power embedded devices using the max-sum algorithm , 2008, AAMAS.

[16]  Steven Okamoto,et al.  Explorative anytime local search for distributed constraint optimization , 2014, Artif. Intell..

[17]  Pedro Meseguer,et al.  Maintaining Soft Arc Consistencies in BnB-ADOPT + during Search , 2013, CP.

[18]  Boi Faltings,et al.  Incentive Compatible Multiagent Constraint Optimization , 2005, WINE.

[19]  Boi Faltings,et al.  Distributed constraint optimization with structured resource constraints , 2009, AAMAS.

[20]  Hoong Chuin Lau,et al.  Distributed Gibbs: a memory-bounded sampling-based DCOP algorithm , 2013, AAMAS.

[21]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[22]  Peter van Beek,et al.  Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings , 2005, CP.

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

[24]  C. Bessiere,et al.  DisChoco : A platform for distributed constraint programming , 2006 .

[25]  Kenneth N. Brown,et al.  Efficient Handling of Complex Local Problems in Distributed Constraint Optimization , 2006, ECAI.

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

[27]  Pedro Meseguer,et al.  Improving BnB-ADOPT+-AC , 2012, AAMAS.

[28]  Michael D. Smith,et al.  SSDPOP: improving the privacy of DCOP with secret sharing , 2007, AAMAS '07.

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

[30]  Roie Zivan,et al.  Distributed Constraint Optimization for Large Teams of Mobile Sensing Agents , 2009, 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology.

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

[32]  Makoto Yokoo,et al.  Distributed Problem Solving , 2012, AI Mag..

[33]  Makoto Yokoo,et al.  Distributed Constraint Satisfaction , 2000, Springer Series on Agent Technology.

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

[35]  Paul Erdös,et al.  On random graphs, I , 1959 .

[36]  Weixiong Zhang,et al.  Distributed stochastic search and distributed breakout: properties, comparison and applications to constraint optimization problems in sensor networks , 2005, Artif. Intell..

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

[38]  Boi Faltings,et al.  MB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization , 2007, IJCAI.