Skip to content

Using the A* algorithm to find the shortest route across an obstacle map

Notifications You must be signed in to change notification settings

samerwh/Path-Planning

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

19 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Path-Planning

path-planning.cpp consists of an implementation of the A-Star path search algorithm. The algorithm computes the shortest path that can be taken to move from a known starting position to a known destination. The map and path are plotted using matplotlib.

Examples

Obstacle Field

obstacle field

The Maze

the maze

About

Using the A* algorithm to find the shortest route across an obstacle map

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages