|Jump Point Search (Pathfinding)
|Page 2 of 2|
|Author:||Fig [ Sun Nov 11, 2018 6:52 pm ]|
|Post subject:||Re: Jump Point Search (Pathfinding)|
7/08/18 Added Fringe Search algo. (for research purpose only: too slow)
11/11/18 Correct a memory bug (occured when search on 1st and last line)
I am looking for other pathfinding implementations in Pb to merge them in my dll for different use. If you implemented an Astar yourself (or any Dijkstra like algo), i would be interested.
I am currently working on H.o.t. Queue (aka Heap On Top priority queue: very catchy name !) Data Structure to replace Binarie Heap.
https://pdfs.semanticscholar.org/b1cf/c ... 988a10.pdf
I can't find any implementation and the paper is really complex, but I think I grasp something... We will see if it's interesting to make regular A* faster.
I'll also add attraction map to Regular A* and a hierarchical component to A*.
|Page 2 of 2||All times are UTC + 1 hour|
|Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group