Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem
From MaRDI portal
Publication:2962565
DOI10.1287/ijoc.2013.0571zbMath1356.90157OpenAlexW2127372295MaRDI QIDQ2962565
Publication date: 17 February 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2013.0571
Markov decision processstochastic dynamic programmingCanadian traveler's problemprobabilistic path planning
Related Items (2)
An optimal algorithm for the obstacle neutralization problem ⋮ An AO* Based Exact Algorithm for the Canadian Traveler Problem
Cites Work
- Shortest paths without a map
- Probabilistic planning with clear preferences on missing information
- The Canadian Traveller Problem and its competitive analysis
- Optimal obstacle placement with disambiguations
- The reset disambiguation policy for navigating stochastic obstacle fields
- A polynomial-time algorithm to find shortest paths with recourse
- Random disambiguation paths for traversing a mapped hazard field
- Efficient, optimal stochastic-action selection when limited by an action budget
This page was built for publication: Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem