A general framework for searching on a line
From MaRDI portal
Publication:1676358
DOI10.1016/j.tcs.2017.08.023zbMath1380.68453OpenAlexW2754752206MaRDI QIDQ1676358
Jean-Lou De Carufel, Prosenjit Bose
Publication date: 7 November 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.08.023
Related Items (3)
Algorithms for \(p\)-Faulty Search on a half-line ⋮ Energy Consumption of Group Search on a Line ⋮ Weighted group search on a line \& implications to the priority evacuation problem
Cites Work
- Unnamed Item
- Unnamed Item
- Anonymous meeting in networks
- Asynchronous deterministic rendezvous in bounded terrains
- Searching in the plane
- Search games
- Optimal sequencing of contract algorithms
- The theory of search games and rendezvous.
- Asynchronous deterministic rendezvous in graphs
- Online searching with turn cost
- Searching on a line: a complete characterization of the optimal solution
- A general search game
- A General Framework for Searching on a Line
- Computational Principles of Mobile Robotics
- Tell Me Where I Am So I Can Meet You Sooner
- Competitive Online Approximation of the Optimal Search Ratio
- Rendezvous search on a graph
- Online Routing in Triangulations
- Search Theory
- Planning Algorithms
- The ultimate strategy to search on \(m\) rays?
- Parallel searching on \(m\) rays
- Routing with guaranteed delivery in ad hoc wireless networks
This page was built for publication: A general framework for searching on a line
