Compute-Bound and Low-Bandwidth Distributed 3D Graph-SLAM
Jincheng Zhang, Andrew R. Willis, Jamie Godwin

TL;DR
This paper introduces a distributed 3D SLAM map-building architecture that adapts to bandwidth and computational constraints using a novel ultra-fast 3D point cloud compression method, enabling resource-limited robots to perform effective SLAM.
Contribution
The paper presents a new adaptive 3D compression algorithm integrated with DVO SLAM, allowing resource-constrained robots to efficiently build and share 3D maps.
Findings
Compression algorithm is ultra-fast and adaptive.
Enables resource-limited platforms to perform 3D SLAM.
Improves communication efficiency for distributed mapping.
Abstract
This article describes a new approach for distributed 3D SLAM map building. The key contribution of this article is the creation of a distributed graph-SLAM map-building architecture responsive to bandwidth and computational needs of the robotic platform. Responsiveness is afforded by the integration of a 3D point cloud to plane cloud compression algorithm that approximates dense 3D point cloud using local planar patches. Compute bound platforms may restrict the computational duration of the compression algorithm and low-bandwidth platforms can restrict the size of the compression result. The backbone of the approach is an ultra-fast adaptive 3D compression algorithm that transforms swaths of 3D planar surface data into planar patches attributed with image textures. Our approach uses DVO SLAM, a leading algorithm for 3D mapping, and extends it by computationally isolating map…
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
TopicsRobotics and Sensor-Based Localization · Modular Robots and Swarm Intelligence · Robotic Path Planning Algorithms
