veitR/mod-playerbots
1
0
Fork 0
mirror of https://github.com/liyunfan1223/mod-playerbots.git synced 2026-06-20 15:39:25 +02:00
Code Issues Packages Projects Releases Wiki Activity

Revert non-progress chained-probe detection (broke valid paths)

Browse Source
This commit is contained in:
bash 2026-05-18 00:59:59 +02:00
parent 5cf7a2e0db
commit b1dde93827
1 changed files with 0 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

23
src/Mgr/Travel/TravelMgr.cpp
View File

@ -852,18 +852,6 @@ std::vector<WorldPosition> WorldPosition::getPathFromPath(std::vector<WorldPosit
PathGenerator path(pathUnit);
// Non-progress detection: track best distance-to-target seen so
// far. Bail only after many consecutive iterations with no
// meaningful improvement — the chained probe can legitimately
// zigzag (especially on dense vertical-stacked polys like spiral
// ramps) so we want a generous threshold to avoid false positives.
// Trigger fires only when stuck for ~10 iterations in a navmesh
// pocket where no step gets us 1y closer to the target.
float bestDistToTarget = std::numeric_limits<float>::max();
uint32 iterSinceImprovement = 0;
constexpr uint32 MAX_ITER_NO_IMPROVEMENT = 10;
constexpr float MIN_IMPROVEMENT = 1.0f;
// Limit the pathfinding attempts
for (uint32 i = 0; i < maxAttempt; i++)
{
@ -883,17 +871,6 @@ std::vector<WorldPosition> WorldPosition::getPathFromPath(std::vector<WorldPosit
if (isPathTo(subPath))
break;
float distNow = this->distance(&subPath.back());
if (distNow < bestDistToTarget - MIN_IMPROVEMENT)
{
bestDistToTarget = distNow;
iterSinceImprovement = 0;
}
else if (++iterSinceImprovement >= MAX_ITER_NO_IMPROVEMENT)
{
break;
}
currentPos = subPath.back();
}