zaključno delo
Leon Balaj (Author), Simon Kolmanič (Mentor)

Abstract

Diplomsko delo obravnava dva algoritma za iskanje poti v računalniških igrah. Najprej se seznanimo s problemom iskanja najkrajše poti v grafu ter iskalnima algoritmoma A* in Dijkstrovim algoritmom, ki ju kasneje implementiramo v okolju Unity v programskem jeziku C# ter preizkusimo njuno delovanje v vnaprej pripravljenem labirintu. Med seboj primerjamo delovanje algoritma na različnih izbranih začetnih točkah ter dobljene rezultate tudi analiziramo.

Keywords

računalniške igre;Unity;iskanje poti;Dijkstrov algoritem;algoritem A*;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: [L. Balaj]
UDC: 004.92.021(043.2)
COBISS: 22922262 Link will open in a new window
Views: 809
Downloads: 89
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: Pathfinding in computer games
Secondary abstract: In this diploma thesis two algorithms for pathfinding in computer games are described. First we get acquainted with the problem of finding the shortest path in the graph, and also with the search algorithms A* and Dijkstra, which are later implemented in Unity with C# and tested in a predefined labyrinth. We compare the two algorithms with different starting points and analyze the results.
Secondary keywords: computer games;Unity;pathfinding;Dijkstra's algorithm;A* search algorithm;
Type (COBISS): Bachelor thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages: X, 42 str.
ID: 11274825
Recommended works:
, zaključno delo
, zaključno delo
, diplomsko delo univerzitetnega študijskega programa Varstvoslovje
, diplomsko delo
, diplomsko delo