Comparative Analysis of Weighted Pathfinding in Realistic Environments
Richard Uggelberg, Andreas Lundblom · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 2017
The general subject of this thesis concerns different weightings applied to Dijkstra’s pathfinding algorithm to balance performance versus accuracy in a simulated realistic environment. The algorithms used in this study are Dijkstra's pathfinding algorithm and A*. When evaluating paths in the opposite direction of the goal the path length is multiplied by a heuristic coefficient. Thus giving preference to the path in the general direction of the goal. The results derived from this testing show that for each usage case that does not disregard either path length or computation time there is a heuristic coefficient for which the pathfinding calculations will require the least amount of computation power in relation to the accuracy of the resulting paths.