{'fraction_non_alphanumeric': 0.015822784810126583, 'fraction_numerical': 0.007911392405063292, 'mean_word_length': 4.91588785046729, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Online Strategies for Evacuating from a Convex Region by Groups in the Plane

This paper considers the problem faced by several groups of evacuees who must leave from an affected area as quickly as possible. The evacuees are divided into multiple groups with complete information sharing with each other. We seek the strategies that achieve a bounded ratio of evacuation path length without any boundary information to that with. We restrict the affected area to a convex region in the plane, and present a 4*1.414-competitive strategy. Furthermore, we analyze the performance of strategies by comparing them in different situation.