We consider search for a randomly moving target among a finite set of different states, A search effort is available at each fixed number of time intervals and it is unrestricted, this is important for searching about a valuable target missing at sea or lost at wilderness area. We obtain the solution which minimizes the probability of undetected the target and searching effort. An algorithm is constructed for obtained this solution, also it used to obtain the optimal solution when the searching effort is restricted.
Mohamed, A., & Bahgat, N. (2004). M-States Search Problem for a Lost Target. The Egyptian Statistical Journal, 48(2), 141-151. doi: 10.21608/esju.2004.313770
MLA
Abd-El-Moneim A. Mohamed; Nashwa Sayd Bahgat. "M-States Search Problem for a Lost Target", The Egyptian Statistical Journal, 48, 2, 2004, 141-151. doi: 10.21608/esju.2004.313770
HARVARD
Mohamed, A., Bahgat, N. (2004). 'M-States Search Problem for a Lost Target', The Egyptian Statistical Journal, 48(2), pp. 141-151. doi: 10.21608/esju.2004.313770
VANCOUVER
Mohamed, A., Bahgat, N. M-States Search Problem for a Lost Target. The Egyptian Statistical Journal, 2004; 48(2): 141-151. doi: 10.21608/esju.2004.313770
)
View on SCiNiTO