Robust shortest path planning and semicontractive dynamic programming
From MaRDI portal
Publication:3120605
DOI10.1002/nav.21697zbMath1407.90087arXiv1608.01670OpenAlexW2962886523MaRDI QIDQ3120605
Publication date: 5 March 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.01670
Stochastic network models in operations research (90B15) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Discrete location and assignment (90B80) Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (6)
A Dijkstra-type algorithm for dynamic games ⋮ Regular Policies in Abstract Dynamic Programming ⋮ Deep reinforcement learning in finite-horizon to explore the most probable transition pathway ⋮ Stable Optimal Control and Semicontractive Dynamic Programming ⋮ Model-free optimal control of discrete-time systems with additive and multiplicative noises ⋮ Approximative Policy Iteration for Exit Time Feedback Control Problems Driven by Stochastic Differential Equations using Tensor Train Format
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Q-learning and policy iteration algorithms for stochastic shortest path problems
- A numerical approach to the infinite horizon problem of deterministic control theory
- Global optimal control of perturbed systems
- Stochastic optimal control. The discrete time case
- \(H^ \infty\) - optimal control and related minimax design problems. A dynamic game approach
- Ellipsoidal calculus for estimation and control
- On the robust shortest path problem.
- Robust discrete optimization and network flows
- Set invariance in control
- An exact algorithm for the robust shortest path problem with interval data
- Parallel asynchronous label-correcting methods for shortest paths
- Markov control process with the expected total cost criterion: Optimality, stability, and transient models
- Constrained model predictive control: Stability and optimality
- Deterministic control of randomly-terminated processes
- An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
- Model predictive control. With a foreword by M. J. Grimble and M. A. Johnson
- Efficient fast marching with Finsler metrics
- Concurrent reachability games
- Finite state Markovian decision processes
- Computational Methods for Risk-Averse Undiscounted Transient Markov Models
- Q-Learning and Enhanced Policy Iteration in Discounted Dynamic Programming
- Fast Two-scale Methods for Eikonal Equations
- Causal Domain Restriction for Eikonal Equations
- Approximate Dynamic Programming
- Theory and Applications of Robust Optimization
- Label-Setting Methods for Multimode Stochastic Shortest Path Problems on Graphs
- A Mixed Value and Policy Iteration Method for Stochastic Control with Universally Measurable Policies
- Distributed asynchronous computation of fixed points
- On Deterministic Control Problems: an Approximation Procedure for the Optimal Cost II. The Nonstationary Case
- The complexity of searching a graph
- Distributed dynamic programming
- An Analysis of Stochastic Shortest Path Problems
- Sufficiently informative functions and the minimax feedback control of uncertain dynamic systems
- Monotone Mappings with Application in Dynamic Programming
- Stochastic Shortest Path Games
- Fast Marching Methods
- Implementation of efficient algorithms for globally optimal trajectories
- Efficient algorithms for globally optimal trajectories
- Affine Monotonic and Risk-Sensitive Models in Dynamic Programming
- Algorithms for Countable State Markov Decision Models with an Absorbing Set
- On the Speed of Convergence of Value Iteration on Stochastic Shortest-Path Problems
- Planning Algorithms
- Negative Dynamic Programming
- Contraction Mappings in the Theory Underlying Dynamic Programming
- An Appraisal of Some Shortest-Path Algorithms
- An analysis of transient Markov decision processes
- Set-theoretic methods in control
- On terminating Markov decision processes with a risk-averse objective function
This page was built for publication: Robust shortest path planning and semicontractive dynamic programming
