IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v65y2018i6-7p449-461.html
   My bibliography  Save this article

Rendezvous search with markers that can be dropped at chosen times

Author

Listed:
  • Pierre Leone
  • Steve Alpern

Abstract

The Rendezvous search problem asks how two noncomunnicating players, who move at unit‐speed after a random placement in the search region (in this article, the line), can minimize their expected meeting time. Baston and Gal () solved a version where each player leaves a marker at his starting point, for example parachutes left after jumping into the search region. Here we consider that one or both players have markers which they can drop at chosen times. When the players are placed facing random directions at a distance D on the line the optimal expected meeting times R are known to be as follows: With no markers, R = 13D/8; with one each dropped at the start, R = 3D/2. Here we show that when only one player has a marker, but it can be dropped at any time, we still have R = 3D/2, obtained by dropping the marker at time D/4. Having both players drop markers at chosen times does not further reduce R. We adopt a new algorithmic approach which first fixes the dropping times and then reduces the resulting problem to a finite one. We also consider evanescent markers, which are detectable for a specified time T after being dropped, modeling pheromone scent markers used by some species in mate search or stain dropped by sailors. From a less theoretical and more practical point of view, we can see our problem as that faced by two hikers who get separated when they are walking not too far from a coast. A reasonable Rendezvous strategy is for each of them to head in the general direction of the coastline. On reaching the sea, they can calculate (based on their speed and time taken to reach to coast) the maximum distance along the coastline where the other one arrives. Then they can use our solution, taking that distance as our parameter D. Of course if it turns out that they reached the sea at points closer than D, their Rendezvous time will only be shorter. So our solution can be interpreted as a worst case expected meeting time. The marker might be a note scribbled on the sand, or a pile of rocks. Perhaps before getting separated they would have decided which roles (I or II) each would take up, being careful and cautious hikers. So in particular the hiker taking the role of the marker placer would put down a marker of some sort when he had walked along the coast one quarter the maximum distance to his partner. If the other finds it, he would know for sure the direction of the hiker who dropped it. Another thing to take away from this article is our result that says “two markers are not better than one.” This observation has some significance in the mate search context, where males and females use pheromone deposits to help find each other. In most species, it is only the females who can make such deposits, and the males can detect it. Giving both species the depositing facility would be more costly in terms of energy and, given our negative result, might not significantly reduce Rendezvous times. So in a speculative sense, our result has some explanatory value in this context.

