The reset disambiguation policy for navigating stochastic obstacle fields
Authors:
- 1 April 2011
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 58 (4) , 389-399
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Simultaneous localization and mapping: part IIEEE Robotics & Automation Magazine, 2006
- Random disambiguation paths for traversing a mapped hazard fieldNaval Research Logistics (NRL), 2005
- A likelihood-MPEC approach to target classificationMathematical Programming, 2003
- A polynomial‐time algorithm to find shortest paths with recourseNetworks, 2003
- Stochastic search and graph techniques for MCM path planning2002
- Importance sampling for spatial scan analysis: computing scan statistic p-values for marked point processesComputational Statistics & Data Analysis, 2001
- Coastal battlefield reconnaissance and analysis program for minefield detection1995
- Adaptive multispectral CFAR detection of land mines1995
- Shortest paths without a mapTheoretical Computer Science, 1991
- Stochastic shortest paths with recourseNetworks, 1988