A Dijkstra-type algorithm for dynamic games
From MaRDI portal
Publication:338209
DOI10.1007/s13235-015-0156-0zbMath1348.91060OpenAlexW2188645379MaRDI QIDQ338209
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
Programming involving graphs or networks (90C35) Differential games and control (49N70) 2-person games (91A05) Differential games (aspects of game theory) (91A23) Dynamic games (91A25) Pursuit and evasion games (49N75) Games of timing (91A55)
Related Items
Numerical event-based ISS controller design via a dynamic game approach, A discrete Hughes model for pedestrian flow on graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- A fast marching method for Hamilton-Jacobi equations modeling monotone front propagations
- Max-plus methods for nonlinear control and estimation.
- Global optimal control of perturbed systems
- 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
- Concurrent reachability games
- Can Local Single-Pass Methods Solve Any Stationary Hamilton--Jacobi--Bellman Equation?
- Robust shortest path planning and semicontractive dynamic programming
- 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
- Algorithms for stochastic games ? A survey
- Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
- 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
- Fibonacci heaps and their uses in improved network optimization algorithms
- Semi-Lagrangian Approximation Schemes for Linear and Hamilton—Jacobi Equations
- The Gauss–Seidel Numerical Procedure for Markov Stochastic Games
- Planning Algorithms
- Stochastic Games
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
- A first course on zero-sum repeated games
