Skip to content

Project provides a basic application of different path searching algorithms like A *, Dijkstra

License

Notifications You must be signed in to change notification settings

mcnugets/unity-pathfinding-methods

Repository files navigation

UNITY PATHFINDING METHODS

Project provides a basic application of different path searching algorithms like A Star, Dijkstra and etc.


pathfinding

This project includes number of basic functions of ai pathfinding methods. These methods are: Dijktra algorithm, A star algorithm, Greedy Algorithm, and Breadth First Search. The basic pathfinding algorithms were implemented for the purpose of providing foundation for further game development. For this reason, current project involves number of implemented function that helps Agent(AI) to operate accordingly within the game. This Program perform operations like:

  • Patroling
  • Chasing a Player

In order for for Agent to patrol, program requires to place patrloling point throuhout the area. The moment these points are placed the agent will choose the closest point posible and will start moving accordingly. If player is within the detected range the agent switches to the chase, it switches back to patroling if player exits its range of view.

This demo project still requires further improvement. 😃