This project introduces CentA*, an extension of the A* algorithm, for optimized NPC pathfinding in game development. Implemented in Unreal Engine 5, the algorithm enhances starting and ending node selection, improving efficiency. The system, developed with Blueprints and C++, features diverse enemy behaviors governed by a behavior tree. The balance between accuracy and efficiency in pathfinding accommodates obstacles, dynamic environments, and multiple agents. The project highlights the critical role of pathfinding algorithms in creating realistic and immersive gaming experiences. CentA* stands out as an improvement over traditional A*, offering enhanced NPC behavior and an elevated gaming experience.

AI pathfinding plays a pivotal role in game development, enabling non-player characters (NPCs) to seamlessly navigate the intricate landscapes of a virtual world. Pathfinding algorithms are instrumental in determining the most efficient route for NPCs, enhancing the realism and immersion of gameplay.

• The project introduces the Cent A* Algorithm, a specialized version of the A* algorithm, for enhanced pathfinding.
• Behavior Trees (BT) are employed to structure and control NPC behavior, representing a directed acyclic graph.
• Each node in the BT signifies a specific behavior or action, with edges defining the control flow between nodes.
• The Cent A* Algorithm is integrated into the BT framework, optimizing NPC navigation and behavior in the game world.

• Have a grid and good pathfinding Algorithm for our NPC AI.
• Reload the algorithm at every frame tick of the game so we can have a dynamic and real-time path-finding algorithm.
• Attach grid mesh with NPC with Spring arm such that grid moves along with NPC providing it extra and limited range at the same time.
• Construct a Behaviour tree such that it acts as the brain of the AI.
• Our Behaviour Tree should be able to encounter any type of disturbance in the way.

In our approach to game development, pathfinding is crucial for NPC navigation. We employ a specialized algorithm that identifies the most promising start and end positions, calculated by distances falling under the A* algorithm's path. The algorithm execution optimizes NPC navigation, initiating behavior earlier than traditional A* techniques. This proactive approach integrates seamlessly, allowing diverse NPC behaviors and enhancing overall artificial intelligence interaction in the game environment.

• Creating a new algorithm that can work better than the existing path-finding algorithms.
• Modified the A* algorithm by using heuristic as Euclidean distance instead of using Manhattan distance and starting the path-finding from the closest block to reaching the closest enemy block.

This algorithm is similar to the A* algorithm in finding the F-Cost value of each node. But the performance differentiates when either the Start or Target object falls under different nodes at a time as in Figure. This helps with the object that has greater areas and acts as an early behavior trigger in the pathfinding.

The Blueprint visual scripting system enables game designers and artists to create game logic and behavior without writing a single line of code. This allows for rapid prototyping, iteration, and experimentation, which speeds up the development process. All the blueprints in the project can be found here.

The proposed algorithm of the project can be found here.

The comparison is based on 3 different scenarios, and the results are shown in the figure below. According to the results, the algorithm developed outperforms the other algorithms in Scenarios 1 and 2 in terms of path length and time consumption. However, in Scenario 3, the algorithm performs the worst due to the nodes being closed, leading to the shortest path being blocked. Nevertheless, the algorithm is still shown to be effective in finding shorter paths and consuming less time, as it initiates the behavior of the NPC AI on the most promising nodes instead of the centroid of the object nodes. The results highlight the importance of choosing the appropriate pathfinding algorithm based on the game environment and scenario, as different algorithms may perform differently in different situations. You can find all the Scenarios in which the experiments were conducted here.

The CentA* algorithm extends A* by providing it with a more optimal start and end node, which enhances the algorithm's efficiency and effectiveness. By doing so, the algorithm can identify the most efficient path between two points in a graph more quickly and accurately than other pathfinding algorithms. The experiments carried out show that the CentA* algorithm is a superior pathfinding algorithm in terms of efficiency and accuracy when compared to Dijkstra’s Algorithm, Greedy Best-First, and A* algorithm