Zarembo, Imants

Thumbnail Image
Preferred name
Zarembo, Imants
Official Name
Zarembo, Imants
Alternative Name
Imants Zarembo
Zarembo, I
Main Affiliation
Email
imants.zarembo@rta.lv
ORCID
Scopus Author ID
56326264300
Researcher ID
AAI-1965-2020

Research Output

Filters

2
2
2
Reset filters

Settings

Now showing 1 - 2 of 2
  • Publication
    The Analysis of Efficiency Dependence of the Shortest Path Finding Algorithms A* and HPA*
    (2012)
    Zarembo, Imants 
    ;
    Oleg Uzhga-Rebrov
    Many pathfinding problems in real-world applications require real-time computation of the shortest path between two points in a grid-based environment. It is not a trivial task. While some shortest path finding algorithms may perform admissibly in one condition, they may prove inadmissible in other conditions. HPA* pathfinding algorithm is faster and more memory efficient than the A*algorithm in relatively large twodimensional grids, but this advantage may not apply to very small or very large grids. The paper deals with the efficiency of A* and HPA*in two-dimensional grids of different sizes. For the sake of completeness of the analysis, HPA* efficiency is measured taking into consideration the number of hierarchy levels and different cluster sizes. Both algorithms have been implemented and tests conducted. Experimental evidence is proposed to demonstrate the algorithm efficiency in various conditions.
  • Publication
    Pathfinding Algorithm Efficiency Analysis in 2D Grid
    (2013)
    Zarembo, Imants 
    ;
    Kodors, Sergejs
    The main goal of this paper is to collect information about pathfinding algorithms A*, BFS, Dijkstra's algorithm, HPA* and LPA*, and compare them on different criteria, including execution time and memory requirements. Work has two parts, the first being theoretical and the second practical. The theoretical part details the comparison of pathfinding algorithms. The practical part includes implementation of specific algorithms and series of experiments using algorithms implemented. Such factors as various size two dimensional grids and choice of heuristics were taken into account while conducting experiments.
    Scopus© Citations 5