The Complexity of the Optimal Searcher Path Problem

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research 1986-03, Vol.34 (2), p.324-327
Hauptverfasser: Trummel, K. E., Weisinger, J. R.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Exact sciences and technology
Integers
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Optimal
Polynomials
Probability
Probability distributions
Searches
Target location and tracking
Technical Notes
Vertices
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0030-364X
1526-5463
DOI:10.1287/opre.34.2.324