DeepAI AI Chat
Log In Sign Up

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

by   Dingding Chen, et al.
Chongqing University
Nanyang Technological University
NetEase, Inc

Search and inference are two main strategies for optimally solving Distributed Constraint Optimization Problems (DCOPs). Recently, several algorithms were proposed to combine their advantages. Unfortunately, such algorithms only use an approximated inference as a one-shot preprocessing phase to construct the initial lower bounds which lead to inefficient pruning under the limited memory budget. On the other hand, iterative inference algorithms (e.g., MB-DPOP) perform a context-based complete inference for all possible contexts but suffer from tremendous traffic overheads. In this paper, (i) hybridizing search with context-based inference, we propose a complete algorithm for DCOPs, named HS-CAI where the inference utilizes the contexts derived from the search process to establish tight lower bounds while the search uses such bounds for efficient pruning and thereby reduces contexts for the inference. Furthermore, (ii) we introduce a context evaluation mechanism to select the context patterns for the inference to further reduce the overheads incurred by iterative inferences. Finally, (iii) we prove the correctness of our algorithm and the experimental results demonstrate its superiority over the state-of-the-art.


page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8


PT-ISABB: A Hybrid Tree-based Complete Algorithm to Solve Asymmetric Distributed Constraint Optimization Problems

Asymmetric Distributed Constraint Optimization Problems (ADCOPs) have em...

Solving DCOPs with Distributed Large Neighborhood Search

The field of Distributed Constraint Optimization has gained momentum in ...

RMB-DPOP: Refining MB-DPOP by Reducing Redundant Inferences

MB-DPOP is an important complete algorithm for solving Distributed Const...

Solving the Steiner Tree Problem with few Terminals

The Steiner tree problem is a well-known problem in network design, rout...

Tight Lower Bounds for Weighted Matroid Problems

In this paper we derive tight lower bounds resolving the hardness status...

Asynchronous Forward Bounding for Distributed COPs

A new search algorithm for solving distributed constraint optimization p...

AsymDPOP: Complete Inference for Asymmetric Distributed Constraint Optimization Problems

Asymmetric distributed constraint optimization problems (ADCOPs) are an ...