qertee.blogg.se - Disick path finder algorithm

The main drawback of path recalculation is that a lot of path information is thrown away.

Whenever the world near the unit has changed.

Whenever the unit turns a corner or passes a waypoint.

Whenever extra CPU time is available: this allows dynamic adjustment of path quality as more units are deployed, or if the game is running on a slower computer, CPU usage per unit can be decreased.

Every N steps: this guarantees that the information used to calculate the path is not more than N steps old.

Listed below are some criteria that could be used for determining when a recalculation is needed: It may be worth updating old paths with new information. A path found some time ago may no longer be the optimal path.

Recalculating paths #Īs time passes we expect the game world to change. If however obstacles can cause the path to change significantly, consider using the pathfinder for obstacle avoidance. The pathfinder will find the desired path, and then while following it, move around obstacles.

If the typical obstacle can be routed around, use a separate obstacle avoidance algorithm (steering) along with your pathfinder. A pathfinding algorithm will compute a path around stationary obstacles, but what if the obstacles move? By the time a unit reaches a particular point, an obstacle may no longer be there, or a new obstacle may be there.