path planning implementations?

[Gor Gyolchanyan]

I've been trying to find a D* lite too, but with no luck.
Having a fast graph traversal algorithms are useful for a ton of very
powerful use cases, besides path planning.
I'm starting to think, that we're gonna have to implement it ourselves.
Which in turn will require us to implement a graph data structure.
Right now I need a good graph data structure for my project, so I have
a direct interest in getting this done.
How about we chip in and develop an std..graphs module for Phobos with
different traversal and shortest-path algorithms?

On Fri, May 11, 2012 at 8:50 PM, Trass3r <un at known.com> wrote:
>> Do you mean heuristic graph traversal algorithms?
>
>
> Yep. There's a generic implementation of Dijkstra and Bellman @
> https://github.com/PhilippeSigaud/dranges
> But no A*, D* Lite etc.



-- 
Bye,
Gor Gyolchanyan.