Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search

Pathfinding on grid maps is a cornerstone problem in robotics, autonomous navigation, and game development. Classical algorithms such as A*, Dijkstra’s, and Breadth-First Search (BFS) are known for their ability to guarantee optimal solutions, while others like Depth-First Search (DFS) and Gr...

Полное описание

Библиографические подробности

Главные авторы:	Amr Elshahed, Majid Khan Bin Majahar Ali, Ahmad Sufril Azlan Mohamed, Farah Aini Binti Abdullah, Ts. Lee Jian Aun
Формат:	Artigo
Язык:	Inglês
Опубликовано:	IEEE 2025-01-01
Серии:	IEEE Access
Предметы:	Path planning shortest path problem heuristic algorithms
Online-ссылка:	https://ieeexplore.ieee.org/document/11018332/
Метки:	Добавить метку Нет меток, Требуется 1-ая метка записи!