Linear rendezvous with asymmetric clocks
From MaRDI portal
Publication:5091103
Recommendations
Cites work
- scientific article; zbMATH DE number 2102782 (Why is no real title available?)
- Asynchronous Deterministic Rendezvous on the Line
- Asynchronous deterministic rendezvous in graphs
- Convergence of Autonomous Mobile Robots with Inaccurate Sensors and Movements
- Deterministic rendezvous in graphs
- Fast rendezvous on a cycle by agents with different speeds
- Group search on the line
- Inequalities on the Lambert \(W\) function and hyperpower function
- Linear Search with Terrain-Dependent Speeds
- On deterministic rendezvous at a node of agents with arbitrary velocities
- On the Lambert \(w\) function
- On the linear search problem
- Online searching with turn cost
- Parallel searching in the plane
- Rendezvous and election of mobile agents: Impact of sense of direction
- Search on a line with faulty robots
- Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
- Searching in the plane
- Tell Me Where I Am So I Can Meet You Sooner
- The gathering problem for two oblivious robots with unreliable compasses
- Wait-free gathering without chirality
- Yet more on the linear search problem
This page was built for publication: Linear rendezvous with asymmetric clocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091103)
