diplomsko delo
Simon Mihevc (Author), Ivan Bratko (Mentor)

Abstract

V tej diplomski nalogi sem se ukvarjal z izdelavo, primerjavo in izboljšanjem algoritmov za večagentno iskanje poti na domeni, ki je tipična za realno časovne strateške igre. Implementiral in primerjal sem algoritma Večagentno iskanje poti z uporabo hodnika in Večagentno iskanje poti z detekcijo neodvisnosti in dekompozicijo operatorjev. Algoritma nista ohranjala enotnosti skupine in sta potrebovala preveč časa za iskanje poti. Pomanjkljivosti algoritmov sem v precejšnji meri odpravil.

Keywords

večagentno iskanje poti;realno časovne strateške igre;algoritem A*;večagentno iskanje poti z uporabo hodnika;večagentno iskanje poti z detekcijo neodvisnosti in dekompozicijo operatorjev;računalništvo;univerzitetni študij;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UL FRI - Faculty of Computer and Information Science
Publisher: [S. Mihevc]
UDC: 004.8(043.2)
COBISS: 1536203715 Link will open in a new window
ISSN: 1536203715
Views: 734
Downloads: 194
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: Multiagent path-finding in strategic games
Secondary 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.
Secondary keywords: multi-agent pathfinding;real-time strategy games;A* algorithm;multi-agent pathfinding using independence detection and operator decomposition;computer science;diploma;
File type: application/pdf
Type (COBISS): Undergraduate thesis
Study programme: 1000475
Thesis comment: Univ. v Ljubljani, Fak. za računalništvo in informatiko
Pages: 46 f.
ID: 8739694