EFFICIENCY COMPARISON OF PATHFINDING ALGORITHMS A* AND DIJKSTRA’S IN TWO DIMENSIONAL GRID

Authors

  • Intars Česlis Rezekne Academy of Technologies (LV)
  • Sergejs Kodors Rezekne Academy of Technologies (LV)

DOI:

https://doi.org/10.17770/het2020.24.6747

Keywords:

A*, Dijkstra’s, pathfinding algorithm

Abstract

The shortest path finding algorithms are applied more and more in different industries. There are many pathfinding algorithms, but the most of them differ from their modified versions. The goal of this work was to create A* and Dijkstra’s pathfinding algorithms and compare their execution time.

Downloads

Download data is not yet available.

Downloads

Published

2020-04-22

Issue

No. 24 (2020): Human. Environment. Technology

Section

Information Technologies

How to Cite

[1]
I. Česlis and S. Kodors, “EFFICIENCY COMPARISON OF PATHFINDING ALGORITHMS A* AND DIJKSTRA’S IN TWO DIMENSIONAL GRID”, HET, no. 24, pp. 36–39, Apr. 2020, doi: 10.17770/het2020.24.6747.