Penalty-based algorithms for the stochastic obstacle scene problem
From MaRDI portal
Recommendations
- A penalty search algorithm for the obstacle neutralization problem
- The reset disambiguation policy for navigating stochastic obstacle fields
- An optimal algorithm for the obstacle neutralization problem
- An Online Algorithm for Improving Performance in Navigation
- Stochastic motion planning and applications to traffic
Cites work
- A polynomial-time algorithm to find shortest paths with recourse
- Efficient, optimal stochastic-action selection when limited by an action budget
- Optimal obstacle placement with disambiguations
- Probabilistic planning with clear preferences on missing information
- Random disambiguation paths for traversing a mapped hazard field
- Shortest paths without a map
- The Canadian Traveller Problem and its competitive analysis
- The reset disambiguation policy for navigating stochastic obstacle fields
Cited in
(7)- Optimal obstacle placement with disambiguations
- An optimal algorithm for the obstacle neutralization problem
- An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
- The reset disambiguation policy for navigating stochastic obstacle fields
- Sensor beams, obstacles, and possible paths
- A penalty search algorithm for the obstacle neutralization problem
- Random disambiguation paths for traversing a mapped hazard field
This page was built for publication: Penalty-based algorithms for the stochastic obstacle scene problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2962565)
