Rendez-vous search on a rectangular latt
β
William H. Ruckle
π
Article
π
2007
π
John Wiley and Sons
π
English
β 92 KB
## 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 i