A Dijkstra-type algorithm for dynamic games

DOI10.1007/S13235-015-0156-0zbMATH Open1348.91060OpenAlexW2188645379MaRDI QIDQ338209FDOQ338209

Authors: Martino Bardi, Juan Pablo Maldonado López 

Publication date: 4 November 2016

Published in: Dynamic Games and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13235-015-0156-0

Recommendations

• A differential dynamic programming algorithm for differential games
• Approximations in Dynamic Zero-Sum Games II
• scientific article; zbMATH DE number 3876959
• Approximating the value of zero-sum differential games with linear payoffs and dynamics
• NUMERICAL METHODS FOR DIFFERENTIAL GAMES BASED ON PARTIAL DIFFERENTIAL EQUATIONS

zbMATH Keywords

pursuit-evasion gamesDijkstra algorithmdiscrete-time gameszero-sum dynamic games

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Differential games and control (49N70) Pursuit and evasion games (49N75) Differential games (aspects of game theory) (91A23) 2-person games (91A05) Dynamic games (91A25) Games of timing (91A55)

Cites Work

• A note on two problems in connexion with graphs
• Stochastic Games
• Fibonacci heaps and their uses in improved network optimization algorithms
• Algorithms for stochastic games ? A survey
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
• Semi-Lagrangian approximation schemes for linear and Hamilton-Jacobi equations
• Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
• Max-plus methods for nonlinear control and estimation.
• Efficient algorithms for globally optimal trajectories
• A fast marching level set method for monotonically advancing fronts.
• A patchy dynamic programming scheme for a class of Hamilton-Jacobi-Bellman equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• A first course on zero-sum repeated games
• Title not available (Why is that?)
• Concurrent reachability games
• Dynamic programming and optimal control. Vol. 2.
• Planning Algorithms
• An orderfield property for stochastic games when one player controls transition probabilities
• A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information
• On the homogenization of some non-coercive Hamilton-Jacobi-Isaacs equations
• Deterministic control of randomly-terminated processes
• Can local single-pass methods solve any stationary Hamilton-Jacobi-Bellman equation?
• Robust shortest path planning and semicontractive dynamic programming
• Title not available (Why is that?)
• Label-setting methods for multimode stochastic shortest path problems on graphs
• Fully-Discrete Schemes for the Value Function of Pursuit-Evasion Games with State Constraints
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Gauss–Seidel Numerical Procedure for Markov Stochastic Games
• A characteristics driven fast marching method for the eikonal equation
• A fast marching method for Hamilton-Jacobi equations modeling monotone front propagations
• Global optimal control of perturbed systems

Cited In (4)

• Algorithm for Searching an Equilibrium in a Routing Game with Piecewise Constant Cost Functions
• Numerical event-based ISS controller design via a dynamic game approach
• A Dynamic Algorithm for Reachability Games Played on Trees
• A discrete Hughes model for pedestrian flow on graphs

This page was built for publication: A Dijkstra-type algorithm for dynamic games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q338209)