论文信息 - Technical Note - The Complexity of the Optimal Searcher Path Problem

Technical Note - The Complexity of the Optimal Searcher Path Problem

In this note we show that the problem of finding an optimal searcher path that maximizes the probability of detecting a stationary target by the end of a fixed time is NP-complete. We also demonstrate that the problem of finding a path that minimizes mean time to detection is NP-hard.

K E Trummel | J R Weisinger | J. Weisinger | K. E. Trummel

[1] Scott Shorey Brown,et al. Optimal Search for a Moving Target in Discrete Time and Space , 1980, Oper. Res..

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] James N. Eagle. The Optimal Search for a Moving Target When the Search Path Is Constrained , 1984, Oper. Res..

[4] L. Stone. Theory of Optimal Search , 1975 .

[5] Ingo Wegener,et al. Discrete Sequential Search with Positive Switch Cost , 1982, Math. Oper. Res..

[6] T. J. Stweart. Experience with a Branch-and-Bound Algorithm for Constrained Searcher Motion , 1980 .

[7] A. Washburn. On a search for a moving target , 1980 .