Communication-Efficient Cooperative SLAMMOT via Determining the Number of Collaboration Vehicles
Susu Fang, Hao Li

TL;DR
This paper introduces a communication-efficient cooperative SLAMMOT method that dynamically determines the optimal number of collaborating vehicles to balance performance enhancement with communication costs in autonomous vehicle environments.
Contribution
It proposes a novel LiDAR-based approach that adaptively selects collaboration vehicles to improve perception while reducing communication overhead.
Findings
Achieves a good trade-off between performance and communication costs.
Outperforms previous methods in cooperative perception accuracy.
Effectively adapts the number of collaboration vehicles dynamically.
Abstract
The SLAMMOT, i.e. simultaneous localization, mapping, and moving object (detection and) tracking, represents an emerging technology for autonomous vehicles in dynamic environments. Such single-vehicle systems still have inherent limitations, such as occlusion issues. Inspired by SLAMMOT and rapidly evolving cooperative technologies, it is natural to explore cooperative simultaneous localization, mapping, moving object (detection and) tracking (C-SLAMMOT) to enhance state estimation for ego-vehicles and moving objects. C-SLAMMOT could significantly upgrade the single-vehicle performance by utilizing and integrating the shared information through communication among the multiple vehicles. This inevitably leads to a fundamental trade-off between performance and communication cost, especially in a scalable manner as the number of collaboration vehicles increases. To address this challenge,…
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.
Taxonomy
TopicsModular Robots and Swarm Intelligence · Robotic Path Planning Algorithms · Optimization and Search Problems
