Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Patek (2007)
Partially Observed Stochastic Shortest Path Problems With Approximate Solution by Neurodynamic ProgrammingIEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 37
C. Derman (1970)
Finite State Markovian Decision Processes
S Russell, P Norvig (2009)
Artificial intelligence: a modern approach
D. Bertsekas, J. Tsitsiklis (1991)
An Analysis of Stochastic Shortest Path ProblemsMath. Oper. Res., 16
E. Hansen, Ibrahim Abdoulahi (2016)
General Error Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems
D. Bertsekas (1987)
Dynamic Programming: Deterministic and Stochastic Models
J. Eaton, L. Zadeh (1962)
Optimal Pursuit Strategies in Discrete-State Probabilistic SystemsJournal of Basic Engineering, 84
Evan Porteus (1971)
Some Bounds for Discounted Sequential Decision ProcessesManagement Science, 18
J. Aspnes, M. Herlihy (1990)
Fast Randomized Consensus Using Shared MemoryJ. Algorithms, 11
S. Patek, D. Bertsekas (1999)
Stochastic Shortest Path GamesSiam Journal on Control and Optimization, 37
P. Varaiya (1978)
Optimal and suboptimal stationary controls for Markov chainsIEEE Transactions on Automatic Control, 23
J. MacQueen (1966)
A MODIFIED DYNAMIC PROGRAMMING METHOD FOR MARKOVIAN DECISION PROBLEMSJournal of Mathematical Analysis and Applications, 14
岡崎 孝太郎 (2016)
30th AAAI Conference on Artificial Intelligence （AAAI-16）, 31
D. Bertsekas, J. Tsitsiklis (1989)
Parallel and distributed computation
M. Puterman (1994)
Markov Decision Processes: Discrete Stochastic Dynamic Programming
A. Veinott (1969)
Discrete Dynamic Programming with Sensitive Discount Optimality CriteriaAnnals of Mathematical Statistics, 40
(1975)
Bounds and transformations for finite Markov decision chains
M. Kwiatkowska, G. Norman, R. Segala (2001)
Automated Verification of a Randomized Distributed Consensus Protocol Using Cadence SMV and PRISM
D Bertsekas, J Tsitsiklis (1989)
Parallel and distributed computation: numerical methods
Chris Lee, G. Chertow, S. Zenios (2008)
Optimal Initiation and Management of Dialysis TherapyOper. Res., 56
Vojtěch Forejt, M. Kwiatkowska, G. Norman, D. Parker (2011)
Automated Verification Techniques for Probabilistic Systems
D. Bertsekas (1976)
On error bounds for successive approximation methodsIEEE Transactions on Automatic Control, 21
E. Hansen, Ibrahim Abdoulahi (2015)
Efficient Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems
Balázs Csáji, R. Jungers, V. Blondel (2009)
PageRank optimization by edge selectionArXiv, abs/0911.2280
(2009)
Artificial intelligence: a modern approach, 3rd edn
(2013)
Egea-LopezE,Garcia-Haro J (2013)A stochastic shortest pathmodel tominimize
J. Alcaraz, J. Vales-Alonso, E. Egea-López, J. García-Haro (2013)
A Stochastic Shortest Path Model to Minimize the Reading Time in DFSA-Based RFID SystemsIEEE Communications Letters, 17
Amy Briggs, Carrick Detweiler, D. Scharstein, A. Vandenberg-Rodes (2004)
Expected Shortest Paths for Landmark-Based Robot NavigationThe International Journal of Robotics Research, 23
M. Kwiatkowska, G. Norman, D. Parker (2011)
PRISM 4.0: Verification of Probabilistic Real-Time Systems
For stochastic shortest path problems, error bounds for value iteration due to Bertsekas elegantly generalize the classic MacQueen–Porteus error bounds for discounted infinite-horizon Markov decision problems, but incur prohibitive computational overhead. We derive bounds on these error bounds that can be computed with little or no overhead, making them useful in practice—especially so, since easily-computed error bounds have not previously been available for this class of problems.
Mathematical Methods of Operations Research – Springer Journals
Published: Jul 20, 2017
Access the full text.
Sign up today, get DeepDyve free for 14 days.