1 paper
Konstantinos Georgiou, Caleb Jones, Matthew Madej
We consider the problem of minimizing the worst-case search time for a hidden point target in the plane using multiple mobile agents of differing speeds, all starting from a common…