Two point one sided rendezvous
In a rendezvous search two or more teams called seekers try to minimize the time needed to find each other. In this paper, we consider two seekers in the plane. This is a one sided problem since Seeker 1 begins at a predetermined point O. Seeker 2 begins at one of a finite set of points xi with probability pi. We first discuss the general situation and then consider the specific case when Seeker 2 can begin from one of two points.
Year of publication: |
2010
|
---|---|
Authors: | Kikuta, Kensaku ; Ruckle, William H. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 207.2010, 1, p. 78-82
|
Publisher: |
Elsevier |
Subject: | Rendezvous Search Discrete search |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Two point one sided rendezvous
Kikuta, Kensaku, (2010)
-
Rendezvous search on a star graph with examination costs
Kikuta, Kensaku, (2007)
-
Continuous Accumulation Games on Discrete Locations
Kikuta, Kensaku, (2002)
- More ...