Distributed constraint optimization problems and applications: A survey
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 …
intelligence, with an increasingly important impact in industrial and other real-world …
A tutorial on optimization for multi-agent systems
J Cerquides, A Farinelli, P Meseguer… - The Computer …, 2014 - academic.oup.com
Research on optimization in multi-agent systems (MASs) has contributed with a wealth of
techniques to solve many of the challenges arising in a wide range of multi-agent …
techniques to solve many of the challenges arising in a wide range of multi-agent …
[HTML][HTML] Explorative anytime local search for distributed constraint optimization
R Zivan, S Okamoto, H Peled - Artificial Intelligence, 2014 - Elsevier
Abstract Distributed Constraint Optimization Problems (DCOPs) are an elegant model for
representing and solving many realistic combinatorial problems that are distributed by …
representing and solving many realistic combinatorial problems that are distributed by …
Balancing exploration and exploitation in incomplete min/max-sum inference for distributed constraint optimization
Abstract Distributed Constraint Optimization Problems (DCOPs) are NP-hard and therefore
the number of studies that consider incomplete algorithms for solving them is growing …
the number of studies that consider incomplete algorithms for solving them is growing …
[PDF][PDF] Max/min-sum distributed constraint optimization through value propagation on an alternating DAG
R Zivan, H Peled - Proceedings of the 11th International Conference on …, 2012 - ifaamas.org
ABSTRACT Distributed Constraint Optimization Problems (DCOPs) are NP-hard and
therefore the number of studies that consider incomplete algorithms for solving them is …
therefore the number of studies that consider incomplete algorithms for solving them is …
A genetic algorithm based framework for local search algorithms for distributed constraint optimization problems
Z Chen, L Liu, J He, Z Yu - Autonomous Agents and Multi-Agent Systems, 2020 - Springer
Local search algorithms are widely applied in solving large-scale Distributed constraint
optimization problems (DCOPs) where each agent holds a value assignment to its variable …
optimization problems (DCOPs) where each agent holds a value assignment to its variable …
A large neighboring search schema for multi-agent optimization
Abstract The Distributed Constraint Optimization Problem (DCOP) is an elegant paradigm for
modeling and solving multi-agent problems which are distributed in nature, and where …
modeling and solving multi-agent problems which are distributed in nature, and where …
[HTML][HTML] Privacy preserving region optimal algorithms for symmetric and asymmetric DCOPs
Region-optimal algorithms are local search algorithms for solving Distributed Constraint
Optimization Problems (DCOPs). In each iteration of the search in such algorithms, every …
Optimization Problems (DCOPs). In each iteration of the search in such algorithms, every …
Improved bounded max-sum for distributed constraint optimization
E Rollon, J Larrosa - International Conference on Principles and Practice …, 2012 - Springer
Abstract Bounded Max-Sum is a message-passing algorithm for solving Distributed
Constraint Optimization Problems able to compute solutions with a guaranteed …
Constraint Optimization Problems able to compute solutions with a guaranteed …
Applying max-sum to asymmetric distributed constraint optimization problems
We study the adjustment and use of the Max-sum algorithm for solving Asymmetric
Distributed Constraint Optimization Problems (ADCOPs). First, we formalize asymmetric …
Distributed Constraint Optimization Problems (ADCOPs). First, we formalize asymmetric …