Search-and-rescue rendezvous

Leone, Pierre; Buwaya, Julia; Alpern, Steve

doi:10.1016/j.ejor.2021.05.009

Cited by 11 publications

(3 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The parametric linear programming approach of this article leads to more precise results than the ad hoc approach of [23]. Moreover, here we accommodate to players with different speeds, extending the results of [23,36].…”

Section: Our Contributionsmentioning

confidence: 91%

See 1 more Smart Citation

Rendezvous on the Line with Different Speeds and Markers That Can Be Dropped at Chosen Time

Leone¹,

Cohen²

2022

Algorithms

Self Cite

View full text Add to dashboard Cite

In this paper, we introduce a linear program (LP)-based formulation of a rendezvous game with markers on the infinite line and solve it. In this game one player moves at unit speed while the second player moves at a speed bounded by vmax≤1. We observe that in this setting, a slow-moving player may have interest to remain still instead of moving. This shows that in some conditions the wait-for-mummy strategy is optimal. We observe as well that the strategies are completely different if the player that holds the marker is the fast or slow one. Interestingly, the marker is not useful when the player without marker moves slowly, i.e., the fast-moving player holds the marker.

show abstract

Section: Our Contributionsmentioning

confidence: 91%

“…In [23,36], a similar problem with markers is considered. The parametric linear programming approach of this article leads to more precise results than the ad hoc approach of [23].…”

Section: Our Contributionsmentioning

confidence: 99%

Rendezvous on the Line with Different Speeds and Markers That Can Be Dropped at Chosen Time

Leone¹,

Cohen²

2022

Algorithms

Self Cite

View full text Add to dashboard Cite

show abstract

“…Rendezvous is an example of a family of problems considered in search theory [15][16][17]. Modern applications of rendezvous search vary from finding a common channel of communication [18], agent recharging in persistent tasks [19], drones and other autonomous vehicles navigation and coordination [20], or finding an astray traveler by a rescue team [21]. The results possibly concern even dating and mating strategies [22].…”

Section: Rendezvous Search Overviewmentioning

confidence: 99%

Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks

Mironowicz

2023

New J. Phys.

View full text Add to dashboard Cite

Rendezvous is an old problem of assuring that two or more parties, initially separated, not knowing the position of each other, and not allowed to communicate, are striving to meet without pre-agreement on the meeting point. This problem has been extensively studied in classical computer science and has vivid importance to modern and future applications. Quantum non-locality, like Bell inequality violation, has shown that in many cases quantum entanglement allows for improved coordination of two, or more, separated parties compared to classical sources. The non-signaling correlations in many cases even strengthened such phenomena. In this work, we analyze, how Bell non-locality can be used by asymmetric location-aware agents trying to rendezvous on a finite network with a limited number of steps. We provide the optimal solution to this problem for both agents using quantum resources, and agents with only ``classical'' computing power. Our results show that for cubic graphs and cycles it is possible to gain an advantage by allowing the agents to use the assistance of entangled quantum states.

show abstract