version 2.0.0 (215 KB) by Einar Ueland
An update of the Astar algorithm will be posted here


Updated 5 Aug 2020

From GitHub

View License on GitHub

Can handle any heigth and width of occupancy grid? YES
Possible to specify multiple goal nodes? YES.
Fast and efficient? YES.
Possible to specify connecting distance to other nodes? YES (in other words the algorithm is not restriced to 8-directions)
There are no nested functions, subfunctions, plotters, or any other mess in the actual pathfinder script.
Algorithm has simple inputs: An occupancy grid. A goal Matrix, the start node and preffered connecting distance.
The zip file includes an example on the use of the script.

See linked GitHub page fore more information.
This code was written for a project, which I have written a paper about:

This paper provides some more details on the code, and how it can be applied in a practical example. If you use the code for academic work/publishing I will appreciate if you could cite the above paper.

There will probably soon come an update, which among other, will include 3D pathfinding. If you liked the code, please give it a positive rating.

Cite As

Einar Ueland (2022). Astar-Algorithm (, GitHub. Retrieved .

MATLAB Release Compatibility
Created with R2015b
Compatible with any release
Platform Compatibility
Windows macOS Linux

Inspired: Hierarchical Astar Path-Finding

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
To view or report issues in this GitHub add-on, visit the GitHub Repository.
To view or report issues in this GitHub add-on, visit the GitHub Repository.