Heterogeneous message passing for heterogeneous networks

GT Cantwell, A Kirkley, F Radicchi - Physical Review E, 2023 - APS
Message passing (MP) is a computational technique used to find approximate solutions to a
variety of problems defined on networks. MP approximations are generally accurate in …

Deep attentive belief propagation: Integrating reasoning and learning for solving constraint optimization problems

Y Deng, S Kong, C Liu, B An - Advances in Neural …, 2022 - proceedings.neurips.cc
Belief Propagation (BP) is an important message-passing algorithm for various reasoning
tasks over graphical models, including solving the Constraint Optimization Problems …

Collision avoiding max-sum for mobile sensor teams

A Pertzovsky, R Zivan, N Agmon - Journal of Artificial Intelligence Research, 2024 - jair.org
Recent advances in technology have large teams of robots with limited computation skills
work together in order to achieve a common goal. Their personal actions need to contribute …

Effect of asynchronous execution and imperfect communication on max-sum belief propagation

R Zivan, B Rachmut, O Perry, W Yeoh - Autonomous Agents and Multi …, 2023 - Springer
Max-sum is a version of belief propagation that was adapted for solving distributed
constraint optimization problems. It has been studied theoretically and empirically, extended …

Separate but equal: Equality in belief propagation for single-cycle graphs

E Cohen, B Rachmut, O Lev, R Zivan - Artificial Intelligence, 2025 - Elsevier
Belief propagation is a widely used, incomplete optimization algorithm whose main
theoretical properties hold only under the assumption that beliefs are not equal …

[PDF][PDF] CAMS: collision avoiding max-sum for mobile sensor teams

A Pertzovskiy, R Zivan, N Agmon - Proceedings of the 2023 …, 2023 - ifaamas.org
Some of the most challenging multi agent applications involve teams of mobile sensing
agents that are required to acquire information in a given area. Examples for such …

Privacy preserving solution of DCOPs by mediation

P Kogan, T Tassa, T Grinshpoun - Artificial Intelligence, 2023 - Elsevier
In this study, we propose a new paradigm for solving DCOPs, whereby the agents delegate
the computational task to a set of external mediators who perform the computations for them …

Inference-based complete algorithms for asymmetric distributed constraint optimization problems

D Chen, Z Chen, Y Deng, Z He, L Wang - Artificial Intelligence Review, 2023 - Springer
Asymmetric distributed constraint optimization problems (ADCOPs) are an important
framework for multiagent coordination and optimization, where each agent has its personal …

Utility distribution matters: Enabling fast belief propagation for multi-agent optimization with dense local utility function

Y Deng, B An - Autonomous Agents and Multi-Agent Systems, 2021 - Springer
Belief propagation algorithms including Max-sum and its variants are important methods for
multi-agent optimization. However, they face a significant scalability challenge as the …

The effect of asynchronous execution and message latency on max-sum

R Zivan, O Perry, B Rachmut… - … Conference on Principles …, 2021 - drops.dagstuhl.de
Max-sum is a version of belief propagation that was adapted for solving distributed
constraint optimization problems (DCOPs). It has been studied theoretically and empirically …