PENCARIAN RUTE TERDEKAT PADA PERMAINAN DENGAN HALANGAN DINAMIS MENGGUNAKAN METODE D* LITE

IHWAN, M MUNIRUL and Abdiansah, Abdiansah and Primanita, Anggina (2024) PENCARIAN RUTE TERDEKAT PADA PERMAINAN DENGAN HALANGAN DINAMIS MENGGUNAKAN METODE D* LITE. Undergraduate thesis, Sriwijaya University.

	Text RAMA_55201_09021381924118.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (5MB) | Request a copy
	Text RAMA_55201_09021381924118_TURNITIN.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (3MB) | Request a copy
	Text RAMA_55201_09021381924118_0001108401_0206088901_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (3MB)
	Text RAMA_55201_09021381924118_0001108401_0206088901_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (360kB) | Request a copy
	Text RAMA_55201_09021381924118_0001108401_0206088901_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (154kB) | Request a copy
	Text RAMA_55201_09021381924118_0001108401_0206088901_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) | Request a copy
	Text RAMA_55201_09021381924118_0001108401_0206088901_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (480kB) | Request a copy
	Text RAMA_55201_09021381924118_0001108401_0206088901_06.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (88kB) | Request a copy
	Text RAMA_55201_09021381924118_0001108401_0206088901_07_ref.pdf - Bibliography Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (119kB) | Request a copy
	Text RAMA_55201_09021381924118_0001108401_0206088901_08_lamp.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (139kB) | Request a copy

Abstract

Pathfinding in games presents a complex challenge, particularly when the game environment is dynamic and unpredictable. The D* Lite algorithm is an advanced solution that offers advantages in efficiently finding optimal paths in environments that frequently change. Unlike conventional pathfinding algorithms, D* Lite can quickly update previously computed paths when changes occur in the map, such as new obstacles appearing or changes in goals. This algorithm combines time efficiency and lower memory usage, making it particularly suitable for game applications requiring real-time agent navigation. This paper explores the implementation of D* Lite in games, compares its performance with the classical D* algorithm, and evaluates its advantages in dynamic game scenarios.

Item Type:	Thesis (Undergraduate)
Uncontrolled Keywords:	pathfinding game, D* Lite, navigasi dinamis, algoritma pathfinding, lingkungan permainan adaptif.
Subjects:	Q Science > Q Science (General) > Q334-342 Computer science. Artificial intelligence. Algorithms. Robotics. Automation.
Divisions:	09-Faculty of Computer Science > 55201-Informatics (S1)
Depositing User:	M Munirul Ihwan
Date Deposited:	06 Sep 2024 01:23
Last Modified:	06 Sep 2024 01:23
URI:	http://repository.unsri.ac.id/id/eprint/156792

Actions (login required)

View Item