For 0<r<1, the paper gives new evacuation algorithms for 2, 3, 4 agents and proves that 6+2⌈(1/r−1)⌉ agents can evacuate an equilateral triangle in the optimal time 1+√3/3≈1.577.
Baeza Yates, J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Evacuation of equilateral triangles by mobile agents of limited communication range
For 0<r<1, the paper gives new evacuation algorithms for 2, 3, 4 agents and proves that 6+2⌈(1/r−1)⌉ agents can evacuate an equilateral triangle in the optimal time 1+√3/3≈1.577.