Demonstration of Astar (A*)

Version 1.1.0.0 (14.9 KB) by Bob Sturm
Pathfinding algorithm Astar (A*)
4.5
(13)
4.8K Downloads
Updated 21 Feb 2011

View License

How do you find the shortest path from one point to another in a computationally efficient way? The A* algorithm provides one implementation where the distance to the goal is considered as a heuristic in addition to local weightings, and the best path is recovered without combinatorial complexity.

Cite As

Bob Sturm (2024). Demonstration of Astar (A*) (https://www.mathworks.com/matlabcentral/fileexchange/26723-demonstration-of-astar-a), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2008b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Strategy & Logic in Help Center and MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Version Published Release Notes
1.1.0.0

I have corrected the entire algorithm such that the total path cost is correct, and the heuristic is properly used.
1.0.0.0