Optimal Goal-First Pathfinding - D* Lite

Опубликовано: 28 Апрель 2024
на канале: git-amend
5,424
268

Unlock the Secrets of D* Lite Pathfinding Algorithm! Today we're planning backwards from the Goal to find the Start with an algorithm that can be updated with changing nodes at runtime with minimal cost. Ideal for AI agents or any problem you need to solve when you clearly know where you want to go!

Original Paper and Algorithm: https://web.archive.org/web/202404230...

Want to support the channel? 😀
Buy me a coffee! https://ko-fi.com/adammyhre

🔔 Subscribe for more Unity Tutorials    / @git-amend  

Discord:   / discord  

#unity3d #gamedev #indiedev

▬ Contents of this video ▬▬▬▬▬▬▬▬▬▬

0:00 Algorithm Overview
3:00 Data Structures
7:40 D* Lite Implementation
19:00 Demo

Source code: https://gist.github.com/adammyhre/b8a...

Assets Shown In This Video (Affiliate Links)
Dungeon Mason Tiny Hero Duo: (FREE): https://assetstore.unity.com/packages...
Tiny Heroes: https://assetstore.unity.com/packages...
Hierarchy Icons: https://assetstore.unity.com/packages...
Better Transform: https://assetstore.unity.com/packages...
Better Mesh Filter: https://assetstore.unity.com/packages...
Kyeoms VFX: https://assetstore.unity.com/publishe...
Pure Nature 2 : Mountains: https://assetstore.unity.com/packages...
HIGHLANDS - Stylized Environment: https://assetstore.unity.com/packages...
Damage Numbers Pro: https://assetstore.unity.com/packages...

Follow me!
https://linktr.ee/gitamend