Analytical Foundations and the Shadow Theorem for Resilient Distributed Robotics

Read full text Summarise with VIRAT
Authors: Galli Marco
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

This document explores the formalization of the EFIR-Shadow (ESA) algorithm, an analytical framework designed to improve state estimation stability in distributed ROS2 architectures under conditions of severe information decoherence. By modeling uncertainty as a geometric property of the Information Field I(x,t)I(x,t)I(x,t), the work introduces the Shadow Theorem as a mechanism to handle communication scenarios characterized by significant packet loss (e.g., >70%). The proposed approach does not replace classical Bayesian estimators, such as the Kalman filter introduced by Rudolf E. Kalman, but complements them by providing a regime specifically suited for information collapse conditions. Experimental results obtained on heterogeneous Raspberry Pi 4/5 environments indicate a consistent improvement in tracking robustness and stability compared to standard stochastic estimation methods, particularly in the presence of non-Gaussian disturbances and network-induced decoherence.

Fields of Study & Subjects

Target Tracking and Data Fusion in Sensor Networks Robotics and Sensor-Based Localization Distributed Control Multi-Agent Systems

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
27 March 2026
Language
EN