American
International
University-
Bangladesh

Students & Supervisors

Abstract

In real-time navigation systems, selecting the most efficient pathfinding algorithm is crucial. It ensures accuracy, speed, and resource efficiency. This research provides a detailed comparative analysis of algorithms such as A*, Dijkstra, and Bidirectional Search, evaluating their suitability for real-time applications. The evaluation focuses on how these algorithms perform in dynamic, time-sensitive environments. Some advanced performance profiling tools such as gperftools, , Intel VTune, and Valgrind's Callgrind are used for performance analysis. These tools provide insights into various metrics such as cache misses, instruction counts, eviction rates, interrupt handling, and execution time. The results show that A* is accurate but uses more resources in complex environments. Dijkstra’s algorithm is less efficient for larger datasets. Bidirectional search improves time and memory efficiency by reducing the search space and computational load. This research concludes that bidirectional search is ideal for resource-constrained applications, while A* is better for accuracy-focused tasks. These insights help optimize pathfinding algorithms for real-world navigation systems, offering insights for future advancements in navigation technologies.

Keywords

Publication Details

• Type of Publication: Conference 
• Conference Name: Name of the Journal/ Conference 1st IUT International Conference on Core Engineering & Technology
• Date of Conference: 25/04/2025 - 25/04/2025
• Venue: IUT CAMPUS Islamic university of tehcnology Board bazar, gazipur-1704, bangladesh
• Organizer: Islamic University of Technology (IUT)