Suggested Citation

  • 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.
  • Handle: RePEc:wly:navres:v:65:y:2018:i:6-7:p:449-461
    DOI: 10.1002/nav.21818
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.21818
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nav.21818?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. S. Gal & J. V. Howard, 2005. "Rendezvous-Evasion Search in Two Boxes," Operations Research, INFORMS, vol. 53(4), pages 689-697, August.
    2. Qiaoming Han & Donglei Du & Juan Vera & Luis F. Zuluaga, 2008. "Improved Bounds for the Symmetric Rendezvous Value on the Line," Operations Research, INFORMS, vol. 56(3), pages 772-782, June.
    3. Steve Alpern, 2002. "Rendezvous search on labeled networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(3), pages 256-274, April.
    4. Shmuel Gal, 1999. "Rendezvous Search on the Line," Operations Research, INFORMS, vol. 47(6), pages 974-976, December.
    5. J. V. Howard, 1999. "Rendezvous Search on the Interval and the Circle," Operations Research, INFORMS, vol. 47(4), pages 550-558, August.
    6. Edward J. Anderson & Sándor P. Fekete, 2001. "Two Dimensional Rendezvous Search," Operations Research, INFORMS, vol. 49(1), pages 107-118, February.
    7. 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.
    8. Richard Weber, 2012. "Optimal Symmetric Rendezvous Search on Three Locations," Mathematics of Operations Research, INFORMS, vol. 37(1), pages 111-122, February.
    9. Elizabeth J. Chester & Reha H. Tütüncü, 2004. "Rendezvous Search on the Labeled Line," Operations Research, INFORMS, vol. 52(2), pages 330-334, April.
    10. Emily M. Craparo & Mumtaz Karatas & Tobias U. Kuhn, 2017. "Sensor placement in active multistatic sonar networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(4), pages 287-304, June.
    11. Vic Baston, 1999. "Note: Two rendezvous search problems on the line," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(3), pages 335-340, April.
    12. Steve Alpern & Anatole Beck, 1999. "Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting," Operations Research, INFORMS, vol. 47(6), pages 849-861, December.
    13. Steve Alpern, 2002. "Rendezvous Search: A Personal Perspective," Operations Research, INFORMS, vol. 50(5), pages 772-795, October.
    14. Kikuta, Kensaku & Ruckle, William H., 2007. "Rendezvous search on a star graph with examination costs," European Journal of Operational Research, Elsevier, vol. 181(1), pages 298-304, August.
    15. 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.
    16. Steve Alpern & Anatole Beck, 2000. "Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance," Operations Research, INFORMS, vol. 48(3), pages 498-501, June.
    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. 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.

    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. Leone, Pierre & Buwaya, Julia & Alpern, Steve, 2022. "Search-and-rescue rendezvous," European Journal of Operational Research, Elsevier, vol. 297(2), pages 579-591.
    2. 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.
    3. Steve Alpern, 2002. "Rendezvous Search: A Personal Perspective," Operations Research, INFORMS, vol. 50(5), pages 772-795, October.
    4. 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.
    5. Alpern, Steve, 2008. "Line-of-sight rendezvous," European Journal of Operational Research, Elsevier, vol. 188(3), pages 865-883, August.
    6. Steve Alpern & Li Zeng, 2022. "Social Distancing, Gathering, Search Games: Mobile Agents on Simple Networks," Dynamic Games and Applications, Springer, vol. 12(1), pages 288-311, March.
    7. Steve Alpern & Thomas Lidbetter, 2015. "Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object," Operations Research, INFORMS, vol. 63(1), pages 122-133, February.
    8. Steve Alpern & Vic Baston, 2005. "Rendezvous on a Planar Lattice," Operations Research, INFORMS, vol. 53(6), pages 996-1006, December.
    9. Steve Alpern & Thomas Lidbetter, 2013. "Mining Coal or Finding Terrorists: The Expanding Search Paradigm," Operations Research, INFORMS, vol. 61(2), pages 265-279, April.
    10. 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.
    11. Steve Alpern & Wei Shi Lim, 2002. "Rendezvous of three agents on the line," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(3), pages 244-255, April.
    12. Steve Alpern, 2017. "Hide-and-Seek Games on a Network, Using Combinatorial Search Paths," Operations Research, INFORMS, vol. 65(5), pages 1207-1214, October.
    13. J. V. Howard & Marco Timmer, 2013. "New results on rendezvous search on the interval," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(6), pages 454-467, September.
    14. 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.
    15. Steve Alpern, 2011. "Find-and-Fetch Search on a Tree," Operations Research, INFORMS, vol. 59(5), pages 1258-1268, October.
    16. Edward J. Anderson & Sándor P. Fekete, 2001. "Two Dimensional Rendezvous Search," Operations Research, INFORMS, vol. 49(1), pages 107-118, February.
    17. 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.
    18. Alpern, Steve & Katrantzi, Ioanna, 2009. "Equilibria of two-sided matching games with common preferences," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1214-1222, August.
    19. Steve Alpern, 2002. "Rendezvous search on labeled networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(3), pages 256-274, April.
    20. Alpern, Steven & Lidbetter, Thomas, 2015. "Optimal trade-off between speed and acuity when searching for a small object," LSE Research Online Documents on Economics 61504, London School of Economics and Political Science, LSE Library.

    More about this item

    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:wly:navres:v:65:y:2018:i:6-7:p:449-461. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.