GAN Path Finder: Preliminary results

08/05/2019
by   Natalia Soboleva, et al.
0

2D path planning in static environment is a well-known problem and one of the common ways to solve it is to 1) represent the environment as a grid and 2) perform a heuristic search for a path on it. At the same time 2D grid resembles much a digital image, thus an appealing idea comes to being -- to treat the problem as an image generation task and to solve it utilizing the recent advances in deep learning. In this work we make an attempt to apply a generative neural network as a path finder and report preliminary results, convincing enough to claim that this direction of research is worth further exploration.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2019

Fully Convolutional Search Heuristic Learning for Rapid Path Planners

Path-planning algorithms are an important part of a wide variety of robo...
research
04/19/2018

Static and Dynamic Path Planning Using Incremental Heuristic Search

Path planning is an important component in any highly automated vehicle ...
research
03/04/2021

Estimation and Planning of Exploration Over Grid Map Using A Spatiotemporal Model with Incomplete State Observations

Path planning over spatiotemporal models can be applied to a variety of ...
research
05/31/2022

Fast-Spanning Ant Colony Optimisation (FaSACO) for Mobile Robot Coverage Path Planning

Coverage Path Planning (CPP) aims at finding an optimal path that covers...
research
12/18/2019

Busca de melhor caminho entre múltiplas origens e múltiplos destinos em redes complexas que representam cidades

Was investigated in this paper the use of a search strategy in the probl...
research
04/01/2020

Generation of Paths in a Maze using a Deep Network without Learning

Trajectory- or path-planning is a fundamental issue in a wide variety of...

Please sign up or login with your details

Forgot password? Click here to reset