DeepAI AI Chat
Log In Sign Up

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

by   Tomas Kulvicius, et al.
The University of Göttingen

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.


page 1

page 2

page 3

page 5

page 6

page 9

page 10

page 12


Admissible heuristics for obstacle clearance optimization objectives

Obstacle clearance in state space is an important optimization objective...

A Reinforcement Learning based Path Planning Approach in 3D Environment

Optimal trajectory planning involves obstacles avoidance in which path p...

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

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

Variational Path Optimization of Linear Pentapods with a Simple Singularity Variety

The class of linear pentapods with a simple singularity variety is obtai...

Gated Path Planning Networks

Value Iteration Networks (VINs) are effective differentiable path planni...

GAN Path Finder: Preliminary results

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