Developing Pathfinding Algorithms for Dynamic Environments

Developing Pathfinding Algorithms for Dynamic Environments

Algorithms for Dynamic Environments

29/8/30

Edwin Hadass

Dynamic environments are a phenomenon within video games that tend to be strictly used in multiplayer settings as it is challenging to create agents that can effectively navigate and take advantage of such a rapidly changing setting. In this paper we will discuss a simple modification to the well-known A* pathfinding algorithm that allows agents to navigate through destructible environments within a 2D setting. Furthermore, we will discuss potential improvements to our solution and alternative methods.

Computer Science
Pathfinding