Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
|
|
SLO
|
ENG
|
Cookies and privacy
DKUM
EPF - Faculty of Business and Economics
FE - Faculty of Energy Technology
FERI - Faculty of Electrical Engineering and Computer Science
FF - Faculty of Arts
FGPA - Faculty of Civil Engineering, Transportation Engineering and Architecture
FKBV - Faculty of Agriculture and Life Sciences
FKKT - Faculty of Chemistry and Chemical Engineering
FL - Faculty of Logistic
FNM - Faculty of Natural Sciences and Mathematics
FOV - Faculty of Organizational Sciences in Kranj
FS - Faculty of Mechanical Engineering
FT - Faculty of Tourism
FVV - Faculty of Criminal Justice and Security
FZV - Faculty of Health Sciences
MF - Faculty of Medicine
PEF - Faculty of Education
PF - Faculty of Law
UKM - University of Maribor Library
UM - University of Maribor
UZUM - University of Maribor Press
COBISS
Faculty of Business and Economic, Maribor
Faculty of Agriculture and Life Sciences, Maribor
Faculty of Logistics, Celje, Krško
Faculty of Organizational Sciences, Kranj
Faculty of Criminal Justice and Security, Ljubljana
Faculty of Health Sciences
Library of Technical Faculties, Maribor
Faculty of Medicine, Maribor
Miklošič Library FPNM, Maribor
Faculty of Law, Maribor
University of Maribor Library
Bigger font
|
Smaller font
Introduction
Search
Browsing
Upload document
Statistics
Login
First page
>
Show document
Show document
Title:
Iskanje poti v računalniških igrah : zaključno delo
Authors:
ID
Balaj, Leon
(
Author
)
ID
Kolmanič, Simon
(
Mentor
)
More about this mentor...
Files:
VS_Balaj_Leon_2019.pdf
(1,31 MB)
MD5: 4F96AFADF83766AE067AD35613A267A1
PID:
20.500.12556/dkum/72f7df96-a190-4af0-b16b-0e34a1dcb0a4
Language:
Slovenian
Work type:
Bachelor thesis/paper
Typology:
2.11 - Undergraduate Thesis
Organization:
FERI - Faculty of Electrical Engineering and Computer Science
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*
Place of publishing:
Maribor
Place of performance:
Maribor
Publisher:
[L. Balaj]
Year of publishing:
2019
Number of pages:
X, 42 str.
PID:
20.500.12556/DKUM-75394
UDC:
004.92.021(043.2)
COBISS.SI-ID:
22922262
NUK URN:
URN:SI:UM:DK:OMUGPEJ9
Publication date in DKUM:
04.12.2019
Views:
1740
Downloads:
134
Metadata:
Categories:
KTFMB - FERI
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Average score:
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
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:
04.11.2019
Secondary language
Language:
English
Title:
Pathfinding in computer games
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.
Keywords:
computer games
,
Unity
,
pathfinding
,
Dijkstra's algorithm
,
A* search algorithm
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back
