betaFeedback

WorksComputer Science

Evacuating from Eventually Emerging Targets on the Line

Abstract

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, nn unit-speed agents with wireless communication start at the origin and search for a hidden target at location xx, where ∣x∣≥1|x|\geq1, that becomes detectable at an unknown time TT. Visiting xx before time TT 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 TT, giving cost T+∣x∣T+|x|. In the fully-informed model, the offline algorithm knows xx from the beginning, giving cost max⁡{∣x∣,T}\max\{|x|,T\}. For one agent, the optimal competitive ratio is 99 under both measures, as in classical cow-path search. For two agents, we give an algorithm with competitive ratio 3+63+\sqrt6 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 4.354.35 and 4.384.38 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 3.10143.1014 and 3.28233.2823 for the emergence-aware and fully-informed measures, respectively, and introduce a geometric three-peak family. Different parameter choices give the corresponding upper bounds 4.0105994.010599 and 4.3404454.340445. These bounds lie below the corresponding two-agent lower bounds, so a third agent provably improves both measures.

Paper details

vlnc:W_uvmbw9fy
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 2

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

ChatGPT

View statement
Looking for related papers…