Re:Faster pathfinding using Jump Point Search
by harada on Wednesday September 07, 2011 @08:02AM
(#2969213)
This behaviour exists because A*'s heuristic function assumes there are no obstacles when estimating the remaining distance to reach the goal. As the difference between the heuristic estimate to the goal and the actual distance increases, some nodes "behind" the start location will appear more promising than other nodes which are eventually proven to be on the optimal path.
[ Parent
| on HN ]
There are no comments on this comment yet.