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.
Bob Sturm (2020). Demonstration of Astar (A*) (https://www.mathworks.com/matlabcentral/fileexchange/26723-demonstration-of-astar-a), MATLAB Central File Exchange. Retrieved .
replace wavread with audioread for matlab 2015b and after that
it is great, but does not always find the shortest path
Great!Very nice GUI ,workable function and readable code ! But in the program the variables appears to change its size all the time, and I think the reallocating of memory might costs a lot of time.(However , I'm new learner , my opinion may be incorrect~)
Nice demo. Thanks. However, I'm struggling to make the algorithm work with a rectangular map due to the fact that the order of the x and y axes depends on whether we're talking about image coordinates or matrix indexes. Terribly confusing.
this is great. code is readable and the animation looks pretty. i wish there was a gui control to slow down the animation.
I was playing with the code and I think that the g part of the Astar equation (f=g+h) is missing. I inputted my own state space for the algorithm to traverse and it went 7 spaces more than it needed to to reach its goal. I added a crude form of g and it found the optimal path I was looking for in my example. Other than that I like this GUI it looks really nice.
Love this, presentation is beautiful and code is quite readable.
Thanks for this tool!
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!