Routing in a Sparse Graph: a Distributed Q-Learning Approach
Distributed agents need only decide one move ahead.
The post Routing in a Sparse Graph: a Distributed Q-Learning Approach appeared first on Towards Data Science.
Sébastien Gilbert
Go to original source