Optimal Transport-Based Decentralized Multi-Agent Distribution Matching

• URL: http://arxiv.org/abs/2601.00548v2
• Date: Mon, 23 Feb 2026 22:01:26 GMT
• Title: Optimal Transport-Based Decentralized Multi-Agent Distribution Matching
• Abstract summary: Decentralized framework for distribution matching in multi-agent systems.<n>Problem is formulated using optimal transport (Wasserstein distance)<n>System operates fully in a decentralized manner.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper presents a decentralized control framework for distribution matching in multi-agent systems (MAS), where agents collectively achieve a prescribed terminal spatial distribution. The problem is formulated using optimal transport (Wasserstein distance), which provides a principled measure of distributional discrepancy and serves as the basis for the control design. To avoid solving the global optimal transport problem directly, the distribution-matching objective is reformulated into a tractable per-agent decision process, enabling each agent to identify its desired terminal locations using only locally available information. A sequential weight-update rule is introduced to construct feasible local transport plans, and a memory-based correction mechanism is incorporated to maintain reliable operation under intermittent and range-limited communication. Convergence guarantees are established, showing cycle-wise improvement of a surrogate transport cost under both linear and nonlinear agent dynamics. Simulation results demonstrate that the proposed framework achieves effective and scalable distribution matching while operating fully in a decentralized manner.

Related papers

• Coupled Optimal Transport with Landmark Constraints [64.98367856457412]
  An optimal transport (OT) model seeks a map or plan between distributions by minimizing a prescribed transport cost or distortion.<n>This paper proposes a novel coupled OT framework that leverages a small number of annotated landmarks to guide the recovery of an underlying deformation.<n>The proposed framework provides a principled connection between landmark-based registration and transport-based distribution matching.
  arXiv  Detail & Related papers  (2026-08-20T08:28:13Z)
• Semi-Decentralized Multi-Spacecraft Collision Avoidance under Communication Constraints [22.71668728031368]
  Current spacecraft collision-avoidance operations rely on intermittent ground-station contacts, requiring operators to plan with delayed and asynchronously updated information.<n>We formulate a semi-decentralized POMDP (SDec-POMDP) where we govern information propagation directly by realistic ground-station visibility windows.<n>Results show that semi-decentralized planning recovers near-centralized maneuver quality while requiring 28.5% fewer synchronization events than continuous coordination.
  arXiv  Detail & Related papers  (2026-07-29T07:48:18Z)
• Distributed Motion Planning with Safety Guarantees for Self-Reconfiguring Robotic Boats [76.98547580312116]
  This paper proposes a hybrid framework that combines distributed Model Predictive Control (MPC) with Control Barrier Functions (CBFs)<n>To ensure safety in real time, distributed CBF-based filters are applied to enforce inter-agent avoidance.
  arXiv  Detail & Related papers  (2026-07-22T16:37:05Z)
• Inference-Time Attribute Distribution Alignment for Unconditional Diffusion [54.28942858023809]
  We formalize the inference-time attribute distributional alignment problem for pretrained unconditional diffusion models.<n>To address this, we cast inference-time attribute distributional alignment as an optimal control problem over the reverse diffusion process.<n>We solve for the perturbations using an optimal-control-based algorithm to optimize a differentiable distribution-matching objective.
  arXiv  Detail & Related papers  (2026-05-08T09:02:47Z)
• Mean-Field Path-Integral Diffusion: From Samples to Interacting Agents [0.0]
  Mean-Field Path-Integral Diffusion (MF-PID) is a framework in which samples are promoted to interacting agents whose drift depends self-consistently on the evolving population density.<n>MF-PID achieves 19--24% reductions in cumulative control energy over independent-agent baselines while matching the prescribed terminal distribution exactly.
  arXiv  Detail & Related papers  (2026-02-23T21:14:06Z)
• Event-Triggered Gossip for Distributed Learning [61.70659996356528]
  We develop a new event-triggered gossip framework for distributed learning to reduce inter-node communication.<n>We analyze bf71.61% with only a marginal performance loss, compared with the conventional full-text-of-the-art distributed learning methods.
  arXiv  Detail & Related papers  (2026-02-22T10:13:43Z)
