 |
    |
Exploration of a Two Sided Rendezvous Search Problem Using Genetic Algorithms
T.Q.S. Truong1 and A. Stacey2
1Air Operations Division
Defence Science and TechnologyOrganisation
Melbourne, Australia
tracy.truong@dsto.defence.gov.au
2Mathematics Department
RMIT University
Melbourne, Australia
stacey@rmit.edu.au
Abstract.
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 
when searching a 
cell area, that is a search space of 
...
LNCS 2724, p. 2422 ff.
lncs@springer.de
© Springer-Verlag Berlin Heidelberg 2003