Random disambiguation paths for traversing a mapped hazard field
From MaRDI portal
Publication:5706240
DOI10.1002/nav.20071zbMath1079.90012OpenAlexW2021847163MaRDI QIDQ5706240
Donniell E. Fishkind, Christine D. Piatko, Lowell Abrams, Carey E. Priebe
Publication date: 7 November 2005
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20071
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
This page was built for publication: Random disambiguation paths for traversing a mapped hazard field
