Two-Dimensional Rendezvous Search

Anderson, Edward J. and Fekete, Sandor P. (2001) Two-Dimensional Rendezvous Search.
Published in: Operations research Vol. 49 (1). pp. 107-118.

Abstract

We consider rendezvous problems in which two players move on the plane and wish to cooperate in order to minimise their first meeting time. We begin by considering the case when they know that they are a distance d apart, but they do not know the direction in which they should travel. We also consider a situation in which player 1 knows the initial position of player 2, while player 2 is only given information on the initial distance of player 1. Finally we give some results for the case where one of the players is placed at an initial position chosen equiprobably from a finite set of points.


Actions:
Full text not available from this repository. (Request a copy)
Export as: [error in script]
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr97-276a
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 12 Jan 2012 12:35
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/276001