Greedy Kalman-Swarm: Improving State Estimation in Robot Swarms in Harsh Environments
Phunyapa Suksomboon, Paulo Garcia

TL;DR
The paper introduces a decentralized, greedy Kalman filtering approach for robot swarms that enhances collective state estimation accuracy in communication-limited and harsh environments.
Contribution
It presents a novel localized estimation method enabling robots to improve accuracy without global communication, balancing efficiency and robustness.
Findings
Simulations show effective state refinement using neighbor data.
Robust performance even with missing data.
Scalable approach suitable for unpredictable terrains.
Abstract
State estimation is a fundamental requirement in robotics, where the accurate determination of a robot's state is essential for stable operation despite inherent process disturbances and sensor noise. Traditionally, this is achieved through Kalman filtering, providing a statistically optimal estimate by balancing predictive models with noisy measurements. In the context of robotic swarms, the challenge shifts from individual accuracy to collective coordination, where the integration of global dynamics can significantly enhance the precision of the entire group. Existing estimation techniques rely on centralized processing or heavy communication protocols to reach a global consensus, which are frequently impractical in real-world deployments. Here we show that a localized, "greedy" approach to distributed state estimation (termed "Greedy Kalman-Swarm") allows individual robots to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
