Skip to content

Using the pathfinding algorithm A* to solve the problem of navigation on tri-dimensional grid.

Notifications You must be signed in to change notification settings

victorkich/CubeAstar

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

12 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Using the pathfinding algorithm A* to solve the problem of navigation on tri-dimentional grid


Environment

CubeAstar This project has the purpose of elucidating in a graphic way the functioning of the pathfinding algorithm A* in a tri-dimentional interface. However, it can be used to perform some kind of academic research about it.

Setup

All of requirements is show in the badgets above, but if you want to install all of them, enter the repository and execute the following line of code:

pip3 install -r requirements.txt

To execute the code just use:

python3 cube.py

Objectives

The environment generates parameterized obstacles in a random way and its actuation interval can also be configured. The green point is the starting point of the search algorithm and the red point the end point, the objective. To perform tests using the "maximum speed" of processing I strongly recommend disabling the graphical interface by changing the PLOT parameter to False.

CubeStar

If you liked this repository, please don't forget to starred it!

About

Using the pathfinding algorithm A* to solve the problem of navigation on tri-dimensional grid.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages