Rendezvous Search on the Line with Indistinguishable Players
From MaRDI portal
Publication:4862429
DOI10.1137/S0363012993260707zbMath0843.90061MaRDI QIDQ4862429
Skander Essegaier, Edward J. Anderson
Publication date: 8 February 1996
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Related Items (18)
A symbolic programming approach to the rendezvous search problem ⋮ Asynchronous deterministic rendezvous in graphs ⋮ Rendezvous of three agents on the line ⋮ Rendezvous search on labeled 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
This page was built for publication: Rendezvous Search on the Line with Indistinguishable Players
