Basically, when D* Lite finds an area with two neighbors, and they both have the same g value, it loops infinitely, since it always picks the same one to traverse. I haven't been able to find any good solutions, but I would be interested in trying or seeing an implementation that uses the unoptimized version.
The problems are very similar to this thread.
Basically, when D* Lite finds an area with two neighbors, and they both have the same g value, it loops infinitely, since it always picks the same one to traverse. I haven't been able to find any good solutions, but I would be interested in trying or seeing an implementation that uses the unoptimized version.