A* Algorithm

Version 1.2.0.0 (8.01 KB) by LorenzoTortorella
Compute Shortest path between starting 3D point and ending one.
3.0
(4)
1.8K Downloads
Updated 9 May 2017

View License

Giving a vector, it computes the shortest path between the first and last point of that.
Adding a settable number of points to the OPEN set that are nearest than "raggio" value. Or rather, the nodes added to the OPEN set at each step is settable (default equal to the vector length).
The distances are in three dimensions.

Cite As

LorenzoTortorella (2026). A* Algorithm (https://www.mathworks.com/matlabcentral/fileexchange/45546-a-algorithm), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2013a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Sparse Matrices in Help Center and MATLAB Answers
Tags Add Tags

Version Published Release Notes
1.2.0.0

Example updated
Added "update_open.m" file
1.1.0.0

Little bug fixed and example file given.
1.0.0.0