Communication-Aware Local Search for Distributed Constraint Optimization.

Ben Rachmut, Roie Zivan, William Yeoh

Research output: Contribution to journalArticlepeer-review

Abstract

Most studies investigating models and algorithms for distributed constraint optimization problems (DCOPs) assume that messages arrive instantaneously and are never lost. Specifically, distributed local search DCOP algorithms, have been designed as synchronous algorithms (i.e., they perform in synchronous iterations in which each agent exchanges messages with all its neighbors), despite running in asynchronous environments. This is true also for an anytime mechanism that reports the best solution explored during the run of synchronous distributed local search algorithms. Thus, when the assumption of perfect communication is relaxed, the properties that were established for the state-of-the-art local search algorithms and the anytime mechanism may not necessarily apply.
Original languageEnglish
Pages (from-to)637-675
Number of pages39
JournalJournal of Artificial Intelligence Research
Volume75
DOIs
StatePublished - Oct 2022

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Communication-Aware Local Search for Distributed Constraint Optimization.'. Together they form a unique fingerprint.

Cite this