publication . Thesis . 2014

Multiagent path-finding in strategic games

Mihevc, Simon;
Open Access
  • Published: 24 Nov 2014
  • Country: Slovenia
Abstract
In this thesis I worked on creating, comparing and improving algorithms for multi-agent path planning on a domain typical for real-time strategy games. I implemented and compared Multiagent pathfinding using clearance and Multiagent pathfinding using independence detection and operator decomposition. I discovered that they had problems maintaining group compactness and took too long to calculate the path. I considerably improved the efficiency of both algorithms.
Subjects
free text keywords: Computer and Information Science
Related Organizations
Download from
ePrints.FRI
Thesis . 2014
Provider: ePrints.FRI
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue