DeepAI AI Chat
Log In Sign Up

Generative Adversarial Network based Heuristics for Sampling-based Path Planning

by   Tianyi Zhang, et al.

Sampling-based path planning is a popular methodology for robot path planning. With a uniform sampling strategy to explore the state space, a feasible path can be found without the complex geometric modeling of the configuration space. However, the quality of initial solution is not guaranteed and the convergence speed to the optimal solution is slow. In this paper, we present a novel image-based path planning algorithm to overcome these limitations. Specifically, a generative adversarial network (GAN) is designed to take the environment map (denoted as RGB image) as the input without other preprocessing works. The output is also an RGB image where the promising region (where a feasible path probably exists) is segmented. This promising region is utilized as a heuristic to achieve nonuniform sampling for the path planner. We conduct a number of simulation experiments to validate the effectiveness of the proposed method, and the results demonstrate that our method performs much better in terms of the quality of initial solution and the convergence speed to the optimal solution. Furthermore, apart from the environments similar to the training set, our method also works well on the environments which are very different from the training set.


page 1

page 6

page 7

page 10


Learning-based Fast Path Planning in Complex Environments

In this paper, we present a novel path planning algorithm to achieve fas...

Conditional Generative Adversarial Networks for Optimal Path Planning

Path planning plays an important role in autonomous robot systems. Effec...

Efficient Heuristic Generation for Robot Path Planning with Recurrent Generative Model

Robot path planning is difficult to solve due to the contradiction betwe...

Enhance Connectivity of Promising Regions for Sampling-based Path Planning

Sampling-based path planning algorithms usually implement uniform sampli...

Integer-Programming-Based Narrow-Passage Multi-Robot Path Planning with Effective Heuristics

We study optimal Multi-robot Path Planning (MPP) on graphs, in order to ...

Path Planning in Unknown Environments Using Optimal Transport Theory

This paper introduces a graph-based, potential-guided method for path pl...

Code Repositories


A Pytorch implementation of Generative Adversarial Network for Heuristics of Sampling-based Path Planning

view repo