Linear search with probabilistic detection and variable speeds

DOI10.1007/978-3-031-98740-3_31MaRDI QIDQ6876372zbMATH OpenFDO

Authors Jared Coleman, Oscar Morales-Ponce

Publication date 13 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-98740-3_31

zbMATH Keywords

competitive analysiscow-pathlinear searchmobile agentsonline algorithmsprobabilistic search

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• Linear search with probabilistic detection and variable speeds
• Linear Search with Terrain-Dependent Speeds
• On the linear search problem
• Probabilistically faulty searching on a half-line (extended abstract)
• Search and rescue on the line
• Search on a line with faulty robots
• The beachcombers' problem: walking and searching with mobile robots
• The theory of search games and rendezvous.

Cited in

(1)

• Linear search with probabilistic detection and variable speeds

This page was built for publication: Linear search with probabilistic detection and variable speeds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876372)