A reinforcement learning approach to convoy scheduling on a contested transportation network

DOI10.1007/S11590-015-0875-6zbMath1329.90070OpenAlexW1999955898MaRDI QIDQ895789

Daniel Stimpson, Rajesh Ganesan

Publication date: 4 December 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0875-6

zbMATH Keywords

dynamic programmingvehicle routingreinforcement learningattacker-defenderimprovised explosive deviceroute clearance

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39) Traffic problems in operations research (90B20)

Cites Work

• A simple model of optimal clearance of improvised explosive devices
• Reinforcement Learning: A Tutorial Survey and Recent Advances
• Shortest-path network interdiction
• Approximate Dynamic Programming
• Unnamed Item
• Unnamed Item

This page was built for publication: A reinforcement learning approach to convoy scheduling on a contested transportation network