mirror of
https://gitlab.com/OpenMW/openmw.git
synced 2025-01-30 12:32:36 +00:00
163968f578
Recastnavigation uses path cost and heuristic based on distance to find shortest path by A* algorithm. Using raw speed values makes cost much lower value than heuristic (1000 times less at maximum). Heuristic is defined as distance from node to target * 0.999 that means area cost should never be less than 0.999 or 1 for simplicity. Use max speed to make lowest possible cost factor equal to 1.