Robust Multi-Agent Target Tracking in Intermittent Communication Environments via Analytical Belief Merging

• URL: http://arxiv.org/abs/2604.07575v1
• Date: Wed, 08 Apr 2026 20:27:48 GMT
• Title: Robust Multi-Agent Target Tracking in Intermittent Communication Environments via Analytical Belief Merging
• Abstract summary: We formulate the decentralized belief merging problem as Forward and Reverse Kullback-Leibler (KL) divergence optimizations.<n>By deploying these derivations, we mathematically eliminate optimization artifacts, achieving perfect mathematical fidelity.<n>We propose a novel spatially-aware visit-weighted KL merging strategy that dynamically weighs agent beliefs based on their physical visitation history.
• Score: 2.3559161556025887
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Autonomous multi-agent target tracking in GPS-denied and communication-restricted environments (e.g., underwater exploration, subterranean search and rescue, and adversarial domains) forces agents to operate independently and only exchange information during brief reconnection windows. Because transmitting complete observation and trajectory histories is bandwidth-exhaustive, exchanging probabilistic belief maps serves as a highly efficient proxy that preserves the topology of agent knowledge. While minimizing divergence metrics to merge these decentralized beliefs is conceptually sound, traditional approaches often rely on numerical solvers that introduce critical quantization errors and artificial noise floors. In this paper, we formulate the decentralized belief merging problem as Forward and Reverse Kullback-Leibler (KL) divergence optimizations and derive their exact closed-form analytical solutions. By deploying these derivations, we mathematically eliminate optimization artifacts, achieving perfect mathematical fidelity while reducing the computational complexity of the belief merge to $\mathcal{O}(N|S|)$ scalar operations. Furthermore, we propose a novel spatially-aware visit-weighted KL merging strategy that dynamically weighs agent beliefs based on their physical visitation history. Validated across tens of thousands of distributed simulations, extensive sensitivity analysis demonstrates that our proposed method significantly suppresses sensor noise and outperforms standard analytical means in environments characterized by highly degraded sensors and prolonged communication intervals.

Related papers

• Teacher Knows It Best: Spontaneous Symmetry Breaking and Tipping Points in Networked Langevin Dynamics AI Sycophancy [5.868852957948178]
  We formulate a statistical physics framework to model a networked dynamical system exhibiting bistability, driven by additive noise and social conformity.<n>We apply this model to understand and mitigate AI-induced delusional spiraling-a phenomenon where algorithmic sycophancy from Large Language Models continuously reinforces inaccurate beliefs.<n>We prove mathematically that under certain conditions, a highly concentrated, rapid intervention targeting massive hubs strictly outperforms a distributed, slow approach to rescue the network.
  arXiv  Detail & Related papers  (2026-07-27T11:47:57Z)
• Spectral Dynamics of Semantic Drift in Clinical Multi-Agent Language Model Networks [0.0]
  We show that localized dense cliques confine hallucinated data, preventing global consensus and forcing the system toward a permanent entropy saturation threshold.<n>By introducing dynamic spectral monitoring operating at an $mathcalO(N3)$ time complexity, we present a mathematically rigorous technique to ensure global state diffusion.
  arXiv  Detail & Related papers  (2026-07-23T20:20:45Z)
• Prototype-Anchored Generalized Manifold Regression for Unknown-Domain Object Detection [58.25418970608328]
  We study Single-Domain Generalized Object Detection (Single-DGOD), which aims to transfer a detector trained on a single source domain to multiple unseen domains.<n>Existing methods mainly rely on simulation-driven strategies, such as data augmentation or textual prompts, to enlarge the training distribution.<n>We propose Manifold Regression with Visual-Text Dual Chain-of-Thought (MR-DCoT), which formulates unknown-domain generalization as a manifold regression problem.
  arXiv  Detail & Related papers  (2026-07-08T09:27:15Z)
• Decentralized Pose Graph Riemannian Optimization for Object-based Multi-Robot SLAM [14.190643126006819]
  In object-based multi-robot SLAM, the problem becomes more tightly coupled because robots must jointly estimate both their trajectories and the poses of persistent objects observed by multiple agents.<n>Existing decentralized solutions often assume that the communication graph closely matches the physical interaction topology, which is restrictive in realistic deployments where communication is sparse, intermittent, or time-varying.<n>This paper presents a fully decentralized Riemannian optimization framework for object-based multi-robot PGO that decouples the coupled estimation problem via a consensus mechanism, enabling flexible communication topologies.
  arXiv  Detail & Related papers  (2026-06-23T12:21:34Z)
• Olfactory pursuit: catching a moving odor source in complex flows [0.5541644538483947]
  Odor signals are intermittent, strongly mixed by turbulent-like transport, and typically lag behind the true target position.<n>We formulate olfactory pursuit as a partially observable Markov decision process in which an agent maintains a joint belief over the target's position and velocity.<n>Our results identify predictive inference of target motion as the key ingredient for effective olfactory pursuit.
  arXiv  Detail & Related papers  (2026-04-13T15:52:24Z)
