Learning Deep SDF Maps Online for Robot Navigation and Exploration

Authors: Gadiel Sznaier Camps, Robert Dyro, Marco Pavone, Mac Schwager

Added additional reference to Section II: Related Work, citing iSDF
License: CC BY-SA 4.0

Results of the summarizing process for the arXiv paper: 2207.10782v2

  • Comprehensive Summary
  • Key points
  • Layman's Summary
  • Blog article
The paper proposes an algorithm for LiDAR-equipped robots to autonomously build and navigate within a high-fidelity 3D map. The system learns a 3D map from incoming LiDAR data incrementally without forgetting by concatenating a set of local learned SDF maps. Simultaneously, the robot navigates to avoid collisions using a trajectory planner that takes the deep learned SDF map as a collision constraint function. The proposed approach resides at the intersection between learning implicit shape representations, SDFs for robotic mapping, and robot trajectory planning. Learned Implicit Shape Representations is a new trend in machine learning and computer vision where 3D shape representation is learned implicitly as a deep neural network function. Works that exemplify this trend include deep SDFs, learned continuous occupancy functions, and NeRFs. The proposed algorithm optimizes a neural network to represent the Signed Distance Function (SDF) of the environment around its current vicinity continually. When the SDF network quality saturates, it caches a copy of the network along with a learned confidence metric and initializes a new SDF network to continue mapping new regions of the environment. All cached local SDFs are concatenated through a confidence-weighted scheme to give rise to a global SDF for planning purposes. For planning, the algorithm uses sequential convex model predictive control (MPC) which optimizes dynamically feasible trajectories for the robot while enforcing no collisions with obstacles mapped in the global SDF. The study shows that their online mapping algorithm produces higher-quality maps than existing methods for online SDF training. In addition, they showcase their combined mapper and planner running online in WeBots simulator - navigating autonomously without collisions in an unknown environment. Overall, this study presents an effective solution for autonomous navigation in complex environments using LiDAR-equipped robots by combining deep learning-based mapping with MPC-based trajectory planning algorithms.
AI-generated keywords: LiDAR Autonomous Navigation Implicit Shape Representations SDFs Trajectory Planning

AI-generated Key Points

  • The paper proposes an algorithm for LiDAR-equipped robots to autonomously build and navigate within a high-fidelity 3D map.
  • The system learns a 3D map from incoming LiDAR data incrementally without forgetting by concatenating a set of local learned SDF maps.
  • Simultaneously, the robot navigates to avoid collisions using a trajectory planner that takes the deep learned SDF map as a collision constraint function.
  • The proposed approach resides at the intersection between learning implicit shape representations, SDFs for robotic mapping, and robot trajectory planning.
  • Learned Implicit Shape Representations is a new trend in machine learning and computer vision where 3D shape representation is learned implicitly as a deep neural network function.
  • The proposed algorithm optimizes a neural network to represent the Signed Distance Function (SDF) of the environment around its current vicinity continually.
  • All cached local SDFs are concatenated through a confidence-weighted scheme to give rise to a global SDF for planning purposes.
  • For planning, the algorithm uses sequential convex model predictive control (MPC) which optimizes dynamically feasible trajectories for the robot while enforcing no collisions with obstacles mapped in the global SDF.
  • The study shows that their online mapping algorithm produces higher-quality maps than existing methods for online SDF training.
  • They showcase their combined mapper and planner running online in WeBots simulator - navigating autonomously without collisions in an unknown environment.
  • Overall, this study presents an effective solution for autonomous navigation in complex environments using LiDAR-equipped robots by combining deep learning-based mapping with MPC-based trajectory planning algorithms.
Also access our AI generated: Comprehensive summary, Lay summary, Blog-like article; or ask questions about this paper to our AI assistant.

Abstract: We propose an algorithm to (i) learn online a deep signed distance function (SDF) with a LiDAR-equipped robot to represent the 3D environment geometry, and (ii) plan collision-free trajectories given this deep learned map. Our algorithm takes a stream of incoming LiDAR scans and continually optimizes a neural network to represent the SDF of the environment around its current vicinity. When the SDF network quality saturates, we cache a copy of the network, along with a learned confidence metric, and initialize a new SDF network to continue mapping new regions of the environment. We then concatenate all the cached local SDFs through a confidence-weighted scheme to give a global SDF for planning. For planning, we make use of a sequential convex model predictive control (MPC) algorithm. The MPC planner optimizes a dynamically feasible trajectory for the robot while enforcing no collisions with obstacles mapped in the global SDF. We show that our online mapping algorithm produces higher-quality maps than existing methods for online SDF training. In the WeBots simulator, we further showcase the combined mapper and planner running online -- navigating autonomously and without collisions in an unknown environment.

Submitted to arXiv on 21 Jul. 2022

Tools for this paper

Explain it differently 3 free rewrites left today
Export BibTeX · RIS (Zotero, Mendeley, EndNote) · Markdown (Notion, Obsidian) · Premium
Citation alerts Premium
Journal club Slides to present it Premium
For journalists Press kit and hype check Premium

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Assess the quality of the AI-generated content by voting

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.