Advertisement
Published in:
2017 | OriginalPaper | Chapter
Online Strategies for Evacuating from a Convex Region in the Plane
Authors : Songhua Li, Yinfeng Xu
Published in: Frontiers in Algorithmics
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Abstract
This paper studies an evacuation problem that evacuees inside an affected convex region in the plane try to escape to a boundary of the region as quickly as possible. The boundary information of the region is usually unknown to the evacuees at the beginning during an emergency. But with the help of helicopters or even satellite remote sensing technology, outside rescuers can easily get complete boundary information, and rescuers can share the information with evacuees once getting in touch with the evacuee who firstly reaches a boundary. For the scenario that people evacuate from several different positions, we first show that 3 is a lower bound on the competitive ratio, and present an online strategy with its competitive ratio proved to be no more than \( 2 + \sqrt 5 \). For the scenario that people evacuate from a single initial position, we present a strategy with its competitive ratio very close to the lower bound.