• Home
  • Search
  • Finding objects through stochastic shortest path problems
  • Cite Icon3
  • https://doi.org/10.5555/2484920.2485008Copy DOI Icon

Finding objects through stochastic shortest path problems

  • May 6, 2013
  • Felipe W Trevizan +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper presents a novel formulation for the problem of finding objects in a known environment while minimizing the search cost. Our approach consists in formalizing this class of problems as Stochastic Shortest Path (SSP) problems, a decision-theoretic framework for probabilistic environments. The obtained problems are solved by using off-the-shelf domain-independent probabilistic planners. The advantages of this approach includes: (i) a well defined optimization problem in which the probability of finding the object is maximized while minimizing the cost of searching for the object; and (ii) being able to take advantage, without any modifications to our model, of any (future) technique in the field of domain-independent probabilistic planners, such as better algorithms and better heuristics. We also contribute by empirically comparing three probabilistic planners algorithms, namely FF-Replan, UCT and SSiPP, using our proposed class of problems.

Similar Papers
  • Conference Article
  • Citations13

Maximizing Cumulative User Engagement in Sequential Recommendation

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

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

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

Depth-based short-sighted stochastic shortest path problems

  • Jul 14, 2014
  • Artificial Intelligence
  • Felipe W Trevizan +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
  • Conference Article
  • Citations1

Towards scalable mdp algorithms

  • Dec 24, 2016
  • Andrey Kolobov
  • Conference Article
  • Citations4

Reachability analysis for uncertain SSPs

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

Stochastic shortest path problems with recourse

  • Mar 01, 1996
  • Networks
  • George H Polychronopoulos +1
  • Conference Article
  • Citations5

Simplicial Label Correcting Algorithms for continuous stochastic shortest path problems

  • May 01, 2013
  • Dmitry S Yershov +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
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.