A* Algorithm

Compute Shortest path between starting 3D point and ending one.

You are now following this Submission

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 .

Categories

Find more on Sparse Matrices in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Version Published Release Notes Action
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