A* Algorithm

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

您现在正在关注此提交

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.

引用格式

LorenzoTortorella (2026). A* Algorithm (https://ww2.mathworks.cn/matlabcentral/fileexchange/45546-a-algorithm), MATLAB Central File Exchange. 检索时间: .

类别

Help CenterMATLAB Answers 中查找有关 Sparse Matrices 的更多信息

一般信息

MATLAB 版本兼容性

  • 兼容任何版本

平台兼容性

  • Windows
  • macOS
  • Linux
版本 已发布 发行说明 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