Search-and-rescue rendezvous

Leone, Pierre; Buwaya, Julia; Alpern, Steve

doi:10.1016/j.ejor.2021.05.009

Cited by 9 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

A Symbolic Programming Approach to the Rendezvous Search Problem

Leone

Alpern

2022

Oper. Res. Forum

Self Cite

View full text Add to dashboard Cite

In this paper we solve the rendezvous problem on the line with markers that can be dropped at chosen times when the initial distance D between the players is known. In the case of one marker, the $$M_1$$ M 1 game, the marker is held by player II at the start of the game and, once dropped and found by player I, indicates in which direction player I must move. In the case of two markers, the $$M_2$$ M 2 game, each player holds one and the dropping times may differ. There is uncertainty regarding the problem initial configuration, and the goal is to minimize the expected rendezvous time that we call the rendezvous value (of the game) denoted $$R_1$$ R 1 and $$R_2$$ R 2 for the $$M_1$$ M 1 and $$M_2$$ M 2 games respectively. We present an algorithm that computes exactly the rendezvous value of the $$M_1$$ M 1 game as a function of the dropping time z, i.e. $$z\mapsto R_1(z)$$ z ↦ R 1 ( z ) . Then we show that the function $$R_1(z)$$ R 1 ( z ) is locally an affine function and we compute the parameters of the local representations of $$R_1(z)$$ R 1 ( z ) . Finally, the rendezvous value of the game $$R_1=min_z R_1(z)$$ R 1 = m i n z R 1 ( z ) and the optimal dropping times can be determined with the expression of $$R_1(z)$$ R 1 ( z ) . The same proceeding can be extended to apply to the problem $$M_2$$ M 2 . Symbolic execution of programs is a classical technique of program testing in computer science, see King [1] for the pioneering work. In this work we adapt the symbolic execution technique to solve an optimization problem. To our knowledge this is the first time that this is attempted, in particular to deal with rendezvous problems.

show abstract

Search-and-rescue rendezvous

Cited by 9 publications

References 37 publications

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

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

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

A Symbolic Programming Approach to the Rendezvous Search Problem

Contact Info

Product

Resources

About