Solving DCOPs with Distributed Large Neighborhood Search

02/22/2017
by   Ferdinando Fioretto, et al.
0

The field of Distributed Constraint Optimization has gained momentum in recent years, thanks to its ability to address various applications related to multi-agent cooperation. Nevertheless, solving Distributed Constraint Optimization Problems (DCOPs) optimally is NP-hard. Therefore, in large-scale, complex applications, incomplete DCOP algorithms are necessary. Current incomplete DCOP algorithms suffer of one or more of the following limitations: they (a) find local minima without providing quality guarantees; (b) provide loose quality assessment; or (c) are unable to benefit from the structure of the problem, such as domain-dependent knowledge and hard constraints. Therefore, capitalizing on strategies from the centralized constraint solving community, we propose a Distributed Large Neighborhood Search (D-LNS) framework to solve DCOPs. The proposed framework (with its novel repair phase) provides guarantees on solution quality, refining upper and lower bounds during the iterative process, and can exploit domain-dependent structures. Our experimental results show that D-LNS outperforms other incomplete DCOP algorithms on both structured and unstructured problem instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/22/2017

A Realistic Dataset for the Smart Home Device Scheduling Problem for DCOPs

The field of Distributed Constraint Optimization has gained momentum in ...
research
05/07/2014

Logic and Constraint Logic Programming for Distributed Constraint Optimization

The field of Distributed Constraint Optimization Problems (DCOPs) has ga...
research
02/28/2023

Ask and You Shall be Served: Representing and Solving Multi-agent Optimization Problems with Service Requesters and Providers

In scenarios with numerous emergencies that arise and require the assist...
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
06/19/2018

Approximation Strategies for Incomplete MaxSAT

Incomplete MaxSAT solving aims to quickly find a solution that attempts ...
research
02/16/2019

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

Asymmetric Distributed Constraint Optimization Problems (ADCOPs) have em...
research
09/02/2020

On Population-Based Algorithms for Distributed Constraint Optimization Problems

Distributed Constraint Optimization Problems (DCOPs) are a widely studie...

Please sign up or login with your details

Forgot password? Click here to reset