Two Dimensional Rendezvous Search
Authors:
- 1 February 2001
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 49 (1) , 107-118
Abstract
We consider rendezvous problems in which two players move on the plane and wish to cooperate to minimise their first meeting time. We begin by considering the case where both players are placed such that the vector difference is chosen equiprobably from a finite set. We also consider a situation in which they know they are a distance d apart, but they do not know the direction of the other player. Finally, we give some results for the case in which player 1 knows the initial position of player 2, while player 2 is given information only on the initial distance of player 1.Keywords
This publication has 25 references indexed in Scilit:
- Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.Computational Geometry, 2000
- Rendezvous search on a graphJournal of Applied Probability, 1999
- Rendezvous search on the line with bounded resources: expected time minimizationEuropean Journal of Operational Research, 1997
- Searching for targets who want to be foundJournal of the Operational Research Society, 1997
- Rendezvous Search on the Line with Indistinguishable PlayersSIAM Journal on Control and Optimization, 1995
- Rendezvous Search on the Line with Distinguishable PlayersSIAM Journal on Control and Optimization, 1995
- The Rendezvous Search ProblemSIAM Journal on Control and Optimization, 1995
- Searching in the PlaneInformation and Computation, 1993
- The rendezvous problem on discrete locationsJournal of Applied Probability, 1990
- The minimax path in a search for a circle in a planeNaval Research Logistics Quarterly, 1961