Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Movement Prediction Algorithms for High Latency Games: A Testing Framework for 2D Racing Games
Blekinge Institute of Technology, Faculty of Computing, Department of Creative Technologies.
2016 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Context. In multiplayer games, player information takes time to reach other players because of network latency. This can cause inconsistencies because the actions from the other players are delayed. To increase consistency, movement prediction can be used to display other players closer to their actual position.

Objectives. The goal was to compare different prediction methods and see how well they do in a 2D racing game.

Methods. A testing framework was made to easily implement new methods and to get test results. Experiments were conducted to gather racing data from participants and was then used to analyze the performance of the methods offline. The distance error between the predicted position and the real position was used to measure the performance.

Results. Out of the implemented algorithms, Input Prediction had the lowest average distance error at all latency. All methods tested did better than Dead Reckoning when above 600ms. Stored data algorithms did not do worse when predicting on a curvy part of the track unlike the other algorithms tested.

Conclusions. Different methods are supported by different games and applications. Movement prediction should be tailored to its environment for best accuracy. Due to Input Predictions simple nature and its results here, it is a worthy contender as the go-to algorithm for games.

Place, publisher, year, edition, pages
2016. , p. 37
Series
Bachelor of Computer Science, ISSN BCS ; 2016-06
Keywords [en]
Movement Prediction, Dead Reckoning, Input Prediction, Multiplayer online games
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:bth-12916OAI: oai:DiVA.org:bth-12916DiVA, id: diva2:952076
Subject / course
DV1478 Bachelor Thesis in Computer Science
Educational program
DVGSP Game Programming
Supervisors
Examiners
Available from: 2016-08-12 Created: 2016-08-11 Last updated: 2018-01-10Bibliographically approved

Open Access in DiVA

fulltext(9792 kB)7024 downloads
File information
File name FULLTEXT02.pdfFile size 9792 kBChecksum SHA-512
3ee8a733ea2313cdf3dcc09d52dfd306662f9a84b510adac8fdeb3be316a36e2286e97555a6973fc68e12733de2d32afdf1f2ad0378d6cc2c9584d3df853f0e3
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Larsson, Emil
By organisation
Department of Creative Technologies
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 7025 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 1457 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf