Collective Ranking of Environmental Signals through Gaussian Belief Propagation in a Patrolling Robot Swarm

• URL: http://arxiv.org/abs/2608.17690v1
• Date: Tue, 18 Aug 2026 12:06:31 GMT
• Title: Collective Ranking of Environmental Signals through Gaussian Belief Propagation in a Patrolling Robot Swarm
• Abstract summary: Multi-robot patrolling requires a team to visit all areas of an environment at regular intervals, typically minimising idleness.<n>A practical extension, motivated by security and environmental monitoring, is to additionally form a collective ranking of all patrol locations by some measured signal.<n>We observe that the patrol graph admits a natural dual interpretation: it is simultaneously the topology that dictates agent movement and a factor graph over which spatial beliefs can be propagated.
• Score: 1.1479574890493918
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-robot patrolling requires a team to visit all areas of an environment at regular intervals, typically minimising idleness. A practical extension, motivated by security and environmental monitoring, is to additionally form a collective ranking of all patrol locations by some measured signal, a generalisation of the best-of-n problem to the many-option, continuous-valued regime. We observe that the patrol graph admits a natural dual interpretation: it is simultaneously the topology that dictates agent movement and a factor graph over which spatial beliefs can be propagated. Exploiting this equivalence, we apply Gaussian Belief Propagation (GBP), a graph-based algorithm, to collective ranking using unary measurement factors at visited nodes and pairwise smoothness factors along patrol edges. We compare GBP against simple and visit-count-weighted averaging across a range of sensor-noise conditions in simulation, and validate the approach on four Leo Rovers tracking a propagating radio signal in an office lobby. GBP outperforms both baselines on ranking accuracy, mean squared error, and time to consensus. We find that as noise increases and the task becomes harder, GBP degrades gracefully in simulation while both averaging methods degrade substantially. Hardware trials reproduce the same performance ordering on a real propagating radio signal, supporting the practical relevance of the simulated results.

Related papers

• Survey of Novel Deep Learning Architectures for Denoising Gravitational-wave Signals [0.0]
  We present the first controlled comparison of five neural-network architectures for gravitational-wave denoising.<n>We train identically across the full astrophysically-motivated spinning binary-black-hole parameter space.<n>A unifying principle emerges: matching network structure to the spectral anatomy of a coalescence outperforms brute-force model scaling.
  arXiv  Detail & Related papers  (2026-09-07T18:00:10Z)
• Latent Reward Registers for Diffusion Preference Alignment [46.49072106092868]
  We propose Latent Reward Registers, a mechanism that estimates terminal preference directly from intermediate noisy latents.<n>This independent readout mechanism extracts latent reward evidence without altering the generator's hidden states or velocity field.<n>For training, Reward-Gradient On-Policy Distillation (RG-OPD) distills reward-guided updates along on-policy trajectories, bypassing the computationally expensive rollouts of standard policy gradients.<n>For inference, Reward-Guided Sampling (RGS) steers trajectories via magnitude-matched reward gradients without parameter updates.
  arXiv  Detail & Related papers  (2026-08-04T17:00:52Z)
• Scalable Policy Optimization for Networked Multi-Agent Reinforcement Learning with Continuous State-Action Spaces [16.43184149906767]
  We develop an algorithm for cooperative reinforcement learning in networked decision processes with continuous state and action spaces.<n>Each agent maintains a local actor over a graph neighborhood, and a localized temporal-difference critic evaluates a truncated actionvalue function.
  arXiv  Detail & Related papers  (2026-07-20T22:41:43Z)
• Dynamic Spectral Denoising with Global-Context Attention for Multi-Behavior Recommendation [58.33732779555114]
  We argue that the key bottleneck is a representation-level failure caused by two coupled heterogeneities.<n>We propose Dynamic Spectral Denoising with Global-Context Attention for Multi-Behavior Recommendation (SpectraMB)<n>SpectraMB achieves the best results in most evaluation settings and exhibits improved robustness under noisy interactions.
  arXiv  Detail & Related papers  (2026-06-01T15:58:13Z)
