Johner, RobertLanaia, AntoninoDornberger, RolfHanne, ThomasSaraswat, MukeshSharma, HarishBalachandran, K.Kim, Joong HoonBansal, Jagdish Chand2025-03-132022978-981-16-9112-6978-981-16-9113-3https://doi.org/10.1007/978-981-16-9113-3_41https://irf.fhnw.ch/handle/11654/48193This paper aims to compare A*, Dijkstra, Bellmann-Ford, Floyd-Warshall, and best first search algorithms to solve a particular variant of the pathfinding problem based on the so-called paparazzi problem. This problem consists of a grid with different non-moving obstacles that lead to different traversing costs which are considered as minimization objective in a specific model. The performance of the algorithms that solve the paparazzi problem is compared in terms of computation time, the number of visited nodes, shortest path cost, and accuracy of finding the shortest path. The comparison shows that heuristic algorithms mostly provide the optimal path but with a shorter computation time.en330 - Wirtschaft04B - Beitrag Konferenzschrift561-576