Skip to content

Latest commit

 

History

History
25 lines (15 loc) · 527 Bytes

README.md

File metadata and controls

25 lines (15 loc) · 527 Bytes

Optimizing Warehouse Flow

Given points X and Y the goal is to find the shortest path from X to Y by using Reinforcement Learning from scratch. The only library available is Numpy.

Image description

How to use it?

python start.py

# from q_learning import route

# route('E', 'G')
# ['E', 'I', 'J', 'F', 'B', 'C', 'G']

# route('C', 'L')
# ['C', 'G', 'H', 'L']

Settings

  • Python 3.7.3
  • Numpy 1.18.1