Demonstration of Astar (A*)

Pathfinding algorithm Astar (A*)

Version 1.1.0.0 (14.9 KB)
4.9K Downloads
(13)
21 Feb 2011

You are now following this Submission

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 (2026). Demonstration of Astar (A*) (https://www.mathworks.com/matlabcentral/fileexchange/26723-demonstration-of-astar-a), MATLAB Central File Exchange. Retrieved .

Categories

Find more on Strategy & Logic in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Open in new tab
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