Abstract
This 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Baldi S, Maric N, Dornberger R, Hanne T (2018) “Pathfinding optimization when solving the paparazzi problem comparing A* and Dijkstra's algorithm”. 6th international symposium on computational and business intelligence (ISCBI), pp 16–22
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271
Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Trans Syst Sci Cybernetics 4(2):100–107. https://doi.org/10.1109/TSSC.1968.300136
Madkour A, Aref WG, Rehman FU, Rahman MA, Basalamah S (2017) A survey of shortest-path algorithms. arXiv preprint arXiv:1705.02044
Ogren J, Wirkander P, Stefansson SL, Pelo A (2006) “Formulation and solution of the UAV paparazzi problem.” In: AIAA guidance, navigation, and control conference and exhibit, p 6106
Pathak MJ, Patel RL, Rami SP (2018) Comparative analysis of search algorithms. Int J Comput Appl 179(50):40–43
Pearl J (1984) Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley
Shaorong X, Peng W, Peng Y, Xiaomao L, Jun L, Qingmei L (2016) “A novel method of unmanned surface vehicle autonomous cruise”. J Indus Robot
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Johner, R., Lanaia, A., Dornberger, R., Hanne, T. (2022). Comparing the Pathfinding Algorithms A*, Dijkstra’s, Bellman-Ford, Floyd-Warshall, and Best First Search for the Paparazzi Problem. In: Saraswat, M., Sharma, H., Balachandran, K., Kim, J.H., Bansal, J.C. (eds) Congress on Intelligent Systems. Lecture Notes on Data Engineering and Communications Technologies, vol 111. Springer, Singapore. https://doi.org/10.1007/978-981-16-9113-3_41
Download citation
DOI: https://doi.org/10.1007/978-981-16-9113-3_41
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-9112-6
Online ISBN: 978-981-16-9113-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)