Home // ICN 2015, The Fourteenth International Conference on Networks // View article

Comparative Analysis of the Algorithms for Pathfinding in GPS Systems

Authors:
Dustin Ostrowski
Iwona Pozniak-Koszalka
Leszek Koszalka
Andrzej Kasprzak

Keywords: GPS; search algorithms; experimentation system; path finding

Abstract:
The objective of the paper was to determine which search method is suitable for implementation in GPS systems. The properties of pathfinding algorithms were tested and discussed taking into account this type of systems. Six algorithms have been evaluated, including three different implementations of Dijkstra algorithm, Bellman-Ford algorithm, A* star algorithm, and bidirectional Dijkstra’s algorithm. Simulation experiments were carried out using the real digital maps and with the designed and implemented experimentation system. Studies were performed with respect to various parameters. After thorough examination and interpretation of conclusions, the algorithms which fit to GPS systems were selected.

Pages: 102 to 108

Copyright: Copyright (c) IARIA, 2015

Publication date: April 19, 2015

Published in: conference

ISSN: 2308-4413

ISBN: 978-1-61208-398-8

Location: Barcelona, Spain

Dates: from April 19, 2015 to April 24, 2015