Finding defectives on a line by random docking and interval group tests

DOI10.1142/S179383091750029XMaRDI QIDQ5367521zbMATH OpenOpenAlexFDO

Authors Peter Damaschke

Publication date 20 October 2017

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s179383091750029x

zbMATH Keywords

interval group testingcooperative robotscow path problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Recommendations

• Search on a line with faulty robots
• Finding one of D defective elements in some group testing models
• Search on a line with faulty robots
• Determining defectives in a linear order
• Optimal Detection of Two Defectives with a Parity Check Device

Cites work

• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• 2-Stage Fault Tolerant Interval Group Testing
• Computational Science – ICCS 2005
• Overlaps help: Improved bounds for group testing with interval queries
• Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
• Searching in the plane

Cited in

(1)

• An efficient randomized group testing procedure to determine the number of defectives

This page was built for publication: Finding defectives on a line by random docking and interval group tests

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