The reset disambiguation policy for navigating stochastic obstacle fields

DOI10.1002/nav.20454zbMath1214.90123OpenAlexW2025252735MaRDI QIDQ3005837

Donniell E. Fishkind, Vural Aksakalli, Xugang Ye, Carey E. Priebe

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

zbMATH Keywords

Markov decision processmine countermeasuresprobabilistic path planningrandom disambiguation pathtangent arc graph

Mathematics Subject Classification ID

Markov and semi-Markov decision processes (90C40)

Related Items (5)

An optimal algorithm for the obstacle neutralization problem ⋮ A penalty search algorithm for the obstacle neutralization problem ⋮ Optimal obstacle placement with disambiguations ⋮ Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem ⋮ An AO^* Based Exact Algorithm for the Canadian Traveler Problem

Cites Work

• 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
• Stochastic shortest path problems with recourse
• Importance sampling for spatial scan analysis: computing scan statistic \(p-\)values for marked point processes.

This page was built for publication: The reset disambiguation policy for navigating stochastic obstacle fields