A Dijkstra-Type Algorithm for Dynamic Games
- First Online:
- Cite this article as:
- Bardi, M. & Maldonado López, J. Dyn Games Appl (2016) 6: 263. doi:10.1007/s13235-015-0156-0
- 173 Downloads
We study zero-sum dynamic games with deterministic transitions and alternating moves of the players. Player 1 aims at reaching a terminal set and minimizing a possibly discounted running and final cost. We propose and analyze an algorithm that computes the value function of these games extending Dijkstra’s algorithm for shortest paths on graphs. We also show the connection of these games with numerical schemes for differential games of pursuit-evasion type, if the grid is adapted to the dynamical system. Under suitable conditions, we prove the convergence of the value of the discrete game to the value of the differential game as the step of approximation tends to zero.