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

02/16/2019
by   Yanchen Deng, et al.
0

Asymmetric Distributed Constraint Optimization Problems (ADCOPs) have emerged as an important formalism in multi-agent community due to their ability to capture personal preferences. However, the existing search-based complete algorithms for ADCOPs can only use local knowledge to compute lower bounds, which leads to inefficient pruning and prohibits them from solving large scale problems. On the other hand, inference-based complete algorithms (e.g., DPOP) for Distributed Constraint Optimization Problems (DCOPs) require only a linear number of messages, but they cannot be directly applied into ADCOPs due to a privacy concern. Therefore, in the paper, we consider the possibility of combining inference and search to effectively solve ADCOPs at an acceptable loss of privacy. Specifically, we propose a hybrid complete algorithm called PT-ISABB which uses a tailored inference algorithm to provide tight lower bounds and a tree-based complete search algorithm to exhaust the search space. We prove the correctness of our algorithm and the experimental results demonstrate its superiority over other state-of-the-art complete algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

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...
research
05/28/2019

AsymDPOP: Complete Inference for Asymmetric Distributed Constraint Optimization Problems

Asymmetric distributed constraint optimization problems (ADCOPs) are an ...
research
02/22/2017

Solving DCOPs with Distributed Large Neighborhood Search

The field of Distributed Constraint Optimization has gained momentum in ...
research
02/04/2014

Asymmetric Distributed Constraint Optimization Problems

Distributed Constraint Optimization (DCOP) is a powerful framework for r...
research
02/15/2019

Privacy of Existence of Secrets: Introducing Steganographic DCOPs and Revisiting DCOP Frameworks

Here we identify a type of privacy concern in Distributed Constraint Opt...
research
11/09/2020

Solving the Steiner Tree Problem with few Terminals

The Steiner tree problem is a well-known problem in network design, rout...
research
12/08/2021

Pretrained Cost Model for Distributed Constraint Optimization Problems

Distributed Constraint Optimization Problems (DCOPs) are an important su...

Please sign up or login with your details

Forgot password? Click here to reset