a-star
Heuristic and A* algorithm
I was reading about dijkstra algorithm and A* star algorithm. I know that the difference is the heuristic used. But what is a heuristic and how this influence the algorithms? Heuristic is just an way[详细]
2023-02-12 11:18 分类:问答Wikipedia A* pathfinding algorithm takes a lot of time
I\'ve successfully implemented A* pathfinding in C# but it is very slow, and I don\'t understand why. I even tried not sorting the openNodes list but it\'s still the same.[详细]
2023-02-08 02:59 分类:问答How do I create a graph from this datastructure?
I took this data structure from this A* tutorial: public interface IHasNeighbours<N> { IEnumerable<N> Neighbours { get; }[详细]
2023-02-02 09:30 分类:问答Manhattan Heuristic function for A-star (A*)
I found this algorithm here. I have a problem, I cant seem to understand how to set up and pass my heuristic function.[详细]
2023-02-01 09:09 分类:问答Structure of Astar (A*) graph search data in C#
How do you structure you graphs/nodes 开发者_JAVA技巧in a graph search class? I\'m basically creating a NavMesh and need to generate the nodes from 1 polygon to the other. The edge that joins both pol[详细]
2023-02-01 08:41 分类:问答Would it be acceptable to place bounds around my pathfinding area?
I\'m currently using the A* pathfinding algorithm to calculate a path on an infinite grid (using an UnboundedGrid in Gridworld, the AP CS case study, if that helps anyone). Everything works wonderfull[详细]
2023-02-01 07:49 分类:问答Always getting the same path with A* implementation
I\'m trying to implementing A* from the pseudo code from wikipedia however I\'m getting some weird results.[详细]
2023-01-29 07:50 分类:问答A* implementation always returns same value
I seem to be either losing my mind or misimplementing the A* algorithm: Below is my code, it seems that no matter what values I enter it will always return 360.Am I missing some critical piece of inf[详细]
2023-01-17 03:05 分类:问答Performance of an A* search implemented in Clojure
I have implemented an A* search algorithm for finding a shortest path between two states. Algorithm uses a hash-map for storing best known distances for visited states. And one hash-map for storing c[详细]
2023-01-15 04:30 分类:问答iPhone pathfinding implementation
I am trying to create a Pacman AI for the iPhone, not the Ghost AI, but Pacman himself. I am using A* for pathfinding and I have a very simple开发者_开发技巧 app up and running which calculates the sh[详细]
2023-01-10 17:12 分类:问答
加载中,请稍侯......