Rendez‐vous search on a rectangular lattice |
| |
Authors: | William H Ruckle |
| |
Institution: | 106 Whippoorwill Drive, Seneca, 29672 South Carolina106 Whippoorwill Drive, Seneca, 29672 South Carolina |
| |
Abstract: | In a rendez‐vous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider s seekers in a rectangular lattice of locations where each knows the configuration of the lattice, the distribution of the seekers at time 0, and its own location, but not the location of any other. We measure time discretely, in turns. A meeting takes place when the two seekers reach the same point or adjacent points. The main result is that for any dimension of lattice, any initial distribution of seekers there are optimal strategies for the seekers that converge (in a way we shall make clear) to a center. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 |
| |
Keywords: | rendez‐vous search optimal strategies lattice |
|
|