Skripsi

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

---

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.

---

Availability

Detail Information

Series Title

-

Call Number

T1567922024

Publisher

Indralaya : Prodi Teknik Informatika, Fakultas Ilmu Komputer., 2024

Collation

xiv, 58 hlm.; ilus.; 29 cm

Language

Indonesia

ISBN/ISSN

-

Classification

794.815 07

Content Type

Text

Media Type

unmediated

Carrier Type

-

Edition

-

Subject(s)

Pencarian rute
Prodi Teknik Informatika

Specific Detail Info

-

Statement of Responsibility

KA

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment