Rendez-vous search on a rectangular lattice
β Scribed by William H. Ruckle
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 92 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
β¦ Synopsis
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
π SIMILAR VOLUMES
We construct a multirelaxation lattice Boltzmann model on a two-dimensional rectangular grid. The model is partly inspired by a previous work of Koelman to construct a lattice BGK model on a two-dimensional rectangular grid. The linearized dispersion equation is analyzed to obtain the constraints