Search-and-rescue rendezvous

• Published in: European journal of operational research Vol. 297; no. 2; pp. 579 - 591
• Main Authors: Leone, Pierre, Buwaya, Julia, Alpern, Steve
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01-03-2022
• Subjects: Linear programming; Rendezvous problem on the line; Search-and-rescue rendezvous; Search-and-rescue rendezvous; Linear programming; Rendezvous problem on the line
• ISSN: 0377-2217; 1872-6860
• DOI: 10.1016/j.ejor.2021.05.009

•New Rendezvous games defined and solved where the players use Gifts.•New Search and Rescue games.•On the optimality of Wait for Mommy.•New way of solving the game by computing the optimal strategies.•GiftStart, Symmetric and Minmax Rendezvous.
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.