Exploration of a Two Sided Rendezvous Search Problem Using Genetic Algorithms

The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is intrinsically difficult to solve. Thomas et al [1] considered the effectiveness of three standard NATO search paths [2] for this type of problem. In this paper a genetic algorithm is used to show that more effective search paths exist. In addition it is shown that genetic algorithms can be effective in finding a near optimal path of length 196 when searching a 14 × 14 cell area, that is a search space of 10100 . . . . 1 Problem Description Rendezvous search, or looking for someone who wants to be found, such as a walker lost in the desert was recently considered by Thomas and Hulme [1]. The basic problem is as follows, the lost walker is searched for by a helicopter. The speed of the walker is 3 m.p.h. and that of the helicopter 60 m.p.h.. If the walker hears the helicopter it moves towards it, if not it...

• Type: Conference
• Year: 2003
• Where: GECCO
• Authors: T. Q. S. Truong, A. Stacey
• Keywords: GECCO 2003, Genetic Algorithms, Helicopter, Search Paths