• Home
  • Search
  • Short-Sighted Stochastic Shortest Path Problems
  • Cite Icon16
  • https://doi.org/10.1609/icaps.v22i1.13527Copy DOI Icon

Short-Sighted Stochastic Shortest Path Problems

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

Two extreme approaches can be applied to solve a probabilistic planning problem, namely closed loop algorithms and open loop (a.k.a. replanning) algorithms. While closed loop algorithms invest significant computational effort to generate a closed form solution, open loop algorithms compute open form solutions and interact with the environment in order to refine the computed solution. In this paper, we introduce short-sighted Stochastic Shortest Path (SSP), a new model in which solutions computed based on it can be executed for at least t steps as a closed form solution. Using short-sighted SSPs, we present a novel probabilistic planner called Short-sighted Open Loop Planner (SOLP) that bridges the gap between open and closed loop planners by varying the parameter t: as t increases, more actions can be executed without replanning and, for t sufficiently large, a closed form solution is obtained. We prove that SOLP is asymptotically optimal. To the best of our knowledge, SOLP is the unique probabilistic planner that at the same time provides both replanning and optimality guarantees. We empirically compare SOLP with the winners of the previous probabilistic planning competitions and SOLP outperforms all of them in 33.3% of the problems and ties with the best planner in 48.3% of the problems.

Similar Papers
  • PDF
  • Research Article
  • Citations37

Reinforcement Learning Based Stochastic Shortest Path Finding in Wireless Sensor Networks

  • Jan 01, 2019
  • IEEE Access
  • Wenwen Xia +3
  • Conference Article
  • Citations1

Towards scalable mdp algorithms

  • Dec 24, 2016
  • Andrey Kolobov
  • Dissertation

Closed form solutions to the optimality equation of minimal norm actuation

  • Nov 01, 2013
  • Jorge Guerra
  • Conference Article
  • Citations18

Stochastic motion planning with path constraints and application to optimal agent, resource, and route planning

  • May 01, 2012
  • Sejoon Lim +1
  • Research Article
  • Citations1

Explaining the Space of SSP Policies via Policy-Property Dependencies: Complexity, Algorithms, and Relation to Multi-Objective Planning

  • May 30, 2024
  • Proceedings of the International Conference on Automated Planning and Scheduling
  • Marcel Steinmetz +3
  • Conference Article
  • Citations14

On step sizes, stochastic shortest paths, and survival probabilities in reinforcement learning

  • Dec 07, 2008
  • Abhijit Gosavi
  • Conference Article
  • Citations3

Finding objects through stochastic shortest path problems

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

On scenario construction for stochastic shortest path problems in real road networks

  • Jul 03, 2021
  • Transportation Research Part E: Logistics and Transportation Review
  • Dongqing Zhang +4
  • Research Article
  • Citations20

Force modeling for incisions into various tissues with MRF haptic master

  • Feb 12, 2016
  • Smart Materials and Structures
  • Pyunghwa Kim +3
  • 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
  • Citations20

Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems

  • Oct 01, 2011
  • Jian Li +1
  • Research Article
  • Citations84

Data-Driven State of Charge Estimation for Power Battery With Improved Extended Kalman Filter

  • Jan 01, 2023
  • IEEE Transactions on Instrumentation and Measurement
  • Xingtao Liu +4
  • Research Article
  • Citations4

Methodology for Stochastic Graph Completion-Time Problems

  • Nov 01, 1996
  • INFORMS Journal on Computing
  • T Jayawardena +1
  • Research Article
  • Citations230

Learning Algorithms for Markov Decision Processes with Average Cost

  • Jan 01, 2001
  • SIAM Journal on Control and Optimization
  • J Abounadi +2
  • Research Article
  • Citations22

Instantly Decodable Network Coding for Completion Time or Decoding Delay Reduction in Cooperative Data Exchange Systems

  • Mar 01, 2016
  • IEEE Transactions on Vehicular Technology
  • Neda Aboutorab +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.