NNPP: A Learning-Based Heuristic Model for Accelerating Optimal Path Planning on Uneven Terrain

TL;DR

This paper introduces NNPP, a learning-based heuristic model that accelerates optimal path planning on uneven terrains by predicting likely path regions, reducing search space for algorithms like A*.

Contribution

The paper presents a novel NNPP model that learns semantic and terrain information to efficiently guide path planning in complex environments.

Findings

NNPP reduces search time for path planning.

The model effectively predicts optimal path regions.

Performance varies with different location encoding parameters.

Abstract

Intelligent autonomous path planning is essential for enhancing the exploration efficiency of mobile robots operating in uneven terrains like planetary surfaces and off-road environments.In this paper, we propose the NNPP model for computing the heuristic region, enabling foundation algorithms like Astar to find the optimal path solely within this reduced search space, effectively decreasing the search time. The NNPP model learns semantic information about start and goal locations, as well as map representations, from numerous pre-annotated optimal path demonstrations, and produces a probabilistic distribution over each pixel representing the likelihood of it belonging to an optimal path on the map. More specifically, the paper computes the traversal cost for each grid cell from the slope, roughness and elevation difference obtained from the digital elevation model. Subsequently, the start and goal locations are encoded using a Gaussian distribution and different location encoding parameters are analyzed for their effect on model performance. After training, the NNPP model is able to \textcolor{revision}{accelerate} path planning on novel maps.