Welcome to the TutorialPathfinding wiki! - Terasology/TutorialPathfinding GitHub Wiki

Here, you will be introduced to most of the basic concepts in path-finding along with their implementation in Terasology.

Basic Ideas in Pathfinding

This section describes common algorithms used in pathfinding.

• Dijkstra's
• A-star
• Theta star

Hierarchical Pathfinding

Even though we may have these algorithms at our disposal, the sheer number of blocks and entities that game developers deal with makes it almost impossible to use the naively. It becomes extremely important to cut down the number of nodes to make pathfinding feasible. That is where Hierarchical pathfinding can help us.

• Hierarchical A-star

The trickiest part about successfully using Hierarchical Pathfinding is implementing the different levels of abstraction needed as there is no standard way penned down anywhere. This section familiarises you with the various implementation details of Hierarchical Pathfinding we have in Terasology

• Implementation
  • Walkable Blocks
  • NavGraphChunks, Regions, Floors, and Sweeps
  • Connecting Floors, and Regions to Neighbours

Walking along the Path

Even after constructing a path, it can be pretty tricky to make a character follow the path and stay on course. We have a move_to action that makes a bee-line to the target position and a move_along_path decorator that iteratively changes the target position to the next position in the path until the destination is reached.

• MoveToAction
• MoveAlongPathNode

Finding Paths

This section describes all the utility functions that a developer who wants to use Pathfinding might need.

• The PathfinderSystem
• General Pathfinder