• A Secure and Private Distributed Bayesian Federated Learning Design [56.92336577799572]
  Distributed Federated Learning (DFL) enables decentralized model training across large-scale systems without a central parameter server.<n>DFL faces three critical challenges: privacy leakage from honest-but-curious neighbors, slow convergence due to the lack of central coordination, and vulnerability to Byzantine adversaries aiming to degrade model accuracy.<n>We propose a novel DFL framework that integrates Byzantine robustness, privacy preservation, and convergence acceleration.
  arXiv  Detail & Related papers  (2026-02-23T16:12:02Z)
• ICD-Net: Inertial Covariance Displacement Network for Drone Visual-Inertial SLAM [5.5217350574838875]
  We present ICD-Net, a novel framework that enhances visual-inertial SLAM performance.<n>Our approach significantly improved trajectory estimation accuracy compared to standard VINS-Fusion.<n>Our method shows that neural network enhancement can effectively address multiple sources of SLAM degradation.
  arXiv  Detail & Related papers  (2025-11-13T11:25:02Z)
• Distribution-Free Uncertainty-Aware Virtual Sensing via Conformalized Neural Operators [1.7864593554171284]
  Conformalized Monte Carlo Operator (CMCO) transforms neural operator-based virtual sensing with calibrated, distribution-free prediction intervals.<n>CMCO achieves spatially resolved uncertainty estimates without retraining, ensembling, or custom loss design.<n>This breakthrough offers a general-purpose, plug-and-play UQ solution for neural operators, unlocking real-time, trustworthy inference in digital twins, sensor fusion, and safety-critical monitoring.
  arXiv  Detail & Related papers  (2025-07-15T04:26:40Z)
• Beyond Patterns: Harnessing Causal Logic for Autonomous Driving Trajectory Prediction [10.21659221112514]
  We introduce a novel trajectory prediction framework that leverages causal inference to enhance predictive robustness, generalization, and accuracy.<n>Our findings highlight the potential of causal reasoning to transform trajectory prediction, paving the way for robust autonomous driving systems.
  arXiv  Detail & Related papers  (2025-05-11T05:56:07Z)
• Collaborative Value Function Estimation Under Model Mismatch: A Federated Temporal Difference Analysis [55.13545823385091]
  Federated reinforcement learning (FedRL) enables collaborative learning while preserving data privacy by preventing direct data exchange between agents.<n>In real-world applications, each agent may experience slightly different transition dynamics, leading to inherent model mismatches.<n>We show that even moderate levels of information sharing significantly mitigate environment-specific errors.
  arXiv  Detail & Related papers  (2025-03-21T18:06:28Z)
• Does Worst-Performing Agent Lead the Pack? Analyzing Agent Dynamics in Unified Distributed SGD [7.434126318858966]
  Distributed learning is essential to train machine learning algorithms across heterogeneous agents. We conduct an analysis of Unified Distributed SGD (UD-SGD) We assess how different sampling strategies, such as i.i.d. sampling, shuffling, and Markovian sampling, affect the convergence speed of UD-SGD.
  arXiv  Detail & Related papers  (2024-09-26T03:12:20Z)
• Over-the-Air Federated Learning and Optimization [52.5188988624998]
  We focus on Federated learning (FL) via edge-the-air computation (AirComp) We describe the convergence of AirComp-based FedAvg (AirFedAvg) algorithms under both convex and non- convex settings. For different types of local updates that can be transmitted by edge devices (i.e., model, gradient, model difference), we reveal that transmitting in AirFedAvg may cause an aggregation error. In addition, we consider more practical signal processing schemes to improve the communication efficiency and extend the convergence analysis to different forms of model aggregation error caused by these signal processing schemes.
  arXiv  Detail & Related papers  (2023-10-16T05:49:28Z)
• Compressed Regression over Adaptive Networks [58.79251288443156]
  We derive the performance achievable by a network of distributed agents that solve, adaptively and in the presence of communication constraints, a regression problem. We devise an optimized allocation strategy where the parameters necessary for the optimization can be learned online by the agents.
  arXiv  Detail & Related papers  (2023-04-07T13:41:08Z)
• Decentralized Local Stochastic Extra-Gradient for Variational Inequalities [125.62877849447729]
  We consider distributed variational inequalities (VIs) on domains with the problem data that is heterogeneous (non-IID) and distributed across many devices. We make a very general assumption on the computational network that covers the settings of fully decentralized calculations. We theoretically analyze its convergence rate in the strongly-monotone, monotone, and non-monotone settings.
  arXiv  Detail & Related papers  (2021-06-15T17:45:51Z)

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.