Pathfinding algorithms in a dynamic 3D space

This project was my bachelor's thesis. In it I focused on identifying which pathfinding algorithm is suited best to be used by an AI navigating through a highly dynamic 3-dimensional game field. For this I implemented and compared the pathfinding algorithms A*, ARA*, Theta*, D* Lite, and AD* in a dynamic 3D test environment, using Unity.

For the full Unity project see:
https://github.com/CarinaKr/Pathfinding-in-dynmic-3D-space

This project was extended and optimised during my master thesis. See https://c4rina.itch.io/optimisation-of-pathfinding-in-dynamic-3d-space