𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rendezvous Search on the Line

✍ Scribed by Shmuel Gal

Book ID
123709511
Publisher
INFORMS
Year
1999
Tongue
English
Weight
157 KB
Volume
47
Category
Article
ISSN
0030-364X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Rendezvous search on the line with bound
Rendezvous search on the line with bounded resources: expected time minimization
✍ Steve Alpern; Anatole Beck πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 692 KB

Two players are placed on the line and want to meet. Neither knows the direction of the other, but they know the distance between them or perhaps the distribution of this distance. They can move with speed at most one, and each has a 'resource constraint' on the total distance he can travel. We firs

Note: Two rendezvous search problems on
Note: Two rendezvous search problems on the line
✍ Vic Baston πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 28 KB πŸ‘ 1 views

A new upper bound is obtained for the two-person symmetric rendezvous value on the real line when the distribution function of their initial distance apart is bounded. A second result shows that if three players are placed randomly on adjacent integers on the real line facing in random directions an

Rendezvous of three agents on the line
Rendezvous of three agents on the line
✍ Steve Alpern; Wei Shi Lim πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract This paper considers a three‐person rendezvous problem on the line which was introduced earlier by the authors. Three agents are placed at three consecutive integer value points on the real line, say 1, 2, and 3. Each agent is randomly faced towards the right or left. Agents are blind a