Distributed Q-Learning routing for sparse graphs
Central pathfinding blows up on sparse graphs. This covers distributed Q-Learning routing: one agent per node, the update rule, a QNode class, and what happened when it replaced Dijkstra on a real traffic project.