dstar-lite
dstar-lite copied to clipboard
A basic implementation of the D* lite algorithm
Hi,Arek Maybe I don't understand your code anymore,when I want to update a untraversable point to be traversable,I have found some ways to handle that ,but these are not worked....
First off, thanks for your work, it does help grasping how D* lite works. Would you consider these cases as a bug? The algorithm seems to think there is no...
The "Using in your own source" example in the read-me does not work. I get an illegal instruction error on line 390 of Dstar.cpp: cellHash[u].cost = val;