Strategies of groups evacuation from a convex region in the plane

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

10 Scopus citations

Abstract

How to evacuate from affected area when an emergency occurs? How to escape efficiently from the affected area when the evacuees are divided into multiple groups with complete information sharing with each other? This paper studies the evacuation strategies of this problem from a convex region in the plane, and analyzes this problem in two scenarios: general plane and plane in grid network. In these two scenarios, we design evacuation strategies and analyze the evacuate ratio of strategies, respectively. In some cases, we show that the given strategies are optimal. Furthermore, we analyze the performance of strategies by comparing them in different situations.

Original languageEnglish
Title of host publicationFrontiers in Algorithmics and Algorithmic Aspects in Information and Management - Third Joint International Conference, FAW-AAIM 2013, Proceedings
Pages250-260
Number of pages11
DOIs
StatePublished - 2013
Event7th International Frontiers in Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects in Information and Management, FAW-AAIM 2013 - Dalian, China
Duration: 26 Jun 201328 Jun 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7924 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Frontiers in Algorithmics Workshop and the 9th International Conference on Algorithmic Aspects in Information and Management, FAW-AAIM 2013
Country/TerritoryChina
CityDalian
Period26/06/1328/06/13

Keywords

  • Evacuation strategy
  • Grid network
  • Groups evacuation

Fingerprint

Dive into the research topics of 'Strategies of groups evacuation from a convex region in the plane'. Together they form a unique fingerprint.

Cite this