Abstract
This article deals with a one-searcher multi-target search problem where targetswith different detection priorities move in Markov processes in each discrete time interval over agiven space search area, and the total number of search time intervals is fixed. A limitedsearch resource is available in each search time interval and an exponential detection functionis assumed. The searcher can obtain a target detection reward, if the target is detected, whichrepresents the detection priority of target and does not increase with respect to time. The objective is toestablish the optimal search plan that allocates the search resource effort over the search areasin each time interval in order to maximize the total detection reward. The analysis shows that the given problem can be decomposed into interval-wise individualsearch problems, each being treated as a single stationary target problem for each timeinterval. Thus, an iterative procedure is derived to solve a sequence of stationary targetproblems. The computational results show that the proposed algorithm guaranteesoptimality.
Highlights
In modern warfare, many weapon systems implemented in intelligence, surveillance, and reconnaissance (ISR) mission have been developed and utilized in the military field
Search problems deal with the search plan or strategy that allocates search resources to maximize the detection probability, including three major elements: probability distributions for targets location and motion, detection functions, and constraints on the search resource
Though most of the search problems in the literature have considered a single moving target to maximize the detection probability, this article considers multiple targets that move in Markov processes in discrete time over a given space
Summary
Many weapon systems implemented in intelligence, surveillance, and reconnaissance (ISR) mission have been developed and utilized in the military field One of those is the target-acquisition system, where the most important issue is how to accurately detect targets in a timely way. EXTENDED SEARCH PLANNING of them, a particular one The targets displace their location frequently during the operation in order to secure their survivability. It is important for the searcher to consider the detection priorities of targets when he is planning for the search operation Motivated by these facts, a search problem of detecting multiple moving targets with different detection reward will be addressed in this article. The problem for the UAV is to establish the optimal search plan that allocates the given limited resources to the cells at each time interval in order to maximize the total detection reward.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Statistics, Optimization & Information Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
