DeepAI AI Chat
Log In Sign Up

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

04/01/2020
by   Tomas Kulvicius, et al.
The University of Göttingen
0

Trajectory- or path-planning is a fundamental issue in a wide variety of applications. Here we show that it is possible to solve path planning for multiple start- and end-points highly efficiently with a network that consists only of max pooling layers, for which no network training is needed. Different from competing approaches, very large mazes containing more than half a billion nodes with dense obstacle configuration and several thousand path end-points can this way be solved in very short time on parallel hardware.

READ FULL TEXT

page 1

page 2

page 3

page 5

page 6

page 9

page 10

page 12

04/06/2021

Admissible heuristics for obstacle clearance optimization objectives

Obstacle clearance in state space is an important optimization objective...
05/21/2021

A Reinforcement Learning based Path Planning Approach in 3D Environment

Optimal trajectory planning involves obstacles avoidance in which path p...
03/05/2020

UAV Coverage Path Planning under Varying Power Constraints using Deep Reinforcement Learning

Coverage path planning (CPP) is the task of designing a trajectory that ...
10/10/2019

Variational Path Optimization of Linear Pentapods with a Simple Singularity Variety

The class of linear pentapods with a simple singularity variety is obtai...
06/17/2018

Gated Path Planning Networks

Value Iteration Networks (VINs) are effective differentiable path planni...
08/05/2019

GAN Path Finder: Preliminary results

2D path planning in static environment is a well-known problem and one o...