Investigating A* Algorithm on WAZE Pathfinding System

Pathfinding algorithms are used for finding the shortest path to travel between a starting point and ending point if a path exists. This paper aims to research one of the most popular pathfinding algorithms, which is A*. The purpose is to find out different aspects about the traditional A* pathfinding algorithm and test its suitability for being implemented in navigation systems like Waze. The algorithm will run through multiple limited 2D static grid-based environments in cases where obstacles are either present or absent. During the trials, its heuristic factor and run-time will be tabulated. The research revealed that A* performs most efficiently when its heuristic factor is calibrated between 0.7 to 0.8, and any value below 0.6 significantly increases its runtime. This shows evidence for A* to be suitable in navigation systems, but further testing with real-time data and dynamic environments could better support its application within navigation systems.