grime2d/baseoneaslib

Automatically exported from code.google.com/p/baseoneaslib

baseoneaslib's Issues

Performance is suboptimal, specially when attempting to reach unwalkable positions

I am currently using your library for pathfinding within my project. On a
50x50 grid, with some large obejcts to block the way (up to 10x10), when
attempting to reach an internal node of the blocked area, computaiton time
for the path would go up to 1 second (freezing everything in the meantime).

I have edited your AStar class and was able to reduce computation time for
40%, reaching times of around 0.6 secs. If visiting is disabled, then
computation time goes down to 0.2 secs, still a little bit high, but way
better than the original.

I am submiting the patch with visiting enabled for you to include in the
source if you see fit. I've basically cleaned up the no-path-found section
(which computed the path a couple times, and needlessly called the distance
function), as well as changed the closed list for a dictionary (since order
is not important). I've also noticed a slight improvement by using
Array.sortOn rather than manually searching for the node with the best f.

Regards

Original issue reported on code.google.com by [email protected] on 16 Nov 2009 at 7:03

Attachments:

• AStar.patch

AStar has a bug when calculating variable node costs

Seems to be something with the calculation of G and F costs

Original issue reported on code.google.com by [email protected] on 28 Mar 2008 at 9:56