Asynchronous Forward Bounding for Distributed COPs

01/15/2014
by   Amir Gershman, et al.
0

A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and compute bounds on partial assignments asynchronously. The asynchronous bounds computation is based on the propagation of partial assignments. The asynchronous forward-bounding algorithm (AFB) is a distributed optimization search algorithm that keeps one consistent partial assignment at all times. The algorithm is described in detail and its correctness proven. Experimental evaluation shows that AFB outperforms synchronous branch and bound by many orders of magnitude, and produces a phase transition as the tightness of the problem increases. This is an analogous effect to the phase transition that has been observed when local consistency maintenance is applied to MaxCSPs. The AFB algorithm is further enhanced by the addition of a backjumping mechanism, resulting in the AFB-BJ algorithm. Distributed backjumping is based on accumulated information on bounds of all values and on processing concurrently a queue of candidate goals for the next move back. The AFB-BJ algorithm is compared experimentally to other DisCOP algorithms (ADOPT, DPOP, OptAPO) and is shown to be a very efficient algorithm for DisCOPs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2014

BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm

Distributed constraint optimization (DCOP) problems are a popular way of...
research
09/27/2011

Asynchronous Partial Overlay: A New Algorithm for Solving Distributed Constraint Satisfaction Problems

Distributed Constraint Satisfaction (DCSP) has long been considered an i...
research
01/15/2014

Completeness and Performance Of The APO Algorithm

Asynchronous Partial Overlay (APO) is a search algorithm that uses coope...
research
02/06/2020

Block Distributed Majorize-Minimize Memory Gradient Algorithm and its application to 3D image restoration

Modern 3D image recovery problems require powerful optimization framewor...
research
12/08/2021

Pretrained Cost Model for Distributed Constraint Optimization Problems

Distributed Constraint Optimization Problems (DCOPs) are an important su...
research
11/13/2014

Handling owl:sameAs via Rewriting

Rewriting is widely used to optimise owl:sameAs reasoning in materialisa...
research
11/28/2019

HS-CAI: A Hybrid DCOP Algorithm via Combining Search with Context-based Inference

Search and inference are two main strategies for optimally solving Distr...

Please sign up or login with your details

Forgot password? Click here to reset