| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Izdelava metode za iskanje najkrajše poti z dinamičnimi ovirami v računalniških igrah : magistrsko delo
Authors:Ulbin, Martin (Author)
Mongus, Domen (Mentor) More about this mentor... New window
Files:.pdf MAG_Ulbin_Martin_2020.pdf (1,41 MB)
MD5: 5D5FF3A5871D73787DBC80B929AF4A31
 
Language:Slovenian
Work type:Master's thesis/paper (mb22)
Typology:2.09 - Master's Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
Abstract:V domeni računalniških iger problem iskanja poti in izogibanja dinamičnim oviram predstavlja enega izmed osrednjih izzivov. Potrebno ga je razrešiti na način, ki opazovalcu ustvarja vtis inteligence. V sklopu tega magistrskega dela smo razvili metodo za iskanje najkrajše poti, ki omogoča predvidevanje položaja ovir. Najprej smo preučili in predstavili najpogostejše pristope k iskanju najkrajše poti in izogibanju oviram v računalniških igrah. Na tej osnovi smo zasnovali in opisali razvoj lastne metode, ki združuje principe napovedovanja poti in sodelovalnega iskanja. Z našo metodo smo v izbranih scenarijih dosegli boljše potovalne čase agentov do njihovega cilja, kot so jih imeli z uporabo tradicionalnega pristopa k izogibanju oviram.
Keywords:algoritem A*, dinamične ovire, sodelovalno iskanje poti, lokalno izogibanje, napovedovanje poti
Year of publishing:2020
Place of performance:Maribor
Publisher:[M. Ulbin]
Number of pages:VIII, 45 str.
Source:Maribor
UDC:004.92.021(043.2)
COBISS_ID:23069974 New window
NUK URN:URN:SI:UM:DK:HAIVOBFG
Views:442
Downloads:62
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:KTFMB - FERI
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:13.02.2020

Secondary language

Language:English
Title:Implementation of a method for finding a shortest path with dynamic obstacles in computer games
Abstract:Finding the shortest path, while avoiding dynamic obstacles, is one of the most important challenges in the domain of computer games, as it is crucial for creating the illusion of an intelligent agent. In this master’s thesis, we describe a method for finding the shortest path by considering the future positions of dynamic obstacles. For this purpose, we first describe traditional approaches to finding the shortest path around dynamic obstacles in computer games and discuss in detail the development of our own method. This combines the principles of cooperative pathfinding with path prediction. Results showed that our method improves travel times in comparison to the traditional approaches.
Keywords:A* algorithm, dynamic obstacles, cooperative pathfinding, local avoidance, path prediction


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica