Hierarchical Astar Path-Finding

Version 1.0.1 (8,27 KB) von Robin Hartley
Implementation of the hierarchical astar algorithm A. Botea, M. Muller and J. Schaeffer. Fast and efficient for large/complex maps and mazes
0.0
(0)
66 Downloads
Aktualisiert 4. Okt 2022

Lizenz anzeigen

% - 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)

Zitieren als

Robin Hartley (2025). Hierarchical Astar Path-Finding (https://de.mathworks.com/matlabcentral/fileexchange/115180-hierarchical-astar-path-finding), MATLAB Central File Exchange. Abgerufen.

Kompatibilität der MATLAB-Version
Erstellt mit R2022a
Kompatibel mit allen Versionen
Plattform-Kompatibilität
Windows macOS Linux
Tags Tags hinzufügen
Quellenangaben

Inspiriert von: Astar-Algorithm

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Version Veröffentlicht Versionshinweise
1.0.1

Fixed bug where either fully white grid regions would cause crash
1.0.0