Archived

This topic is now archived and is closed to further replies.

chengseesin

path finding

Recommended Posts

i have read thru Justin Heyes-Jones''s A* path finding. Its very impressive. I have made a bit change in the coding which is when the goal was in a place that block by ocstacle in all direction which means that the start node will never reach the goal node and in this situation i will return the nearest path to the goal. The problem i encounter is when this situation happen, the program will delay for 1 or 2 second (its because the "while loop" will loop untill he find the goal node). Can anyone tell me how to fix this problem?

Share this post


Link to post
Share on other sites
Sounds like, you need a better threshold to realize when the goal state is being blocked...basically when the program notices that the short path has been found, to stop calculating, what is sounds like it may be doing is going back to the open list too look for another possible path..you need another heuristic to say when the goal state is blocked...then to halt your calculations...

-Lucas

Share this post


Link to post
Share on other sites