Assume that a target is hidden or lost in one of several possible locations and is to be found by the unmanned aerial vehicle (UAV). A target can be either a hostile object or missing personnel in remote areas. Prior ...Assume that a target is hidden or lost in one of several possible locations and is to be found by the unmanned aerial vehicle (UAV). A target can be either a hostile object or missing personnel in remote areas. Prior probabilities of target locations are known. Inspection operations done by the UAVs are imperfect, namely, probabilities of overlooking the hidden target and probabilities of false alarms exist for any possible location. The UAV has to sequentially inspect the locations so that to find the target with the minimum loss or damage incurred by the target before it is detected subject to a required level of confidence of target identification. A fast (polynomial-time) priority-based algorithm for finding an optimal search strategy is developed.展开更多
：The paper presents and proves an approximate optimal relationship between sample size n andacceptance number c in the sampling plans under imperfect inspection which minimize the Bayesian risk. Theconclusion general...：The paper presents and proves an approximate optimal relationship between sample size n andacceptance number c in the sampling plans under imperfect inspection which minimize the Bayesian risk. Theconclusion generalizes the result obtained by A. Hald on the assumption that the inspection is perfect.展开更多
文摘Assume that a target is hidden or lost in one of several possible locations and is to be found by the unmanned aerial vehicle (UAV). A target can be either a hostile object or missing personnel in remote areas. Prior probabilities of target locations are known. Inspection operations done by the UAVs are imperfect, namely, probabilities of overlooking the hidden target and probabilities of false alarms exist for any possible location. The UAV has to sequentially inspect the locations so that to find the target with the minimum loss or damage incurred by the target before it is detected subject to a required level of confidence of target identification. A fast (polynomial-time) priority-based algorithm for finding an optimal search strategy is developed.
基金This research was supported by National Natural Science Foundation of China ( Grant No.7993 0 90 0)
文摘：The paper presents and proves an approximate optimal relationship between sample size n andacceptance number c in the sampling plans under imperfect inspection which minimize the Bayesian risk. Theconclusion generalizes the result obtained by A. Hald on the assumption that the inspection is perfect.
