#

comp6247

Here is 1 public repository matching this topic...

Resh-97 / Dynamic_Maze_Solving

An epsilon-greedy Dueling Deep Q-Network Based on Prioritised Experience Replay to compute the minimal time path for traversing a maze.

reinforcement-learning q-learning epsilon-greedy dueling-dqn minimal-path dynamic-maze comp6247

Updated Jun 7, 2023
Python

Improve this page

Add a description, image, and links to the comp6247 topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the comp6247 topic, visit your repo's landing page and select "manage topics."