Rendezvous Search on the Line with Distinguishable Players
From MaRDI portal
Publication:4844691
DOI10.1137/S0363012993260288zbMath0837.90075OpenAlexW2022682019MaRDI QIDQ4844691
Publication date: 27 August 1995
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012993260288
Related Items (19)
A symbolic programming approach to the rendezvous search problem ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous of three agents on the line ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Rendezvous Problem ⋮ Ten Open Problems in Rendezvous Search ⋮ Many-player rendezvous search: Stick together or split and meet? ⋮ Rendezvous search when marks are left at the starting points ⋮ A common notion of clockwise can help in planar rendezvous ⋮ Search-and-rescue rendezvous ⋮ Line-of-sight rendezvous ⋮ Asynchronous Deterministic Rendezvous on the Line ⋮ Note: Two rendezvous search problems on the line ⋮ Rendezvous Search with Revealed Information: Applications to the Line ⋮ Rendezvous search on the line with bounded resources: Expected time minimization ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous ⋮ Rendezvous search with markers that can be dropped at chosen times ⋮ Static search games played over graphs and general metric spaces
This page was built for publication: Rendezvous Search on the Line with Distinguishable Players