• Local adapt-then-combine algorithms for distributed nonsmooth optimization: Achieving provable communication acceleration [50.67878993903822]
  We propose a communication-efficient Adapt-Then-Combine (ATC) framework, FlexATC, unifying numerous ATC-based distributed algorithms.<n>We show for the first time that local updates provably lead to communication acceleration for ATC-based distributed algorithms.
  arXiv  Detail & Related papers  (2026-02-18T02:47:05Z)
• AI-Augmented Density-Driven Optimal Control (D2OC) for Decentralized Environmental Mapping [0.0]
  This paper presents an AI-augmented decentralized framework for multi-agent (multi-robot) environmental mapping under limited sensing and communication.<n>The proposed method introduces an adaptive and self-correcting mechanism that enables agents to iteratively refine local density estimates.
  arXiv  Detail & Related papers  (2026-01-28T23:55:02Z)
• Deep Neural Network-Based Aerial Transport in the Presence of Cooperative and Uncooperative UAS [3.437656066916039]
  We present a resilient deep neural network (DNN) framework for decentralized transport and coverage using uncrewed aerial systems (UAS) operating in $mathbbRn$.<n>The framework is explicitly designed to remain robust in the presence of uncooperative agents that deviate from or refuse to follow the prescribed protocol.
  arXiv  Detail & Related papers  (2025-12-06T22:03:41Z)
• Designing Ambiguity Sets for Distributionally Robust Optimization Using Structural Causal Optimal Transport [21.387312729118364]
  We propose incorporating structural equations, which include causal graph information, to enhance ambiguity sets.<n>We show how our method overcomes the curse of dimensionality in optimal transport problems, achieving faster shrinkage with-free order.
  arXiv  Detail & Related papers  (2025-10-01T07:26:47Z)
• Distributed Policy Gradient for Linear Quadratic Networked Control with Limited Communication Range [23.500806437272487]
  We show that it is possible to approximate the exact gradient only using local information. Compared with the centralized optimal controller, the performance gap decreases to zero exponentially as the communication and control ranges increase.
  arXiv  Detail & Related papers  (2024-03-05T15:38:54Z)
• Distributed Markov Chain Monte Carlo Sampling based on the Alternating Direction Method of Multipliers [143.6249073384419]
  In this paper, we propose a distributed sampling scheme based on the alternating direction method of multipliers. We provide both theoretical guarantees of our algorithm's convergence and experimental evidence of its superiority to the state-of-the-art. In simulation, we deploy our algorithm on linear and logistic regression tasks and illustrate its fast convergence compared to existing gradient-based methods.
  arXiv  Detail & Related papers  (2024-01-29T02:08:40Z)
• Generalized Schrödinger Bridge Matching [54.171931505066]
  Generalized Schr"odinger Bridge (GSB) problem setup is prevalent in many scientific areas both within and without machine learning. We propose Generalized Schr"odinger Bridge Matching (GSBM), a new matching algorithm inspired by recent advances. We show that such a generalization can be cast as solving conditional optimal control, for which variational approximations can be used.
  arXiv  Detail & Related papers  (2023-10-03T17:42:11Z)
• Decentralized Entropic Optimal Transport for Distributed Distribution Comparison [28.122302344024387]
  We propose a novel decentralized entropic optimal transport (DEOT) method, which provides a communication-efficient and privacy-preserving solution to this problem. In particular, we design a mini-batch randomized block-coordinate descent scheme to optimize the DEOT distance in its dual form. We show that the proposed MRBCD scheme and kernel approximation method also apply to entropic Gromov-Wasserstein distance.
  arXiv  Detail & Related papers  (2023-01-28T02:47:42Z)
• Multi-Agent MDP Homomorphic Networks [100.74260120972863]
  In cooperative multi-agent systems, complex symmetries arise between different configurations of the agents and their local observations. Existing work on symmetries in single agent reinforcement learning can only be generalized to the fully centralized setting. This paper introduces Multi-Agent MDP Homomorphic Networks, a class of networks that allows distributed execution using only local information.
  arXiv  Detail & Related papers  (2021-10-09T07:46:25Z)
• Global Distance-distributions Separation for Unsupervised Person Re-identification [93.39253443415392]
  Existing unsupervised ReID approaches often fail in correctly identifying the positive samples and negative samples through the distance-based matching/ranking. We introduce a global distance-distributions separation constraint over the two distributions to encourage the clear separation of positive and negative samples from a global view. We show that our method leads to significant improvement over the baselines and achieves the state-of-the-art performance.
  arXiv  Detail & Related papers  (2020-06-01T07:05:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.