Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

Search-and-rescue rendezvous

Tools
- Tools
+ Tools

Leonea, Pierre, Buwaya, Julia and Alpern, Steve (2022) Search-and-rescue rendezvous. European Journal of Operational Research, 297 (2). pp. 579-591. doi:10.1016/j.ejor.2021.05.009

[img]
Preview
PDF
WRAP-search-rescue-rendezvous-Alpern-2021.pdf - Published Version - Requires a PDF viewer.
Available under License Creative Commons Attribution 4.0.

Download (2004Kb) | Preview
[img] PDF
WRAP-search-rescue-rendezvous-Alpern-2021.pdf - Accepted Version
Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer.

Download (3356Kb)
Official URL: https://doi.org/10.1016/j.ejor.2021.05.009

Request Changes to record.

Abstract

We consider a new type of asymmetric rendezvous search problem in which player II needs to give player I a ‘gift’ which can be in the form of information or material. The gift can either be transfered upon meeting, as in traditional rendezvous, or it can be dropped off by player II at a location he passes, in the hope it will be found by player I. The gift might be a water bottle for a traveller lost in the desert; a supply cache for Captain Scott in the Antarctic; or important information (left as a gift). The common aim of the two players is to minimize the time taken for I to either meet II or find the gift. We find optimal agent paths and drop off times when the search region is a line, the initial distance between the players is known and one or both of the players can leave gifts.
A novel and important technique introduced in this paper is the use of families of linear programs to solve this and previous rendezvous problems. Previously, the approach was to guess the answer and then prove it was optimal. Our work has applications to other forms of rendezvous on the line: we can solve the symmetric version (players must use the same strategy) with two gifts and we show that there are no asymmetric solutions to this two gifts problem. We also solve the GiftStart problem, where the gift or gifts must be dropped at the start of the game. Furthermore, we can solve the Minmax version of the game where the objective function is to minimize the maximum rendezvous time. This problem admits variations where players have 0, 1 or 2 gifts at disposal. In particular, we show that the classical Wait For Mommy strategy is optimal for this setting.

Item Type: Journal Article
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences
Faculty of Social Sciences > Warwick Business School
Library of Congress Subject Headings (LCSH): Linear programming, Search theory, Game theory
Journal or Publication Title: European Journal of Operational Research
Publisher: Elsevier
ISSN: 0377-2217
Official Date: 1 March 2022
Dates:
DateEvent
1 March 2022Published
23 May 2021Available
10 May 2021Accepted
Volume: 297
Number: 2
Page Range: pp. 579-591
DOI: 10.1016/j.ejor.2021.05.009
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Open Access
Related URLs:
  • Publisher
Open Access Version:
  • ArXiv

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item
twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us