An epsilon-greedy Dueling Deep Q-Network Based on Prioritised Experience Replay to compute the minimal time path for traversing a maze.
-
Updated
Jun 7, 2023 - Python
#
comp6247
Here is 1 public repository matching 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."