Optimisation of pathfinding in a dynamic 3D space

This project was my master thesis. It is a continued work based on my bachelor thesis (see https://c4rina.itch.io/pathfinding-algorithms-in-a-dynamic-3d-space) and focuses on the optimisation of pathfinding in dynamic 3D space.

For this different pathfinding algorithms, e.g. A*, Theta*,  MT-D* Lite, and JPS, were  implemented and optimised, for example by using Unity's C# Job System and Burst compiler.

Additionally, a new “hybrid” search graph was developed as well as an Any-angle Moving Target D* Lite pathfinding algorithm combining the any-angle aspects of Theta* with the dynamic characteristics of MT-D* Lite.

You can find the complete thesis, including source code and the Unity project on GitHub: 
https://github.com/CarinaKr/Optimisation-of-pathfinding-in-dynamic-3D-space

For a demonstation of the pathfinding system see:
https://youtu.be/RUUsUAHiFQA