Two dimensional rendezvous search

Two dimensional rendezvous search

0.00 Avg rating0 Votes
Article ID: iaor20021819
Country: United States
Volume: 49
Issue: 1
Start Page Number: 107
End Page Number: 118
Publication Date: Jan 2001
Journal: Operations Research
Authors: ,
Keywords: marketing
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.

Reviews

Required fields are marked *. Your email address will not be published.