Amr Elshahed

Papers

Total Citations

H-Index

About

Amr Elshahed is a researcher whose work lies at the intersection of robotics, autonomous navigation, and algorithmic optimization, with a particular focus on pathfinding on grid maps. His most cited paper, "Efficient Pathfinding on Grid Maps: Comparative Analysis of Classical Algorithms and Incremental Line Search" (2025, 4 citations), provides a rigorous comparative analysis of classical algorithms—A*, Dijkstra's, BFS, and DFS—alongside incremental line search methods. Elshahed’s key contribution is demonstrating how incremental line search can offer computational efficiency without sacrificing path quality, offering a practical alternative for real-time applications in dynamic environments. This work has implications for game development and autonomous systems, where rapid decision-making is critical. Though early in his career, Elshahed’s analysis has already been cited by peers exploring adaptive pathfinding techniques, highlighting its relevance. His research bridges theoretical algorithm analysis and applied robotics, making him a promising voice in the field. For students and researchers, Elshahed’s work serves as a valuable resource for understanding trade-offs between optimality and speed in grid-based navigation, a foundational challenge in modern AI and robotics.