A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Filters
DJAO: A Communication-Constrained DCOP Algorithm that Combines Features of ADOPT and Action-GDL
2014
PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE
Preserved Fulltext
In this paper we propose a novel DCOP algorithm, called DJAO, that is able toefficiently find a solution with low communication overhead; this algorithm can be used for optimal and bounded approximate ...
Our approach builds on distributed junction trees used in Action-GDL to represent independence relationsamong variables. ...
The Soft Filtering technique used in DJAO summarizes constraint functions to reduce communication required for transmitting such function. ...
doi:10.1609/aaai.v28i1.9129
fatcat:butx3zbw7fao3dz4yrpqe5ap2a
Distributed Constraint Optimization Problems and Applications: A Survey
2018
The Journal of Artificial Intelligence Research
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The field of multi-agent system (MAS) is an active area of research within artificial intelligence, with an increasingly important impact in industrial and other real-world applications. ...
Distributed Constraint Optimization Problems (DCOPs) have emerged as a prominent agent model to govern the agents' autonomous behavior, where both algorithms and communication models are driven by the ...
They are also thankful to Tiep Le for early discussions on Probabilistic DCOPs. The research in this paper has been partially supported by NSF grants 0947465, 1345232, 1401639, 1458595, and 1550662. ...
doi:10.1613/jair.5565
fatcat:zeou5gji5fas3h27ab4jxvtwkq
A Bound-Independent Pruning Technique to Speeding up Tree-Based Complete Search Algorithms for Distributed Constraint Optimization Problems
2021
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Complete search algorithms are important methods for solving Distributed Constraint Optimization Problems (DCOPs), which generally utilize bounds to prune the search space. ...
Specifically, BIP enables each agent to determine a subspace containing the optimal solution only from its local constraints along with running contexts, which can be further exploited by any search strategies ...
DPOP with function filtering [3] exploits utility bounds to reduce the size of message, where agents need to collect projected utilities to establish utility bounds. ...
doi:10.4230/lipics.cp.2021.41
fatcat:apnsxxn2trfdjlyay4xcvhudqe