Two Dimensional Rendezvous Search

Edward J. Anderson () and Sándor P. Fekete ()
Additional contact information
Edward J. Anderson: Australian Graduate School of Management, University of New South Wales, Sydney 2052, Australia
Sándor P. Fekete: Department of Mathematics, TU Berlin, D-10623 Berlin, Germany

Operations Research, 2001, vol. 49, issue 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: Military; search/surveillance: Marking strategies on the geometric plane (search for similar items in EconPapers)
Date: 2001
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.49.1.107.11191 (application/pdf)

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:inm:oropre:v:49:y:2001:i:1:p:107-118

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().