• Home
  • Search
  • Solving Uncertain Markov Decision Problems: An Interval-Based Method
  • Cite Icon12
  • https://doi.org/10.1007/11881223_120Copy DOI Icon

Solving Uncertain Markov Decision Problems: An Interval-Based Method

  • Jan 1, 2006
  • Shulin Cui +3 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Stochastic Shortest Path problems (SSPs), a subclass of Markov Decision Problems (MDPs), can be efficiently dealt with VI, PI, RTDP, LAO* and so on. However, in many practical problems the estimation of the probabilities is far from accurate. In this paper, we present uncertain transition probabilities as close real intervals. Also, we describe a general algorithm, called gLAO*, that can solve uncertain MDPs efficiently. We demonstrate that Buffet and Aberdeen’s approach, searching for the best policy under the worst model, is a special case of our approaches. Experiments show that gLAO* inherits excellent performance of LAO* for solving uncertain MDPs.KeywordsOptimal PolicyDynamic Programming AlgorithmState Transition ProbabilityPolicy IterationSolution GraphThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Similar Papers
  • Conference Article
  • Citations3

Finding objects through stochastic shortest path problems

  • May 06, 2013
  • Felipe W Trevizan +1
  • Conference Article
  • Citations13

Maximizing Cumulative User Engagement in Sequential Recommendation

  • Aug 20, 2020
  • Yifei Zhao +4
  • Research Article
  • Citations19

Depth-based short-sighted stochastic shortest path problems

  • Jul 14, 2014
  • Artificial Intelligence
  • Felipe W Trevizan +1
  • Conference Article
  • Citations4

Reachability analysis for uncertain SSPs

  • Jan 01, 2005
  • O Buffet
  • Research Article
  • Citations23

On Boundedness of Q-Learning Iterates for Stochastic Shortest Path Problems

  • May 01, 2013
  • Mathematics of Operations Research
  • Huizhen Yu +1
  • Conference Article
  • Citations5

Simplicial Label Correcting Algorithms for continuous stochastic shortest path problems

  • May 01, 2013
  • Dmitry S Yershov +1
  • Research Article
  • Citations218

Stochastic shortest path problems with recourse

  • Mar 01, 1996
  • Networks
  • George H Polychronopoulos +1
  • Research Article
  • Citations18

Stochastic Recruitment Control of Large Ensemble Systems With Limited Feedback

  • Jun 17, 2010
  • Journal of Dynamic Systems, Measurement, and Control
  • Lael U Odhner +1
  • Research Article
  • Citations60

Improving the Efficiency of Stochastic Vehicle Routing: A Partial Lagrange Multiplier Method

  • Jun 01, 2016
  • IEEE Transactions on Vehicular Technology
  • Zhiguang Cao +4
  • Research Article
  • Citations20

Solving in real-time the dynamic and stochastic shortest path problem for electric vehicles by a prognostic decision making strategy

  • Jul 06, 2021
  • Expert Systems with Applications
  • Heraldo Rozas +3
  • Conference Article
  • Citations8

Energy Optimisation through Path Selection for Underwater Wireless Sensor Networks

  • Aug 01, 2020
  • Kenechi G Omeke +4
  • Research Article
  • Citations46

Extended dominance and a stochastic shortest path problem

  • Oct 18, 2007
  • Computers & Operations Research
  • Kevin R Hutson +1
  • Research Article
  • Citations4

Batch repair actions for automated troubleshooting

  • Mar 16, 2020
  • Artificial Intelligence
  • Hilla Shinitzky +1
  • Conference Article
  • Citations13

An Anytime Algorithm for Chance Constrained Stochastic Shortest Path Problems and Its Application to Aircraft Routing

  • May 30, 2021
  • Sungkweon Hong +5
  • Research Article
  • Citations2

Efficient Constraint Generation for Stochastic Shortest Path Problems

  • Mar 24, 2024
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Johannes Schmalz +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.