← 研踪 PaperTrailarXiv:2611.20146 · v1
Evacuating from Eventually Emerging Targets on the Line
首次提交 2026-11-16 01:26
版本更新 2026-11-16 01:26
雷达观测 2026-11-17 12:06
摘要
We introduce and study Eventually Emerging Linear Search, an online evacuation problem on the line that, to the best of our knowledge, has not been studied before. In this problem, unit-speed agents with wireless communication start at the origin and search for a hidden target at location , where , that becomes detectable at an unknown time . Visiting before time reveals nothing, and the search terminates only when all agents have reached the target. We study two competitive measures. In the emergence-aware model, the target location becomes known to the offline algorithm at time , giving cost . In the fully-informed model, the offline algorithm knows from the beginning, giving cost . For one agent, the optimal competitive ratio is under both measures, as in classical cow-path search. For two agents, we give an algorithm with competitive ratio under both measures, and prove it optimal within the class of origin-separated algorithms, in which each agent performs strictly expanding origin-return excursions on a fixed half-line. We also prove the unconditional lower bounds and for the emergence-aware and fully-informed measures, respectively. These bounds are computer-assisted; we derive finite linear programming relaxations for arbitrary algorithms and certify their infeasibility using exact rational Farkas certificates. For three agents, we prove analytically the unconditional lower bounds and for the emergence-aware and fully-informed measures, respectively, and introduce a geometric three-peak family. Different parameter choices give the corresponding upper bounds and . These bounds lie below the corresponding two-agent lower bounds, so a third agent provably improves both measures.
作者备注:52 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-16 01:26 · 最新观测版本
Evacuating from Eventually Emerging Targets on the Line
We introduce and study Eventually Emerging Linear Search, an online evacuation problem on the line that, to the best of our knowledge, has not been studied before. In this problem, unit-speed agents with wireless communication start at the origin and search for a hidden target at location , where , that becomes detectable at an unknown time . Visiting before time reveals nothing, and the search terminates only when all agents have reached the target. We study two competitive measures. In the emergence-aware model, the target location becomes known to the offline algorithm at time , giving cost . In the fully-informed model, the offline algorithm knows from the beginning, giving cost . For one agent, the optimal competitive ratio is under both measures, as in classical cow-path search. For two agents, we give an algorithm with competitive ratio under both measures, and prove it optimal within the class of origin-separated algorithms, in which each agent performs strictly expanding origin-return excursions on a fixed half-line. We also prove the unconditional lower bounds and for the emergence-aware and fully-informed measures, respectively. These bounds are computer-assisted; we derive finite linear programming relaxations for arbitrary algorithms and certify their infeasibility using exact rational Farkas certificates. For three agents, we prove analytically the unconditional lower bounds and for the emergence-aware and fully-informed measures, respectively, and introduce a geometric three-peak family. Different parameter choices give the corresponding upper bounds and . These bounds lie below the corresponding two-agent lower bounds, so a third agent provably improves both measures.
查看此版本解读 →查看此版本原文 ↗