New search algorithm for randomly located objects: A non-cooperative agent based approach

Abstract

In this paper we address the general question of what is the best strategy to search efficiently for randomly located objects (target sites). We propose a new agent based algorithm for searching in an unpredictable environment. The originality of our work consists in applying a non-cooperative strategy, namely the distributed Goore Game model, as opposed to applying the classical collaborative and competitive strategies, or individual strategies. This paper covers only the non-destructive search that occurs when the agent visits the same target many times. The nondestructive search can be performed in either of the two cases: if the target becomes temporarily inactive or if it leaves the area. The proposed algorithm has two versions: one when the agent can move with a step equal to unity and the other when the step of the agent follows a Levy flight distribution. The latter version is inspired by the work of A.M. Reynolds, motivated by biological examples.