This poject is based on the original D* Lite paper by Sven Koenig and Maxim Likhachev.
The D* Lite algorithm was written to be a "novel fast replanning method for robot navigation in unknown terrain". It searches "from the goal vertex towards the current vertex of the robot, uses heuristics to focus the search" and efficiently uses the priortity queue to minimize reordering.
Currently written for Python 3 and the biggest requirement is having Pygame. Instructions for installing pygame can be found at https://www.pygame.org/wiki/GettingStarted.
Run the example demo with python3 main.py (or python main.py if you have Python 3 installed as such on your system or in your environment). The demo shows off the dynamic replanning ability of the path planning algorithm by allowing the user to add obstacles by clicking on cells in the grid. Our mobile agent is the red circle, while the goal cell is green. The agent has a visibility range, shown by the thin black lines, and added obstacles are not taken into account by the agent until they are visible and change to darker grey. Pressing space bar makes the agent observe new obstacles, replan if necessary, and advances on the current best path until the goal is reached.
More notes to come on how the code is organized...
Feel free to add more specific questions about the project in comments on issue #1, so that I can add better documentation.