Knowledge Resource Center for Ecological Environment in Arid Area
DOI | 10.1016/j.ejor.2021.05.009 |
Search-and-rescue rendezvous | |
Leone, Pierre; Buwaya, Julia; Alpern, Steve | |
通讯作者 | Leone, P (corresponding author), Univ Geneva, Dept Comp Sci, Route Drize 7, CH-1227 Carouge, Switzerland. |
来源期刊 | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
![]() |
ISSN | 0377-2217 |
EISSN | 1872-6860 |
出版年 | 2022 |
卷号 | 297期号:2页码:579-591 |
英文摘要 | 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. (c) 2021 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license ( http://creativecommons.org/licenses/by/4.0/ ) |
英文关键词 | Linear programming Rendezvous problem on the line Search-and-rescue rendezvous |
类型 | Article |
语种 | 英语 |
开放获取类型 | hybrid, Green Submitted |
收录类别 | SCI-E |
WOS记录号 | WOS:000716386200013 |
WOS关键词 | MOBILE AGENTS ; LINE ; PROBABILITY ; RESOURCES ; TOKENS ; BOUNDS |
WOS类目 | Management ; Operations Research & Management Science |
WOS研究方向 | Business & Economics ; Operations Research & Management Science |
资源类型 | 期刊论文 |
条目标识符 | http://119.78.100.177/qdio/handle/2XILL650/374563 |
作者单位 | [Leone, Pierre; Buwaya, Julia] Univ Geneva, Dept Comp Sci, Route Drize 7, CH-1227 Carouge, Switzerland; [Alpern, Steve] Univ Warwick, Warwick Business Sch, Coventry CV4 7AL, W Midlands, England |
推荐引用方式 GB/T 7714 | Leone, Pierre,Buwaya, Julia,Alpern, Steve. Search-and-rescue rendezvous[J],2022,297(2):579-591. |
APA | Leone, Pierre,Buwaya, Julia,&Alpern, Steve.(2022).Search-and-rescue rendezvous.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,297(2),579-591. |
MLA | Leone, Pierre,et al."Search-and-rescue rendezvous".EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 297.2(2022):579-591. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。