IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v207y2010i1p78-82.html
   My bibliography  Save this article

Two point one sided rendezvous

Author

Listed:
  • Kikuta, Kensaku
  • Ruckle, William H.

Abstract

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.

Suggested Citation

  • Kikuta, Kensaku & Ruckle, William H., 2010. "Two point one sided rendezvous," European Journal of Operational Research, Elsevier, vol. 207(1), pages 78-82, November.
    • Handle: RePEc:eee:ejores:v:207:y:2010:i:1:p:78-82
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00263-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Steve Alpern & Vic Baston, 2005. "Rendezvous on a Planar Lattice," Operations Research, INFORMS, vol. 53(6), pages 996-1006, December.
    2. Edward J. Anderson & Sándor P. Fekete, 2001. "Two Dimensional Rendezvous Search," Operations Research, INFORMS, vol. 49(1), pages 107-118, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Leone, Pierre & Buwaya, Julia & Alpern, Steve, 2022. "Search-and-rescue rendezvous," European Journal of Operational Research, Elsevier, vol. 297(2), pages 579-591.
    2. Oléron Evans, Thomas P. & Bishop, Steven R., 2013. "Static search games played over graphs and general metric spaces," European Journal of Operational Research, Elsevier, vol. 231(3), pages 667-689.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cheng-Shang Chang & Wanjiun Liao & Ching-Min Lien, 2015. "On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous," Mathematics of Operations Research, INFORMS, vol. 40(1), pages 1-23, February.
    2. Alpern, Steve, 2008. "Line-of-sight rendezvous," European Journal of Operational Research, Elsevier, vol. 188(3), pages 865-883, August.
    3. Steve Alpern & Shmuel Gal, 2002. "Searching for an Agent Who May OR May Not Want to be Found," Operations Research, INFORMS, vol. 50(2), pages 311-323, April.
    4. Pierre Leone & Steve Alpern, 2018. "Rendezvous search with markers that can be dropped at chosen times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(6-7), pages 449-461, September.
    5. Steve Alpern, 2002. "Rendezvous Search: A Personal Perspective," Operations Research, INFORMS, vol. 50(5), pages 772-795, October.
    6. Steve Alpern & Vic Baston, 2005. "Rendezvous on a Planar Lattice," Operations Research, INFORMS, vol. 53(6), pages 996-1006, December.
    7. Vic Baston & Shmuel Gal, 2001. "Rendezvous search when marks are left at the starting points," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(8), pages 722-731, December.
    8. Alpern, Steve & Baston, Vic, 2006. "A common notion of clockwise can help in planar rendezvous," European Journal of Operational Research, Elsevier, vol. 175(2), pages 688-706, December.
    9. Pierre Leone & Steve Alpern, 2022. "A Symbolic Programming Approach to the Rendezvous Search Problem," SN Operations Research Forum, Springer, vol. 3(1), pages 1-29, March.
    10. Oléron Evans, Thomas P. & Bishop, Steven R., 2013. "Static search games played over graphs and general metric spaces," European Journal of Operational Research, Elsevier, vol. 231(3), pages 667-689.
    11. Leone, Pierre & Buwaya, Julia & Alpern, Steve, 2022. "Search-and-rescue rendezvous," European Journal of Operational Research, Elsevier, vol. 297(2), pages 579-591.

    More about this item

    Keywords

    Rendezvous Search Discrete search;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:207:y:2010:i:1:p:78-82. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.