Title	Lower Bounds for Searching Robots, some Faulty
Creator	Kupavskii, Andrey
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2018-02-06T16:56
Description	Suppose we are sending out k robots from 0 to search the real line at a constant speed (with turns) to find a target at an unknown location; f of the robots are faulty, meaning that they fail to report the target although visiting its location. The goal is to find the target in time at most lambda \|d\|, if the target is located at d, \|d\|>1, for lambda as small as possible. In this work, we find a tight lower bound for lambda. This is joint work with Emo Welzl.
Extent	32 minutes
Subject	Mathematics; Convex and discrete geometry; Combinatorics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Birmingham
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-08-06
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0369717
URI	http://hdl.handle.net/2429/66673
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Postdoctoral
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos