By Topic

Relation between waiting time and flight length for efficient search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Koyama, H. ; Dept. of Comput. Sci., Nat. Defense Acad. in Japan, Yokosuka ; Sato, H. ; Namatame, A.

What is the best strategy for efficient search of randomly located targets? This question has been studied in many fields. 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.

Published in:

SICE Annual Conference, 2008

Date of Conference:

20-22 Aug. 2008