Optimal search plan minimizing the expected risk of the search for a target with conditionally deterministic motion

Köji Iida

Naval Research Logistics (NRL), 1989, vol. 36, issue 5, 597-613

Abstract: This article deals with a search problem for a moving target with a rather simple type of motion called factorable conditionally deterministic. A search plan is characterized by (ϕ, T), the elements of which specify how to search and when to stop the search, respectively. The problem is to find the optimal search plan which minimizes the expected risk (the expected search cost minus the expected reward). We obtain conditions for the optimal search plan, and applying the theorems, we derive the optimal search plan in a closed form for the case in which the target moves straight from a fixed point selecting his course and speed randomly.

Date: 1989
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198910)36:53.0.CO;2-7

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:36:y:1989:i:5:p:597-613

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().