cs.ROApr 8, 2026

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

Authors: Mohamed Abdelnaby, Samuel Honor, Kevin Leahy

Organizations: Department of Robotics Engineering, Worcester Polytechnic Institute (WPI), Worcester, MA 01609, USA.

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 O(N∣S∣)\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.

Figures & tables

Explore similar work

Oct 5, 2026

Entropy-Gated Belief Coordination for Decentralized Multi-Agent Search Under Intermittent Communication

We study decentralized multi-agent target search where homogeneous agents communicate intermittently at Poisson-distributed times. Standard unconditional belief fusion wastes communication opportunities by synchronizing agents during high-entropy exploration, when diverse independent beliefs provide better coverage than a premature consensus. We introduce entropy-gated belief coordination, in which agents skip fusion while their collective entropy ratio exceeds a threshold~θθ and merge only during exploitation, consistent with the bifurcation structure of nonlinear opinion dynamics and the submodular structure of the per-step information gain objective. We further derive \Istep(α,β)\Istep(α,β), the expected mutual information per observation step between two agents' binary sensors, as an interpretable, communication-free measure of sensor informativeness that motivates the gating design and guides system-level analysis. Experiments across 103{,}680 trials (nine grid sizes up to 100×100100{\times}100, Poisson communication timing, four target movement patterns) show that the Entropy-Gated Trust-Decay Planner (EG-TDP), which adds a detection-probability planner switch in exploitation mode, achieves mean belief quality Qˉ=0.300\bar{Q}=0.300 (mean belief mass at the true target cell, averaged across all trials and steps), a 58.9%58.9\% gain over arithmetic mean and a 37.4%37.4\% gain over visit-weighted fusion. On representative configurations, EG-TDP also outperforms a joint-Bayesian reference that uses all agents'~observations at every step, despite operating under random intermittent contact only.
Oct 2, 2026

Resilient Multi-Agent Target Localization and Tracking via BAG-Aware Mutual Information Maximization under False Data Injection Attacks

Cooperative multi-agent networks deployed for target localization and tracking remain critically vulnerable to malicious cyberattacks, since a single compromised agent can corrupt the centralized target belief and mislead the estimation process across the entire network. This paper presents a resilient multi-agent target localization and tracking framework under a limited agent sensing range and false-data injection (FDI) attacks. The proposed method combines information-based navigation for target search and posterior target state uncertainty reduction, Bayesian attack graph (BAG) based attack detection for probabilistic identification of the compromised agents, and reachable set-guided recovery that guides the uncompromised agents to relocalize the target when the sole localizing agent is attacked. The framework preserves the network localization capability after an attack by trust-gating compromised sensing information and guiding attack-immune agents toward a dynamically constructed recovery set representing the new target belief using a Linear Quadratic Regulator (LQR). Simulation validates that the proposed framework maintains a robust tracking performance under FDI attacks, demonstrating the potential for resilient autonomy in safety-critical applications.
Apr 5, 2026

Resilient Decentralized Ergodic Coverage for Scalable Multi-Robot Systems in Unknown Time-Varying Environments

Maintaining situational awareness in high-stakes multi-robot applications requires balancing exploration of unobserved regions with sustained monitoring of changing Regions of Interest (ROIs), often under unknown and time-varying distributions, partial observability, and limited communication. We propose a decentralized multi-agent coverage framework that serves as a high-level planning strategy, in which each agent computes an adaptive ergodic policy, implemented via a Markov-chain, that tracks an updated belief over the underlying importance map. Beliefs are maintained online via Gaussian Process (GP) regression from local noisy observations exchanged with neighbors. The resulting policy drives agents to spend time in ROIs in proportion to their estimated importance, while preserving sufficient exploration to detect and adapt to time-varying environmental changes. Unlike existing approaches that assume known importance maps, centralized coordination, or a static environment, our framework addresses the combined challenges of unknown, time-varying distributions under a decentralized, partially observable setting. We further show that our framework is robust to communication and memory degradation, robot loss, and can scale up to hundreds of robots.