Weighted Group Search on the Disk & Improved Lower Bounds for Priority
Evacuation
Weighted Group Search on the Disk & Improved Lower Bounds for Priority
Evacuation
We consider \emph{weighted group search on a disk}, which is a search-type problem involving 2 mobile agents with unit-speed. The two agents start collocated and their goal is to reach a (hidden) target at an unknown location and a known distance of exactly 1 (i.e., the search domain is the …