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

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) an...

Full description

Saved in:
Bibliographic Details
Main Authors: Amr Elshahed, Majid Khan Bin Majahar Ali, Ahmad Sufril Azlan Mohamed, Farah Aini Binti Abdullah, Ts. Lee Jian Aun
Format: Article
Language:English
Published: IEEE 2025-01-01
Series:IEEE Access
Subjects:
Path planning
shortest path problem
heuristic algorithms
Online Access:https://ieeexplore.ieee.org/document/11018332/
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items