Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, September 19, 2017, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Emo Welzl

Lower Bounds for Searching Robots, some Faulty

We consider the following generalization of the classical "cow path problem". Suppose we are sending out k robots from 0 to search the real line at constant speed (with turns) to find a target at an unknown location; f of the robots are faulty (of so-called crash type), meaning that they fail to report the target although visiting its location. The goal is to find the target in time at most λ|d|, if the target is located at d, |d|≥1, for λ as small as possible. We show that it cannot be achieved for λ < 2*(1+ρ)^{1+ρ}/ρ^ρ + 1, ρ := 2*(f+1)/k − 1, which is tight due to earlier work. This also gives some better than previously known lower bounds for so-called Byzantine-type faulty robots (that may, deceitfully, actually wrongly report a target). (Joint work with Andrey Kupavskii.)

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login