Rendezvous search on labeled networks
Author:
- 12 March 2002
- journal article
- research article
- Published by Wiley in Naval Research Logistics (NRL)
- Vol. 49 (3) , 256-274
Abstract
Two players are independently placed on a commonly labelled network X. They cannot see each other but wish to meet in least expected time. We consider continuous and discrete versions, in which they may move at unit speed or between adjacent distinct nodes, respectively. There are two versions of the problem (asymmetric or symmetric), depending on whether or not we allow the players to use different strategies. After obtaining some optimality conditions for general networks, we specialize to the interval and circle networks. In the first setting, we extend the work of J. V. Howard; in the second we prove a conjecture concerning the optimal symmetric strategy. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 256–274, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10011Keywords
This publication has 17 references indexed in Scilit:
- Rendezvous Search on the LineOperations Research, 1999
- Asymmetric Rendezvous on the Line Is a Double Linear Search ProblemMathematics of Operations Research, 1999
- Rendezvous Search on the Interval and the CircleOperations Research, 1999
- Rendezvous search on a graphJournal of Applied Probability, 1999
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability DistributionSIAM Journal on Control and Optimization, 1998
- A rendezvous-evasion game on discrete locations with joint randomizationAdvances in Applied Probability, 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
- The Rendezvous Search ProblemSIAM Journal on Control and Optimization, 1995
- The rendezvous problem on discrete locationsJournal of Applied Probability, 1990