The reset disambiguation policy for navigating stochastic obstacle fields
From MaRDI portal
Publication:3005837
DOI10.1002/nav.20454zbMath1214.90123MaRDI QIDQ3005837
Donniell E. Fishkind, Vural Aksakalli, Carey E. Priebe, Xugang Ye
Publication date: 9 June 2011
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20454
Markov decision process; mine countermeasures; probabilistic path planning; random disambiguation path; tangent arc graph
90C40: Markov and semi-Markov decision processes
Related Items
A penalty search algorithm for the obstacle neutralization problem, Optimal obstacle placement with disambiguations, An optimal algorithm for the obstacle neutralization problem, An AO* Based Exact Algorithm for the Canadian Traveler Problem, Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem
Cites Work
- Unnamed Item
- Unnamed Item
- Shortest paths without a map
- A likelihood-MPEC approach to target classification
- Stochastic shortest paths with recourse
- A polynomial-time algorithm to find shortest paths with recourse
- Importance sampling for spatial scan analysis: computing scan statistic \(p-\)values for marked point processes.