CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

Peter Damaschke (Institutionen för data- och informationsteknik, Datavetenskap, Algoritmer (Chalmers) ; Institutionen för data- och informationsteknik, Datavetenskap, Bioinformatik (Chalmers))
Discrete Mathematics, Algorithms and Applications (1793-8309). Vol. 9 (2017), 3,
[Artikel, refereegranskad vetenskaplig]

Suppose that some of the n elements of a totally ordered structure is defective, and several repair robots are at our disposal. They can dock at a random element, move at unit speed or leave, and send each other signals if there is no defective between them. We show that, by using only two robots that obey simple rules, the defective can be localized in square-root(n) time, which is also optimal. A variation of our strategy needs three robots but has a more predictable behaviour. The model is motivated by a conjectured DNA repair mechanism, and it combines group testing with geometric search.

Nyckelord: cooperative robots, interval group testing, cow path problem

Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2017-07-31.
CPL Pubid: 250855