Comparing the pathfinding algorithms A*, Dijkstra’s, Bellman-Ford, Floyd-Warshall, and best first search for the paparazzi problem

dc.contributor.authorJohner, Robert
dc.contributor.authorLanaia, Antonino
dc.contributor.authorDornberger, Rolf
dc.contributor.authorHanne, Thomas
dc.contributor.editorSaraswat, Mukesh
dc.contributor.editorSharma, Harish
dc.contributor.editorBalachandran, K.
dc.contributor.editorKim, Joong Hoon
dc.contributor.editorBansal, Jagdish Chand
dc.date.accessioned2025-03-13T14:59:27Z
dc.date.issued2022
dc.description.abstractThis 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.
dc.event2nd Congress on Intelligent Systems CIS 2021
dc.identifier.doihttps://doi.org/10.1007/978-981-16-9113-3_41
dc.identifier.isbn978-981-16-9112-6
dc.identifier.isbn978-981-16-9113-3
dc.identifier.urihttps://irf.fhnw.ch/handle/11654/48193
dc.language.isoen
dc.publisherSpringer
dc.relation.ispartofCongress on Intelligent Systems. Proceedings of CIS 2021
dc.relation.ispartofseriesLecture Notes on Data Engineering and Communications Technologies
dc.spatialSingapore
dc.subject.ddc330 - Wirtschaft
dc.titleComparing the pathfinding algorithms A*, Dijkstra’s, Bellman-Ford, Floyd-Warshall, and best first search for the paparazzi problem
dc.type04B - Beitrag Konferenzschrift
dc.volume2
dspace.entity.typePublication
fhnw.InventedHereYes
fhnw.ReviewTypeAnonymous ex ante peer review of a complete publication
fhnw.affiliation.hochschuleHochschule für Wirtschaft FHNWde_CH
fhnw.affiliation.institutInstitut für Wirtschaftsinformatikde_CH
fhnw.openAccessCategoryClosed
fhnw.pagination561-576
fhnw.publicationStatePublished
fhnw.seriesNumber111
relation.isAuthorOfPublication3497a335-9f6e-4417-93c1-f8b8ab9dd43c
relation.isAuthorOfPublication37dc0d8b-15fa-4860-9c95-3f4a5b460839
relation.isAuthorOfPublication64196f63-c326-4e10-935d-6776cc91354c
relation.isAuthorOfPublication35d8348b-4dae-448a-af2a-4c5a4504da04
relation.isAuthorOfPublication.latestForDiscovery64196f63-c326-4e10-935d-6776cc91354c
Dateien

Lizenzbündel

Gerade angezeigt 1 - 1 von 1
Kein Vorschaubild vorhanden
Name:
license.txt
Größe:
2.66 KB
Format:
Item-specific license agreed upon to submission
Beschreibung: