% - This is an implementation of the following hierarchical astar algorithm:
% A. Botea, M. Muller and J. Schaeffer - Near Optimal Hierarchical Path-Finding
% https://webdocs.cs.ualberta.ca/~mmueller/ps/hpastar.pdf
%
% - This algorithm is efficient and fast for complex and large
% maps/mazes
%
% - Variables:
% I - binary image with white regions (ones) representing
% impassable objects and black regions (zeros) representing free
% space
% Srow - Starting row in image
% Scol - Starting column in image
% Erow - Ending row in image
% Ecol - Ending column in image
% subdims - dimensions [rows,cols] of pre-processing grid (see
% paper referenced above). 2 < subdims <= size(I)
引用格式
Robin Hartley (2024). Hierarchical Astar Path-Finding (https://www.mathworks.com/matlabcentral/fileexchange/115180-hierarchical-astar-path-finding), MATLAB Central File Exchange. 检索来源 .
MATLAB 版本兼容性
创建方式
R2022a
兼容任何版本
平台兼容性
Windows macOS Linux标签
致谢
参考作品: Astar-Algorithm
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!