You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
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 text was updated successfully, but these errors were encountered:
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.
The text was updated successfully, but these errors were encountered: