A Dijkstra-Type Algorithm for Dynamic Games

No abstract is available for this paper.

• Publication year

  2015

• Venue

  Dynamic Games and Applications

• Publication date

  2015-05-12

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s13235-015-0156-0
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Robust shortest path planning and semicontractive dynamic programming

  2016cited by this paper
• What is Theoretical Computer Science

  2014cited by this paper
• Semi-Lagrangian Approximation Schemes for Linear and Hamilton-Jacobi Equations

  2014cited by this paper
• Can Local Single-Pass Methods Solve Any Stationary Hamilton-Jacobi-Bellman Equation?

  2013cited by this paper
• Deterministic control of randomly-terminated processes

  2013cited by this paper
• Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid

  2012influential reference
• On the homogenization of some non-coercive Hamilton--Jacobi--Isaacs equations

  2012cited by this paper
• A Patchy Dynamic Programming Scheme for a Class of Hamilton-Jacobi-Bellman Equations

  2011cited by this paper
• A Local Ordered Upwind Method for Hamilton-Jacobi and Isaacs Equations

  2011cited by this paper
• Dynamic Programming and Optimal Control

  2010cited by this paper
• A Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations

  2009cited by this paper
• Fully-Discrete Schemes for the Value Function of Pursuit-Evasion Games with State Constraints

  2009cited by this paper
• A min‐max version of Dijkstra's algorithm with application to perturbed optimal control problems

  2007cited by this paper
• Global Optimal Control of Perturbed Systems

  2007cited by this paper
• A Fast Marching Method for Pursuit-Evasion Games

  2007influential reference
• Label-Setting Methods for Multimode Stochastic Shortest Path Problems on Graphs

  2007cited by this paper
• Planning algorithms

  2006cited by this paper
• Max-plus methods for nonlinear control and estimation

  2005cited by this paper
• The Gauss-Seidel numerical procedure for Markov stochastic games

  2004cited by this paper
• A policy-improvement type algorithm for solving zero-sum two-person stochastic games of perfect information

  2003cited by this paper
• Ordered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms

  2003cited by this paper
• Level Set Methods and Fast Marching Methods

  2003cited by this paper
• A First Course on Zero Sum Repeated Games

  2002cited by this paper
• Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science (2nd edition)

  2000influential reference
• Level Set Methods and Fast Marching Methods/ J. A. Sethian

  1999cited by this paper
• Numerical Methods for Pursuit-Evasion Games via Viscosity Solutions

  1999influential reference
• Set-Valued Numerical Analysis for Optimal Control and Differential Games

  1999cited by this paper
• Concurrent reachability games

  1998influential reference
• Optimal Control and Viscosity Solutions of Hamilton-Jacobi-Bellman Equations

  1997cited by this paper
• Competitive Markov Decision Processes

  1996cited by this paper
• A fast marching level set method for monotonically advancing fronts.

  1996cited by this paper
• Convergence of Discrete Schemes for Discontinuous Value Functions of Pursuit-Evasion Games

  1995influential reference
• New trends in dynamic games and applications

  1995cited by this paper
• Fully Discrete Schemes for the Value Function of Pursuit-Evasion Games

  1994influential reference
• Advances in Dynamic Games and Applications

  1994influential reference
• Efficient algorithms for globally optimal trajectories

  1994cited by this paper
• Algorithms for stochastic games — A survey

  1991cited by this paper
• Approximation of differential games of pursuit-evasion by discrete-time games

  1991cited by this paper
• Fibonacci heaps and their uses in improved network optimization algorithms

  1984cited by this paper
• An orderfield property for stochastic games when one player controls transition probabilities

  1981cited by this paper
• A note on two problems in connexion with graphs

  1959influential reference
• Contributions to the theory of games

  1953cited by this paper

• Tarladan Sofraya: “Graf Teorisi” ile Tarım Ürünleri Fiyat Değişkenliklerinin Analizi

  2025cites this paper
• Monotone Causality in Opportunistically Stochastic Shortest Path Problems

  2023cites this paper
• Robust shortest path planning and semicontractive dynamic programming

  2016influential citation
• A discrete Hughes model for pedestrian flow on graphs

  2016cites this paper
• Numerical ISpS controller design on coarse quantizations : A dynamic game approach for large-scale systems.

  2016cites this paper
• Numerical event-based ISS controller design via a dynamic game approach

  2015cites this paper