Rendezvous Search on the Line with Indistinguishable Players
From MaRDI portal
DOI10.1137/S0363012993260707zbMATH Open0843.90061MaRDI QIDQ4862429FDOQ4862429
Authors: Skander Essegaier, Edward J. Anderson 
Publication date: 8 February 1996
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Recommendations
- Rendezvous Search on the Line with Distinguishable Players
- Note: Two rendezvous search problems on the line
- Rendezvous Search on the Line with More Than Two Players
- Rendezvous Search on the Line
- Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
Cited In (29)
- Rendezvous in planar environments with obstacles and unknown initial distance
- Strategy for quickest second meeting of two agents in two locations
- Rendezvous on a discrete line
- Note: Two rendezvous search problems on the line
- A symbolic programming approach to the rendezvous search problem
- Optimal symmetric rendezvous search on three locations
- Rendezvous problem
- Line-of-sight rendezvous
- Asynchronous Deterministic Rendezvous on the Line
- Rendezvous search on the line with bounded resources: Expected time minimization
- Search-and-rescue rendezvous
- Rendezvous search with markers that can be dropped at chosen times
- Asynchronous deterministic rendezvous in graphs
- On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph
- Rendezvous Search on the Line with Limited Resources: Maximizing the Probability of Meeting
- A common notion of clockwise can help in planar rendezvous
- Ten Open Problems in Rendezvous Search
- Rendezvous of three agents on the line
- Many-player rendezvous search: Stick together or split and meet?
- Title not available (Why is that?)
- Two Dimensional Rendezvous Search
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- Rendezvous search when marks are left at the starting points
- Asymmetric rendezvous search on the circle
- Rendezvous search on labeled networks
- Rendezvous Search with Revealed Information: Applications to the Line
- Rendezvous Search on the Line with Distinguishable Players
- The Rendezvous Search Problem
- Symmetric rendezvous with advice: how to rendezvous in a disk
This page was built for publication: Rendezvous Search on the Line with Indistinguishable Players
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4862429)
