Simon Mihevc (2014) Multiagent path-finding in strategic games. EngD thesis.
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.
| Item Type: | Thesis (EngD thesis) |
|---|
| Keywords: | Multi-agent pathfinding, real-time strategy gamess, A* algorithm, multi-agent pathfinding using clearance, multi-agent pathfinding using independence detection and operator decomposition |
|---|
| Number of Pages: | 46 |
|---|
| Language of Content: | Slovenian |
|---|
| Mentor / Comentors: | | Name and Surname | ID | Function |
|---|
| akad. prof. dr. Ivan Bratko | 77 | Mentor |
|
|---|
| Link to COBISS: | http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1536203715 ) |
|---|
| Institution: | University of Ljubljana |
|---|
| Department: | Faculty of Computer and Information Science |
|---|
| Item ID: | 2899 |
|---|
| Date Deposited: | 09 Jan 2015 16:31 |
|---|
| Last Modified: | 20 Feb 2015 13:55 |
|---|
| URI: | http://eprints.fri.uni-lj.si/id/eprint/2899 |
|---|
Actions (login required)
![[img]](http://eprints.fri.uni-lj.si/style/images/fileicons/application_pdf.png)
