Compute-Bound and Low-Bandwidth Distributed 3D Graph-SLAM

• URL: http://arxiv.org/abs/2005.10222v1
• Date: Wed, 20 May 2020 17:39:55 GMT
• Title: Compute-Bound and Low-Bandwidth Distributed 3D Graph-SLAM
• Authors: Jincheng Zhang, Andrew R. Willis and Jamie Godwin
• Abstract summary: 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.
• Score: 1.0435741631709405
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 integration tasks from local Guidance, Navigation, and Control tasks and includes an addition of a network protocol to share the compressed plane clouds. The joint effect of these contributions allows agents with 3D sensing capabilities to calculate and communicate compressed map information commensurate with their onboard computational resources and communication channel capacities. This opens SLAM mapping to new categories of robotic platforms that may have computational and memory limits that prohibit other SLAM solutions.

Related papers

• MinkUNeXt: Point Cloud-based Large-scale Place Recognition using 3D Sparse Convolutions [1.124958340749622]
  MinkUNeXt is an effective and efficient architecture for place-recognition from point clouds entirely based on the new 3D MinkNeXt Block. A thorough assessment of the proposal has been carried out using the Oxford RobotCar and the In-house datasets.
  arXiv  Detail & Related papers  (2024-03-12T12:25:54Z)
• 3D Point Cloud Compression with Recurrent Neural Network and Image Compression Methods [0.0]
  Storing and transmitting LiDAR point cloud data is essential for many AV applications. Due to the sparsity and unordered structure of the data, it is difficult to compress point cloud data to a low volume. We propose a new 3D-to-2D transformation which allows compression algorithms to efficiently exploit spatial correlations.
  arXiv  Detail & Related papers  (2024-02-18T19:08:19Z)
• SeMLaPS: Real-time Semantic Mapping with Latent Prior Networks and Quasi-Planar Segmentation [53.83313235792596]
  We present a new methodology for real-time semantic mapping from RGB-D sequences. It combines a 2D neural network and a 3D network based on a SLAM system with 3D occupancy mapping. Our system achieves state-of-the-art semantic mapping quality within 2D-3D networks-based systems.
  arXiv  Detail & Related papers  (2023-06-28T22:36:44Z)
• 4DSR-GCN: 4D Video Point Cloud Upsampling using Graph Convolutional Networks [29.615723135027096]
  We propose a new solution for upscaling and restoration of time-varying 3D video point clouds after they have been compressed. Our model consists of a specifically designed Graph Convolutional Network (GCN) that combines Dynamic Edge Convolution and Graph Attention Networks.
  arXiv  Detail & Related papers  (2023-06-01T18:43:16Z)
• DSVT: Dynamic Sparse Voxel Transformer with Rotated Sets [95.84755169585492]
  We present Dynamic Sparse Voxel Transformer (DSVT), a single-stride window-based voxel Transformer backbone for outdoor 3D perception. Our model achieves state-of-the-art performance with a broad range of 3D perception tasks.
  arXiv  Detail & Related papers  (2023-01-15T09:31:58Z)
• Mesh Convolution with Continuous Filters for 3D Surface Parsing [101.25796935464648]
  We propose a series of modular operations for effective geometric feature learning from 3D triangle meshes. Our mesh convolutions exploit spherical harmonics as orthonormal bases to create continuous convolutional filters. We further contribute a novel hierarchical neural network for perceptual parsing of 3D surfaces, named PicassoNet++.
  arXiv  Detail & Related papers  (2021-12-03T09:16:49Z)
• ASH: A Modern Framework for Parallel Spatial Hashing in 3D Perception [91.24236600199542]
  ASH is a modern and high-performance framework for parallel spatial hashing on GPU. ASH achieves higher performance, supports richer functionality, and requires fewer lines of code. ASH and its example applications are open sourced in Open3D.
  arXiv  Detail & Related papers  (2021-10-01T16:25:40Z)
• SparsePipe: Parallel Deep Learning for 3D Point Clouds [7.181267620981419]
  SparsePipe is built to support 3D sparse data such as point clouds. It exploits intra-batch parallelism that partitions input data into multiple processors. We show that SparsePipe can parallelize effectively and obtain better performance on current point cloud benchmarks.
  arXiv  Detail & Related papers  (2020-12-27T01:47:09Z)
• KAPLAN: A 3D Point Descriptor for Shape Completion [80.15764700137383]
  KAPLAN is a 3D point descriptor that aggregates local shape information via a series of 2D convolutions. In each of those planes, point properties like normals or point-to-plane distances are aggregated into a 2D grid and abstracted into a feature representation with an efficient 2D convolutional encoder. Experiments on public datasets show that KAPLAN achieves state-of-the-art performance for 3D shape completion.
  arXiv  Detail & Related papers  (2020-07-31T21:56:08Z)
• Local Grid Rendering Networks for 3D Object Detection in Point Clouds [98.02655863113154]
  CNNs are powerful but it would be computationally costly to directly apply convolutions on point data after voxelizing the entire point clouds to a dense regular 3D grid. We propose a novel and principled Local Grid Rendering (LGR) operation to render the small neighborhood of a subset of input points into a low-resolution 3D grid independently. We validate LGR-Net for 3D object detection on the challenging ScanNet and SUN RGB-D datasets.
  arXiv  Detail & Related papers  (2020-07-04T13:57:43Z)
• Maplets: An Efficient Approach for Cooperative SLAM Map Building Under Communication and Computation Constraints [0.8499685241219366]
  This article introduces an approach to facilitate cooperative exploration and mapping of large-scale, near-ground, underground, or indoor spaces. The effort targets limited Size, Weight, and Power (SWaP) agents with an emphasis on limiting required communications and redundant processing.
  arXiv  Detail & Related papers  (2020-05-20T18:49:31Z)

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.