Note: Two rendezvous search problems on the line
From MaRDI portal
Publication:4243201
DOI<335::AID-NAV6>3.0.CO;2-Q 10.1002/(SICI)1520-6750(199904)46:3<335::AID-NAV6>3.0.CO;2-QzbMath0922.90152OpenAlexW2024559564MaRDI QIDQ4243201
Publication date: 4 October 1999
Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199904)46:3<335::aid-nav6>3.0.co;2-q
Related Items (17)
A symbolic programming approach to the rendezvous search problem ⋮ Social distancing, gathering, search games: mobile agents on simple networks ⋮ Rendezvous of three agents on the line ⋮ Rendezvous search on labeled networks ⋮ Rendezvous search on a star graph with examination costs ⋮ Rendezvous Problem ⋮ Ten Open Problems in Rendezvous Search ⋮ 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 ⋮ Rendezvous Search with Revealed Information: Applications to the Line ⋮ Two point one sided rendezvous ⋮ Rendezvous search on the line with bounded resources: Expected time minimization ⋮ Rendezvous in planar environments with obstacles and unknown initial distance ⋮ Rendezvous search with markers that can be dropped at chosen times
Cites Work
- Rendezvous search on the line with bounded resources: Expected time minimization
- Rendezvous Search on the Line with More Than Two Players
- The Symmetric Rendezvous-Evasion Game
- Minimax Rendezvous on the Line
- The Rendezvous Search Problem
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
This page was built for publication: Note: Two rendezvous search problems on the line
