Reitinhakualgoritmien vertailu videopeliympäristöissä

Reitinhaku on prosessi, jossa etsitään reittiä maaliin erilaisissa ympäristöissä. Tässsä tutkielmassa vertaillaan keskenään erilaisia reitinhakualgoritmeja, ja arvioidaan niiden käytettävyyttä videopeliympäristöissä. Algoritmien kompastuskiviä pyritään hahmottamaan ensisijaisesti tarkastelemalla alg...

Full description

Bibliographic Details
Main Author: Pollari, Joonas
Other Authors: Informaatioteknologian tiedekunta, Faculty of Information Technology, Informaatioteknologia, Information Technology, Jyväskylän yliopisto, University of Jyväskylä
Format: Bachelor's thesis
Language:fin
Published: 2020
Subjects:
Online Access: https://jyx.jyu.fi/handle/123456789/68948
_version_ 1826225801494790144
author Pollari, Joonas
author2 Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_facet Pollari, Joonas Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä Pollari, Joonas Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_sort Pollari, Joonas
datasource_str_mv jyx
description Reitinhaku on prosessi, jossa etsitään reittiä maaliin erilaisissa ympäristöissä. Tässsä tutkielmassa vertaillaan keskenään erilaisia reitinhakualgoritmeja, ja arvioidaan niiden käytettävyyttä videopeliympäristöissä. Algoritmien kompastuskiviä pyritään hahmottamaan ensisijaisesti tarkastelemalla algoritmien toimintaa avoimissa ympäristöissä. Tarkasteltavista algoritmeista A*-algoritmi osoittautuu selvästi muita algoritmeja ylivertaisemmaksi ja käytetymmäksi. Tutkielman havaintoja hyödyntämällä kyetään tekemään parempia ratkaisuja käytettävien reitinhakualgoritmien valinnassa. Jatkotutkimuksen kannalta todetaan A*-algoritmin optimoinnin tarjoavan hyvin mahdollisuuksia. Pathfinding is the process of finding a route to a desired destination in different environments. This dissertation compares different pathfinding algorithms and evaluates their usability in video game environments. The stumbling blocks of algorithms are sought to be perceived primarily by looking at the operation of algorithms in open environments. Of the algorithms examined, the A * algorithm proves to be clearly superior and more used than other algorithms. By utilizing the findings of the dissertation, it is possible to make better decisions in the choice of pathfinding algorithms to be used. Considering further research, it is stated that the optimization of the A * algorithm offers great opportunities.
first_indexed 2020-05-12T20:05:45Z
format Kandityö
free_online_boolean 1
fullrecord [{"key": "dc.contributor.advisor", "value": "Lakanen, Antti-Jussi", "language": "", "element": "contributor", "qualifier": "advisor", "schema": "dc"}, {"key": "dc.contributor.author", "value": "Pollari, Joonas", "language": "", "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2020-05-12T12:32:18Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2020-05-12T12:32:18Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "2020", "language": "", "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/68948", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "Reitinhaku on prosessi, jossa etsit\u00e4\u00e4n reitti\u00e4 maaliin erilaisissa ymp\u00e4rist\u00f6iss\u00e4.\nT\u00e4sss\u00e4 tutkielmassa vertaillaan kesken\u00e4\u00e4n erilaisia reitinhakualgoritmeja, ja arvioidaan niiden\nk\u00e4ytett\u00e4vyytt\u00e4 videopeliymp\u00e4rist\u00f6iss\u00e4. Algoritmien kompastuskivi\u00e4 pyrit\u00e4\u00e4n hahmottamaan\nensisijaisesti tarkastelemalla algoritmien toimintaa avoimissa ymp\u00e4rist\u00f6iss\u00e4. Tarkasteltavista\nalgoritmeista A*-algoritmi osoittautuu selv\u00e4sti muita algoritmeja ylivertaisemmaksi\nja k\u00e4ytetymm\u00e4ksi. Tutkielman havaintoja hy\u00f6dynt\u00e4m\u00e4ll\u00e4 kyet\u00e4\u00e4n tekem\u00e4\u00e4n parempia ratkaisuja\nk\u00e4ytett\u00e4vien reitinhakualgoritmien valinnassa. Jatkotutkimuksen kannalta todetaan\nA*-algoritmin optimoinnin tarjoavan hyvin mahdollisuuksia.", "language": "fi", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.abstract", "value": "Pathfinding is the process of finding a route to a desired destination in different environments.\nThis dissertation compares different pathfinding algorithms and evaluates their\nusability in video game environments. The stumbling blocks of algorithms are sought to be\nperceived primarily by looking at the operation of algorithms in open environments. Of the\nalgorithms examined, the A * algorithm proves to be clearly superior and more used than\nother algorithms. By utilizing the findings of the dissertation, it is possible to make better\ndecisions in the choice of pathfinding algorithms to be used. Considering further research, it\nis stated that the optimization of the A * algorithm offers great opportunities.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by Paivi Vuorio (paelvuor@jyu.fi) on 2020-05-12T12:32:18Z\nNo. of bitstreams: 0", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2020-05-12T12:32:18Z (GMT). No. of bitstreams: 0\n Previous issue date: 2020", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.extent", "value": "19", "language": "", "element": "format", "qualifier": "extent", "schema": "dc"}, {"key": "dc.language.iso", "value": "fin", "language": null, "element": "language", "qualifier": "iso", "schema": "dc"}, {"key": "dc.rights", "value": "In Copyright", "language": "en", "element": "rights", "qualifier": null, "schema": "dc"}, {"key": "dc.subject.other", "value": "reitinhaku", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "solmuverkko", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "syvyyshaku", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "leveyshaku", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "Dijkstran algoritmi", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "A*", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "Reitinhakualgoritmien vertailu videopeliymp\u00e4rist\u00f6iss\u00e4", "language": "", "element": "title", "qualifier": null, "schema": "dc"}, {"key": "dc.type", "value": "bachelor thesis", "language": null, "element": "type", "qualifier": null, "schema": "dc"}, {"key": "dc.identifier.urn", "value": "URN:NBN:fi:jyu-202005123156", "language": "", "element": "identifier", "qualifier": "urn", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Bachelor's thesis", "language": "en", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.type.ontasot", "value": "Kandidaatinty\u00f6", "language": "fi", "element": "type", "qualifier": "ontasot", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Informaatioteknologian tiedekunta", "language": "fi", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.faculty", "value": "Faculty of Information Technology", "language": "en", "element": "contributor", "qualifier": "faculty", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Informaatioteknologia", "language": "fi", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.department", "value": "Information Technology", "language": "en", "element": "contributor", "qualifier": "department", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "Jyv\u00e4skyl\u00e4n yliopisto", "language": "fi", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.contributor.organization", "value": "University of Jyv\u00e4skyl\u00e4", "language": "en", "element": "contributor", "qualifier": "organization", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Tietotekniikka", "language": "fi", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "dc.subject.discipline", "value": "Mathematical Information Technology", "language": "en", "element": "subject", "qualifier": "discipline", "schema": "dc"}, {"key": "yvv.contractresearch.funding", "value": "0", "language": "", "element": "contractresearch", "qualifier": "funding", "schema": "yvv"}, {"key": "dc.type.coar", "value": "http://purl.org/coar/resource_type/c_7a1f", "language": null, "element": "type", "qualifier": "coar", "schema": "dc"}, {"key": "dc.rights.accesslevel", "value": "openAccess", "language": null, "element": "rights", "qualifier": "accesslevel", "schema": "dc"}, {"key": "dc.type.publication", "value": "bachelorThesis", "language": null, "element": "type", "qualifier": "publication", "schema": "dc"}, {"key": "dc.subject.oppiainekoodi", "value": "602", "language": "", "element": "subject", "qualifier": "oppiainekoodi", "schema": "dc"}, {"key": "dc.subject.yso", "value": "videopelit", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.subject.yso", "value": "algoritmit", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.subject.yso", "value": "solmut", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.subject.yso", "value": "reitit", "language": null, "element": "subject", "qualifier": "yso", "schema": "dc"}, {"key": "dc.rights.url", "value": "https://rightsstatements.org/page/InC/1.0/", "language": null, "element": "rights", "qualifier": "url", "schema": "dc"}]
id jyx.123456789_68948
language fin
last_indexed 2025-02-18T10:54:23Z
main_date 2020-01-01T00:00:00Z
main_date_str 2020
online_boolean 1
online_urls_str_mv {"url":"https:\/\/jyx.jyu.fi\/bitstreams\/fddd7a67-c4af-48a2-bc50-c87ddf509652\/download","text":"URN:NBN:fi:jyu-202005123156.pdf","source":"jyx","mediaType":"application\/pdf"}
publishDate 2020
record_format qdc
source_str_mv jyx
spellingShingle Pollari, Joonas Reitinhakualgoritmien vertailu videopeliympäristöissä reitinhaku solmuverkko syvyyshaku leveyshaku Dijkstran algoritmi A* Tietotekniikka Mathematical Information Technology 602 videopelit algoritmit solmut reitit
title Reitinhakualgoritmien vertailu videopeliympäristöissä
title_full Reitinhakualgoritmien vertailu videopeliympäristöissä
title_fullStr Reitinhakualgoritmien vertailu videopeliympäristöissä Reitinhakualgoritmien vertailu videopeliympäristöissä
title_full_unstemmed Reitinhakualgoritmien vertailu videopeliympäristöissä Reitinhakualgoritmien vertailu videopeliympäristöissä
title_short Reitinhakualgoritmien vertailu videopeliympäristöissä
title_sort reitinhakualgoritmien vertailu videopeliympäristöissä
title_txtP Reitinhakualgoritmien vertailu videopeliympäristöissä
topic reitinhaku solmuverkko syvyyshaku leveyshaku Dijkstran algoritmi A* Tietotekniikka Mathematical Information Technology 602 videopelit algoritmit solmut reitit
topic_facet 602 A* Dijkstran algoritmi Mathematical Information Technology Tietotekniikka algoritmit leveyshaku reitinhaku reitit solmut solmuverkko syvyyshaku videopelit
url https://jyx.jyu.fi/handle/123456789/68948 http://www.urn.fi/URN:NBN:fi:jyu-202005123156
work_keys_str_mv AT pollarijoonas reitinhakualgoritmienvertailuvideopeliympäristöissä