Relation between waiting time and flight length for efficient search

Abstract

What is the best strategy for efficient search of randomly located targets? This question has been studied in many fields. Recently it is reported that Levy Flight search is more efficient than Random Walk search in sparsely target site. On the other hand, when target sites is not sparsely and it is dense, Random Walk search is more efficient. We have experimented that quantitative comparison between Random Walk and Levy Flight, and relation between target density or moving target and search efficiency. It has not also been argued that relation between waiting time and flight length of Levy Flight for efficient search. In this study we show that relation between waiting time and flight length for efficient search. As a result, it is the most efficient strategy when power index of flight length is 2, which is the same result of the previous experiments. And power index of waiting time is about 3 when searcher needs some waiting times to understand the target.