What is the best path finding algorithm, when agent is blind and cannot choose the maximum or minimum path, it can store the information once it will visit the node but can't compare two node, i tried varies path finding algorithms such as A*, DFS,BFS and Qlearning ect but more are less all are based on comparison, or on sorting method. Even I tried to simulate the path by using random search method but it always follow the same path never randomize the path? Please help me I really need help. If you ask then I will post my code.. Thanks in advance.
No comments:
Post a Comment