mlsanityData to 7 Oct 2026

Progressive Learning for Physics-informed Neural Motion Planning

arXiv 2306.00616 ↗First posted 1 Jun 2023cs.RO cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Motion planning (MP) is one of the core robotics problems requiring fast methods for finding a collision-free robot motion path connecting the given start and goal states. Neural motion planners (NMPs) demonstrate fast computational speed in finding path solutions but require a huge amount of expert trajectories for learning, thus adding a significant training computational load. In contrast, recent advancements have also led to a physics-informed NMP approach that directly solves the Eikonal equation for motion planning and does not require expert demonstrations for learning. However, experiments show that the physics-informed NMP approach performs poorly in complex environments and lacks scalability in multiple scenarios and high-dimensional real robot settings. To overcome these limitations, this paper presents a novel and tractable Eikonal equation formulation and introduces a new progressive learning strategy to train neural networks without expert data in complex, cluttered, multiple high-dimensional robot motion planning scenarios. The results demonstrate that our method outperforms state-of-the-art traditional MP, data-driven NMP, and physics-informed NMP methods by a significant margin in terms of computational planning speed, path quality, and success rates. We also show that our approach scales to multiple complex, cluttered scenarios and the real robot set up in a narrow passage environment. The proposed method's videos and code implementations are available at https://github.com/ruiqini/P-NTFields.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 22 of its 40 references that are in the map. First posted on arXiv 1 Jun 2023.

Builds on

22 of 40 references.

References · 22

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Trust Region Policy Optimizationcited by 2,503
  3. 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
  4. 2021Characterizing possible failure modes in physics-informed neural networkscited by 632
  5. 2016Value Iteration Networkscited by 158
  6. 2017Learning Sampling Distributions for Robot Motion Planningcited by 79
  7. 2018Motion Planning Networkscited by 78
  8. 2019Motion Planning Networks: Bridging the Gap Between Learning-based and Classical Motion Plannerscited by 62
  9. 2014Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristiccited by 50
  10. 2020EikoNet: Solving the Eikonal equation with Deep Neural Networkscited by 50
  11. 2021Phase Transitions, Distance Functions, and Implicit Neural Representationscited by 38
  12. 2013Fast Marching Tree: a Fast Marching Sampling-Based Method for Optimal Motion Planning in Many Dimensionscited by 25
10 more
  1. 2021Differentiable Spatial Planning using Transformerscited by 25
  2. 2022NTFields: Neural Time Fields for Physics-Informed Robot Motion Planningcited by 22
  3. 2023VisCo Grids: Surface Reconstruction with Viscosity and Coarea Gridscited by 20
  4. 2018Deeply Informed Neural Sampling for Robot Motion Planningcited by 19
  5. 2019LEGO: Leveraging Experience in Roadmap Generation for Sampling-Based Planningcited by 19
  6. 2017Potential Functions based Sampling Heuristic For Optimal Path Planningcited by 9
  7. 2021Learning Continuous Environment Fields via Implicit Functionscited by 8
  8. 2016A fast marching algorithm for the factored eikonal equationcited by 6
  9. 2018Potentially Guided Bidirectionalized RRT* for Fast Optimal Path Planning in Cluttered Environmentscited by 6
  10. 2020Cost-to-Go Function Generating Networks for High Dimensional Motion Planningcited by 6

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 2; 2025: 2; 2026: 3.

8 papers.