Note: Two rendezvous search problems on the line
From MaRDI portal
Recommendations
Cites work
- Minimax Rendezvous on the Line
- Rendezvous search on the line with bounded resources: Expected time minimization
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
- Rendezvous Search on the Line with More Than Two Players
- The Rendezvous Search Problem
- The Symmetric Rendezvous-Evasion Game
Cited in
(25)- Rendezvous search on the line with bounded resources: Expected time minimization
- A symbolic programming approach to the rendezvous search problem
- Social distancing, gathering, search games: mobile agents on simple networks
- Search-and-rescue rendezvous
- Rendezvous in planar environments with obstacles and unknown initial distance
- A common notion of clockwise can help in planar rendezvous
- Line-of-sight rendezvous
- Rendezvous problem
- Ten Open Problems in Rendezvous Search
- Rendezvous on a discrete line
- Rendezvous search with markers that can be dropped at chosen times
- Asynchronous Deterministic Rendezvous on the Line
- Rendezvous Search on the Labeled Line
- Rendezvous search when marks are left at the starting points
- Rendezvous Search on the Line with More Than Two Players
- Rendezvous of three agents on the line
- Rendezvous search on labeled networks
- New results on rendezvous search on the interval
- Minimax Rendezvous on the Line
- Rendezvous Search on the Line with Distinguishable Players
- Rendezvous Search on the Line with Indistinguishable Players
- Rendezvous Search with Revealed Information: Applications to the Line
- Rendezvous search on a sphere: the astronaut problem
- Rendezvous search on a star graph with examination costs
- Two point one sided rendezvous
This page was built for publication: Note: Two rendezvous search problems on the line
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243201)