Polunetsinnän algoritmit ja niiden tehokkuus

Tässä tutkimuksessa tutkitaan erilaisten polunetsinnän algoritmeja ja niiden tehokkuutta 2D-videopelimaailmassa. Tutkittavat algoritmit ovat A*-algoritmi, Dijkstran algoritmi, Breadth-first algoritmi, Depth-first algoritmi ja kuinka näitä algoritmeja voidaan hyödyntää hierarkkisen polunsuunnittelun...

Full description

Bibliographic Details
Main Author: Laitinen, Riku
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: 2021
Subjects:
Online Access: https://jyx.jyu.fi/handle/123456789/76078
_version_ 1828193204946599936
author Laitinen, Riku
author2 Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_facet Laitinen, Riku Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä Laitinen, Riku Informaatioteknologian tiedekunta Faculty of Information Technology Informaatioteknologia Information Technology Jyväskylän yliopisto University of Jyväskylä
author_sort Laitinen, Riku
datasource_str_mv jyx
description Tässä tutkimuksessa tutkitaan erilaisten polunetsinnän algoritmeja ja niiden tehokkuutta 2D-videopelimaailmassa. Tutkittavat algoritmit ovat A*-algoritmi, Dijkstran algoritmi, Breadth-first algoritmi, Depth-first algoritmi ja kuinka näitä algoritmeja voidaan hyödyntää hierarkkisen polunsuunnittelun kanssa. In this thesis we research different pathfinding algorithms and their efficiency in 2D-videogame environment. The algorithms used in this thesis are A-star algorithm, Dijkstra algorithm, Breadth-first algorithm, Depth-first algorithm and how these algorithms can be used in hierarchical path planning.
first_indexed 2024-09-11T08:51:19Z
format Kandityö
free_online_boolean 1
fullrecord [{"key": "dc.contributor.advisor", "value": "Tuomo, Rossi", "language": "", "element": "contributor", "qualifier": "advisor", "schema": "dc"}, {"key": "dc.contributor.author", "value": "Laitinen, Riku", "language": "", "element": "contributor", "qualifier": "author", "schema": "dc"}, {"key": "dc.date.accessioned", "value": "2021-05-31T10:03:57Z", "language": null, "element": "date", "qualifier": "accessioned", "schema": "dc"}, {"key": "dc.date.available", "value": "2021-05-31T10:03:57Z", "language": null, "element": "date", "qualifier": "available", "schema": "dc"}, {"key": "dc.date.issued", "value": "2021", "language": "", "element": "date", "qualifier": "issued", "schema": "dc"}, {"key": "dc.identifier.uri", "value": "https://jyx.jyu.fi/handle/123456789/76078", "language": null, "element": "identifier", "qualifier": "uri", "schema": "dc"}, {"key": "dc.description.abstract", "value": "T\u00e4ss\u00e4 tutkimuksessa tutkitaan erilaisten polunetsinn\u00e4n algoritmeja ja niiden tehokkuutta 2D-videopelimaailmassa. Tutkittavat algoritmit ovat A*-algoritmi, Dijkstran algoritmi, Breadth-first algoritmi, Depth-first algoritmi ja kuinka n\u00e4it\u00e4 algoritmeja voidaan hy\u00f6dynt\u00e4\u00e4 hierarkkisen polunsuunnittelun kanssa.", "language": "fi", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.abstract", "value": "In this thesis we research different pathfinding algorithms and their efficiency in 2D-videogame environment. The algorithms used in this thesis are A-star algorithm, Dijkstra algorithm, Breadth-first algorithm, Depth-first algorithm and how these algorithms can be used in hierarchical path planning.", "language": "en", "element": "description", "qualifier": "abstract", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Submitted by Paivi Vuorio (paelvuor@jyu.fi) on 2021-05-31T10:03:57Z\nNo. of bitstreams: 0", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.description.provenance", "value": "Made available in DSpace on 2021-05-31T10:03:57Z (GMT). No. of bitstreams: 0\n Previous issue date: 2021", "language": "en", "element": "description", "qualifier": "provenance", "schema": "dc"}, {"key": "dc.format.extent", "value": "24", "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": "Depth-first", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "Breadth-first", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "Dijkstran", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.subject.other", "value": "A-star", "language": "", "element": "subject", "qualifier": "other", "schema": "dc"}, {"key": "dc.title", "value": "Polunetsinn\u00e4n algoritmit ja niiden tehokkuus", "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-202105313321", "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": "algoritmit", "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_76078
language fin
last_indexed 2025-03-31T20:03:17Z
main_date 2021-01-01T00:00:00Z
main_date_str 2021
online_boolean 1
online_urls_str_mv {"url":"https:\/\/jyx.jyu.fi\/bitstreams\/730534de-8791-4c07-98c7-3af927763a4d\/download","text":"URN:NBN:fi:jyu-202105313321.pdf","source":"jyx","mediaType":"application\/pdf"}
publishDate 2021
record_format qdc
source_str_mv jyx
spellingShingle Laitinen, Riku Polunetsinnän algoritmit ja niiden tehokkuus Depth-first Breadth-first Dijkstran A-star Tietotekniikka Mathematical Information Technology 602 algoritmit
title Polunetsinnän algoritmit ja niiden tehokkuus
title_full Polunetsinnän algoritmit ja niiden tehokkuus
title_fullStr Polunetsinnän algoritmit ja niiden tehokkuus Polunetsinnän algoritmit ja niiden tehokkuus
title_full_unstemmed Polunetsinnän algoritmit ja niiden tehokkuus Polunetsinnän algoritmit ja niiden tehokkuus
title_short Polunetsinnän algoritmit ja niiden tehokkuus
title_sort polunetsinnän algoritmit ja niiden tehokkuus
title_txtP Polunetsinnän algoritmit ja niiden tehokkuus
topic Depth-first Breadth-first Dijkstran A-star Tietotekniikka Mathematical Information Technology 602 algoritmit
topic_facet 602 A-star Breadth-first Depth-first Dijkstran Mathematical Information Technology Tietotekniikka algoritmit
url https://jyx.jyu.fi/handle/123456789/76078 http://www.urn.fi/URN:NBN:fi:jyu-202105313321
work_keys_str_mv AT laitinenriku polunetsinnänalgoritmitjaniidentehokkuus