Rendez‐vous search on a rectangular lattice

William H. Ruckle

Naval Research Logistics (NRL), 2007, vol. 54, issue 5, 492-496

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

Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.20218

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:54:y:2007:i:5:p:492-496

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().