• SMKC: Sketch Based Kernel Correlation Images for Variable Cardinality Time Series Anomaly Detection [0.0]
  In operational environments, monitoring systems frequently experience sensor churn.<n>We propose SMKC, a framework that decouples the dynamic input structure from the anomaly detector.<n>We find that a detector using random projections and nearest neighbors on the SMKC representation performs competitively with fully trained baselines.
  arXiv  Detail & Related papers  (2026-01-28T21:15:11Z)
• A Sensing Dataset Protocol for Benchmarking and Multi-Task Wireless Sensing [45.99328292838584]
  We propose the Sensing dataset Protocol (SDP), a protocol-level specification and benchmark framework for large-scale wireless sensing.<n>SDP defines how heterogeneous wireless signals are mapped into a unified perception data-block schema.<n>A unified benchmark is established for detection, recognition, and vital-sign estimation with consistent preprocessing, training, and evaluation.
  arXiv  Detail & Related papers  (2025-12-13T05:01:30Z)
• Isolation-based Spherical Ensemble Representations for Anomaly Detection [60.989157958972356]
  Anomaly detection is a critical task in data mining and management with applications spanning fraud detection, network security, and log monitoring.<n>Existing unsupervised anomaly detection methods face fundamental challenges including conflicting distributional assumptions, computational inefficiency, and difficulty handling different anomaly types.<n>We propose ISER (Isolation-based Spherical Ensemble Representations) that extends existing isolation-based methods by using hypersphere radii as proxies for local density characteristics while maintaining linear time and constant space complexity.
  arXiv  Detail & Related papers  (2025-10-15T09:00:05Z)
• Unsupervised Detection of Spatiotemporal Anomalies in PMU Data Using Transformer-Based BiGAN [0.0]
  We introduce T-BiGAN, a framework that window-attention Transformers within a bidirectional Generative Adversarial Network (BiGAN)<n>Its encoderdecoder captures architecture while discriminator enforces cycle consistency to align latent space with the true data distribution.<n>Anomalies are flagged in real-time using an adaptive score that combines reconstruction error, latent space drift, and discriminator confidence.
  arXiv  Detail & Related papers  (2025-09-30T00:16:35Z)
• Ecologically Valid Benchmarking and Adaptive Attention: Scalable Marine Bioacoustic Monitoring [2.558238597112103]
  GetNetUPAM is a nested cross-validation framework to model stability under realistic variability.<n>Data are partitioned into distinct site-year segments, preserving recording and ensuring each validation fold reflects a unique environmental subset.<n>ARPA-N achieves a 14.4% gain in average precision over DenseNet baselines and a log2-scale order-of-magnitude drop in variability across all metrics.
  arXiv  Detail & Related papers  (2025-09-04T22:03:05Z)
• PAUL: Uncertainty-Guided Partition and Augmentation for Robust Cross-View Geo-Localization under Noisy Correspondence [16.322806051944227]
  Cross-view geo-localization is a critical task for UAV navigation, event detection, and aerial surveying.<n>Most existing approaches embed multi-modal data into a joint feature space to maximize the similarity of paired images.<n>These methods typically assume perfect alignment of image pairs during training, which rarely holds true in real-world scenarios.
  arXiv  Detail & Related papers  (2025-08-27T17:21:22Z)
• Learning a Fast Mixing Exogenous Block MDP using a Single Trajectory [87.62730694973696]
  STEEL is the first provably sample-efficient algorithm for learning the controllable dynamics of an Exogenous Block Markov Decision Process from a single trajectory.<n>We prove that STEEL is correct and sample-efficient, and demonstrate STEEL on two toy problems.
  arXiv  Detail & Related papers  (2024-10-03T21:57:21Z)
• Clustered Switchback Designs for Experimentation Under Spatio-temporal Interference [44.644520116360106]
  We estimate the global average treatment effect (GATE), the difference between average outcomes having exposed all units at all times to treatment or to control.<n>We propose a clustered switchback design, where units are grouped into clusters and time steps are grouped into blocks.<n>We show that for graphs that admit good clustering, a truncated Horvitz-Thompson estimator achieves a $tilde O(1/NT)$ mean squared error (MSE)<n>Our results simultaneously generalize the results from citethu2022switchback,ugander2013graph and citetleung2022rate
  arXiv  Detail & Related papers  (2023-12-25T01:00:58Z)

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.