Suppose in a given planar circular region, there are smart mobile evaders and we want to find them using sweeping agents. We assume the sweeping agents are in a line formation whose total length is predetermined. We propose procedures for designing a sweeping process that ensures the successful completion of the task, thereby deriving conditions on the sweeping velocity of the linear formation and its path. Successful completion of the task means that evaders with a given limit on their velocity cannot escape the sweeping agents. We present results on the search time given the initial conditions.

中文翻译：

---

用扫地代理搜索聪明的逃避者

假设在给定的平面圆形区域中，存在智能移动躲避者，我们希望使用扫描代理找到它们。我们假设清扫剂呈线形，其总长度是预先确定的。我们提出了设计扫掠过程的程序，以确保成功完成任务，从而得出线性地层扫掠速度及其路径的条件。成功完成任务意味着具有给定速度限制的躲避者无法逃脱扫荡特工。在给定初始条件的情况下，我们给出了搜索时间的结果。