Abstract
This paper presents the discrete search technique on multi zones to detect a lost target by using sensors. The search region is divided into zones. These zones contain an equal number of states (cells) not necessarily identical. Each zone has a one sensor to detect the target. The target moves over the cells according to a random process. We consider the searching effort as a random variable with a known probability distribution. The detection function with the discounted reward function in a certain state and time interval are given. The optimal effort distribution that minimizes the probability of undetection is obtained after solving a discrete stochastic optimization problem. An algorithm is constructed to obtain the optimal solution as in the numerical application.
Highlights
The searching for the lost targets which are either fixed or moving, is vital in numerous regular citizen and military applications
The search theory has been studied in many variations
A novel probabilistic search model has been presented here to find the target with maximum probability and minimum search effort
Summary
The searching for the lost targets which are either fixed or moving, is vital in numerous regular citizen and military applications. When the target is fixed or moves randomly on the real line, we get the so called linear search problem. This problem has an important application in our life. OPTIMAL MULTI ZONES SEARCH TECHNIQUE TO DETECT A LOST TARGET BY USING K SENSORS cells. They studied a special case when the target is hidden in one cell of them. The search region is divided into k zones. These zones contain an equal number of cells not necessarily identical.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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 call
