Apr 2, 2020 · We study the online problem of evacuating k robots on m concurrent rays to a single unknown exit. All k robots start on the same point s, not necessarily on ...

Dec 30, 2017 · We study the online problem of evacuating k robots on m concurrent rays to a single unknown exit. All k robots start on the same point ...

Abstract. We study the online problem of evacuating k robots on m concurrent rays to a single unknown exit. All k robots start on the same.

We study the online problem of evacuating k robots on m concurrent rays to a single unknown exit. All k robots start on the same point s , not necessarily ...

Abstract. We study the online problem of evacuating k robots on m concurrent rays to a single unknown exit. All k robots start on the same.

Oct 24, 2018 · Abstract. We study the online problem of evacuating k robots on m concurrent rays to a single unknown exit. All k robots start on the same ...

We study the online problem of evacuating k robots on m concurrent rays to a single unknown exit. All k robots start on the same point s, not necessarily on ...

We study the online problem of evacuating k robots on m concurrent rays to a single unknown exit. All k robots start on the same point \(s\), ...

This work studies the online problem of evacuating k robots on m concurrent rays to a single unknown exit to minimize the competitive ratio, i.e., ...

Wireless Evacuation on m Rays with k Searchers. Mendeley · CSV · RIS · BibTeX ; Author. Brandt, Sebastian · Förster, Klaus-Tycho · Richner, Benjamin.