An improved DPOP algorithm based on breadth first search pseudo-tree for distributed constraint optimization

Depth First Search (DFS) pseudo-tree is popularly used as the communication structure in complete algorithms for solving Distributed Constraint Optimization Problems (DCOPs) from multiagent systems. The advantage of a DFS pseudo-tree lies in its parallelism derived from pseudo-tree branches because the nodes in different branches are relatively independent and can compute concurrently. However, the constructed DFS pseudo-trees in experiments often come to be chain-like and greatly impair the performances of solving algorithms. Therefore, we propose a new DPOP algorithm using a Breadth First Search (BFS) pseudo-tree as the communication structure, named BFSDPOP. Compared with a DFS pseudo-tree, a BFS pseudo-tree is more excellent on the parallelism as it has much more branches. Another notable advantage is that the height of a BFS pseudo-tree is much lower than that of a DFS pseudo-tree, which gives rise to the shorter communication paths and less communication time. The method of Cluster Removing is also presented to allocate cross-edge constraints to reduce the size of the largest message in BFSDPOP. In the experiment, BFSDPOP with a BFS pseudo-tree and original DPOP with a DFS pseudo-tree are compared on three types of problems - graph coloring problems, meeting scheduling problems and random DCOPs. The results show that BFSDPOP outperforms original DPOP in most cases, which proves the excellent attributes of BFS pseudo-tree over DFS pseudo-tree.

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

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

[3]  Javier Larrosa,et al.  Improved Bounded Max-Sum for Distributed Constraint Optimization , 2012, CP.

[4]  Sarvapali D. Ramchurn,et al.  A Tutorial on Optimization for Multi-Agent Systems , 2014, Comput. J..

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

[6]  Keith S. Decker,et al.  A complete distributed constraint optimization method for non-traditional pseudotree arrangements , 2007, AAMAS '07.

[7]  Sarvapali D. Ramchurn,et al.  Optimal decentralised dispatch of embedded generation in the smart grid , 2012, AAMAS.

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

[9]  Enrico Pontelli,et al.  Distributed Constraint Optimization Problems and Applications: A Survey , 2016, J. Artif. Intell. Res..

[10]  Sylvain Piechowiak,et al.  Multi-variable distributed backtracking with sessions , 2014, Applied Intelligence.

[11]  Boi Faltings,et al.  Protecting Privacy through Distributed Computation in Multi-agent Decision Making , 2013, J. Artif. Intell. Res..

[12]  Tad Hogg,et al.  Phase Transitions and the Search Problem , 1996, Artif. Intell..

[13]  Adrian Petcu,et al.  A Class of Algorithms for Distributed Constraint Optimization , 2009, Frontiers in Artificial Intelligence and Applications.

[14]  Fabrício Enembreck,et al.  Distributed Constraint Optimization Problems: Review and perspectives , 2014, Expert Syst. Appl..

[15]  Archie C. Chapman,et al.  A unifying framework for iterative approximate best-response algorithms for distributed constraint optimization problems1 , 2011, The Knowledge Engineering Review.

[16]  J. Christopher Beck.  Principles and Practice of Constraint Programming , 2017, Lecture Notes in Computer Science.

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

[18]  Steven Okamoto,et al.  Distributed Breakout: Beyond Satisfaction , 2016, IJCAI.

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

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

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

[22]  Amnon Meisels.  Asynchronous Forward-Bounding , 2008 .

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

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

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

[26]  Makoto Yokoo,et al.  Nogood based asynchronous distributed optimization (ADOPT ng) , 2006, AAMAS '06.

[27]  Evan Sultanik,et al.  On Modeling Multiagent Task Scheduling as a Distributed Constraint Optimization Problem , 2007, IJCAI.

[28]  Milind Tambe,et al.  A Family of Graphical-Game-Based Algorithms for Distributed Constraint Optimization Problems , 2006 .

[29]  Otman A. Basir,et al.  Target to sensor allocation: A hierarchical dynamic Distributed Constraint Optimization approach , 2013, Comput. Commun..

[30]  Enrico Pontelli,et al.  GD-GIBBS: a GPU-based sampling algorithm for solving distributed constraint optimization problems , 2014, AAMAS.

[31]  Amnon Meisels,et al.  Completeness and Performance Of The APO Algorithm , 2008, J. Artif. Intell. Res..

[32]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[33]  Nicholas R. Jennings,et al.  Agent-based decentralised coordination for sensor networks using the max-sum algorithm , 2014, Autonomous Agents and Multi-Agent Systems.

[34]  Boi Faltings,et al.  Distributed Constraint Optimization Applications in Power Networks , 2008 .

[35]  Boi Faltings,et al.  DUCT: An Upper Confidence Bound Approach to Distributed Constraint Optimization Problems , 2012, AAAI.

[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]  Steven Okamoto,et al.  Distributed constraint optimization for teams of mobile sensing agents , 2014, Autonomous Agents and Multi-Agent Systems.

[38]  Fabrício Enembreck,et al.  Distributed constraint optimization with MULBS: A case study on collaborative meeting scheduling , 2012, J. Netw. Comput. Appl..

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

[40]  Nicholas R. Jennings,et al.  Bounded approximate decentralised coordination via the max-sum algorithm , 2009, Artif. Intell..

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

[42]  Pedro Meseguer,et al.  Cluster Tree Elimination for Distributed Constraint Optimization with Quality Guarantees , 2010, Fundam. Informaticae.

[43]  Makoto Yokoo,et al.  The distributed breakout algorithms , 2005, Artif. Intell..

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

[45]  Makoto Yokoo,et al.  ADOPT-ing: unifying asynchronous distributed optimization with asynchronous backtracking , 2009, Autonomous Agents and Multi-Agent Systems.

[46]  Enrico Pontelli,et al.  Improving DPOP with Branch Consistency for Solving Distributed Constraint Optimization Problems , 2014, CP.

[47]  Amnon Meisels,et al.  Concurrent forward bounding for distributed constraint optimization problems , 2012, Artif. Intell..

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

[49]  Victor R. Lesser,et al.  Solving distributed constraint optimization problems using cooperative mediation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[50]  Meritxell Vinyals,et al.  Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs , 2009, AAMAS.