Lower Bounds for Searching Robots, some Faulty
Lower Bounds for Searching Robots, some Faulty
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, meaning that they fail to report the target although visiting its location (called crash type). The goal …