• Home
  • Search
  • Efficient Constraint Generation for Stochastic Shortest Path Problems
  • Cite Icon2
  • https://doi.org/10.1609/aaai.v38i18.30005Copy DOI Icon

Efficient Constraint Generation for Stochastic Shortest Path Problems

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Current methods for solving Stochastic Shortest Path Problems (SSPs) find states’ costs-to-go by applying Bellman backups, where state-of-the-art methods employ heuristics to select states to back up and prune. A fundamental limitation of these algorithms is their need to compute the cost-to-go for every applicable action during each state backup, leading to unnecessary computation for actions identified as sub-optimal. We present new connections between planning and operations research and, using this framework, we address this issue of unnecessary computation by introducing an efficient version of constraint generation for SSPs. This technique allows algorithms to ignore sub-optimal actions and avoid computing their costs-to-go. We also apply our novel technique to iLAO* resulting in a new algorithm, CG-iLAO*. Our experiments show that CG-iLAO* ignores up to 57% of iLAO*’s actions and it solves problems up to 8x and 3x faster than LRTDP and iLAO*.

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
  • 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
  • Citations4

Reachability analysis for uncertain SSPs

  • Jan 01, 2005
  • O Buffet
  • 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
  • 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
  • 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
  • Conference Article
  • Citations8

Energy Optimisation through Path Selection for Underwater Wireless Sensor Networks

  • Aug 01, 2020
  • Kenechi G Omeke +4
  • Book Chapter
  • Citations12

Solving Uncertain Markov Decision Problems: An Interval-Based Method

  • Jan 01, 2006
  • Shulin Cui +3
  • 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
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.