Pathfinding Optimization when Solving the Paparazzi Problem Comparing A* and Dijkstra's Algorithm

This paper aims to compare the application of the A* algorithm and Dijkstra's algorithm to solve a particular variant of pathfinding problem based on the so-called paparazzi problem. The problem consists of a grid with different fixed obstacles, leading to different traversing time factors respectively costs. A specific model of this problem is derived and the performance of these two pathfinding algorithms that solve the paparazzi problem is compared with regard to the computation time and the number of iterations. The shortest versus the fastest path with lowest cost are discussed.