CNN Encoder to Reduce the Dimensionality of Data Image for Motion Planning

04/10/2020
by   Janderson Ferreira, et al.
0

Many real-world applications need path planning algorithms to solve tasks in different areas, such as social applications, autonomous cars, and tracking activities. And most importantly motion planning. Although the use of path planning is sufficient in most motion planning scenarios, they represent potential bottlenecks in large environments with dynamic changes. To tackle this problem, the number of possible routes could be reduced to make it easier for path planning algorithms to find the shortest path with less efforts. An traditional algorithm for path planning is the A*, it uses an heuristic to work faster than other solutions. In this work, we propose a CNN encoder capable of eliminating useless routes for motion planning problems, then we combine the proposed neural network output with A*. To measure the efficiency of our solution, we propose a database with different scenarios of motion planning problems. The evaluated metric is the number of the iterations to find the shortest path. The A* was compared with the CNN Encoder (proposal) with A*. In all evaluated scenarios, our solution reduced the number of iterations by more than 60%.

READ FULL TEXT

page 3

page 5

research
08/05/2020

Performance Improvement of Path Planning algorithms with Deep Learning Encoder Model

Currently, path planning algorithms are used in many daily tasks. They a...
research
09/16/2018

T* : A Heuristic Search Based Algorithm for Motion Planning with Temporal Goals

Motion planning is the core problem to solve for developing any applicat...
research
05/08/2023

Reducing Onboard Processing Time for Path Planning in Dynamically Evolving Polygonal Maps

Autonomous agents face the challenge of coordinating multiple tasks (per...
research
06/05/2021

Motion Planning Transformers: One Model to Plan Them All

Transformers have become the powerhouse of natural language processing a...
research
06/28/2023

Lagrangian based A* algorithm for automated reasoning

In this paper, a modification of A* algorithm is considered for the shor...
research
04/06/2017

Landmark Guided Probabilistic Roadmap Queries

A landmark based heuristic is investigated for reducing query phase run-...
research
03/07/2023

Geometry-Aware Coverage Path Planning for Depowdering on Complex 3D Surfaces

This paper presents a new approach to obtaining nearly complete coverage...

Please sign up or login with your details

Forgot password? Click here to reset