×

Random disambiguation paths for traversing a mapped hazard field. (English) Zbl 1079.90012

Summary: We consider the problem of safely and swiftly navigating through a spatial arrangement of potential hazard detections in which each detection has associated with it a probability that the detection is indeed a true hazard. When in close proximity to a detection, we assume the ability – for a cost – to determine whether or not the hazard is real. Our approach to this problem involves a new object, the random disambiguation path (RDP), which is a curve-valued random variable parametrized by a binary tree with particular properties. We prove an admissibility result showing that there is positive probability that the use of an RDP reduces the expected traversal length compared to the conventional shortest zero-risk path, and we introduce a practically computable additive-constant approximation to the optimal RDP. The theoretical considerations are complemented by simulation and example.

MSC:

90B05 Inventory, storage, reservoirs
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] and Network flows: Theory, algorithms, and applications, Prentice Hall, Englewood Cliffs, NJ, 1993.
[2] Bertsekas, Math Oper Res 16 pp 580– (1991)
[3] and Reliable mobile robot navigation from unreliable visual cues, Fourth Int Workshop Alg Found Robot (WAFR 2000), Hanover, NH, March 2000.
[4] and Introduction to algorithms, MIT Press, Cambridge, MA, 1992.
[5] and Computational geometry algorithms and applications, Springer, New York, 1997. · Zbl 0877.68001
[6] and Adaptive multispectral CFAR detection of land mines, Proc SPIE 2496: Detection Technol Mines Minelike Targets, Orlando, FL, April 1995, pp. 421-432.
[7] Robot motion planning, Kluwer Academic, New York, 1991. · doi:10.1007/978-1-4615-4022-9
[8] ? Shortest paths and networks,? Handbook of discrete and computational geometry, and (Editors), CRC Press, Boca Raton, FL, 1997, pp. 445-466.
[9] Olson, Math Program Ser A 96 pp 1– (2002)
[10] Papadimitriou, Theoret Comput Sci 84 pp 127– (1991)
[11] On partially observed stochastic shortest path problems, Proc CDC 2001: 40th IEEE Conf Decision Control, Orlando, FL, December 2001, 5050-5056.
[12] Piatko, Proc SPIE 4394 pp 836– (2001)
[13] Piatko, Proc SPIE 4742 pp 583– (2002)
[14] Priebe, Comput Statis Data Anal 35 pp 475– (2001)
[15] and Optimizing sensor fusion for classification performance, Proc CISST ’99 Int Conf, Las Vegas, NV, June 1999, pp. 397-403.
[16] Detection technologies for mines and minelike targets, Proc SPIE 2496: Detection Technol Mines Minelike Targets, Orlando, FL, April 1995, pp. 404-408.
[17] and The Coastal Battlefield Reconnaissance and Analysis (COBRA) program for minefield detection, Proc SPIE 2496: Detection Technol Mines Minelike Targets, Orlando, FL, April 1995, pp. 500-508.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.