Fuzzy Optimal Search Plan for N-Dimensional Randomly Moving Target

This paper presents a search model that finds n-dimensional randomly moving target in which any information of the target position is not available to the searchers. There exist n-searchers, starting the searching process from the origin. Rather than finding the conditions that make the expected value of the first meeting time between one of the searchers and the target is finite, this work shows the existence of the fuzzy optimal search plan that minimizes the expected value of the first meeting time. The effectiveness of this method is illustrated by using an example with numerical results.