Back to search

Institutional Repository of Vilnius University

Strateginių žaidimų kelio ieškojimo algoritmai /

Abstract

dc:description

This thesis focuses on comparing different pathfinding algorithms in the context of real-time strategy games, where agents move across a grid-based map. The main goal was to analyze the performance of A* algorithm with path smoothing and Flow Field method under varying condition: different numbers of agents, map sizes, and obstacle densities. Simulations were conducted using Unity Engine to record data on computation times. Results show that A* is suitable for scenarios with a small number of agents, but has drawback of near-linear scaling with agent count and super-quadratic scaling from map size. Flow Field shows a constant computation time for all agents, making it best suited for large numbers of agents and complex maps. Simulations with different obstacle density showed a strong negative impact on A* efficiency. Flow Field computation times slightly decreased with higher obstacle percentages, cause it needs to calculate less vectors. Recommendations are provided to help choose best algorithm for specific game requirements and map configurations.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2026

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Radėnas, Rokas,

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
lit

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Radėnas, Rokas,. Strateginių žaidimų kelio ieškojimo algoritmai /. Institutional Repository of Vilnius University, 2026. https://repository.vu.lt/VU:ELABAETD277690166&prefLang=en_US