Distributed Evacuation in Graphs with Multiple Exits

  • Piotr Borowiecki
  • Shantanu Das
  • Dariusz Dereniowski
  • Łukasz Kuszner
Conference paper

DOI: 10.1007/978-3-319-48314-6_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9988)
Cite this paper as:
Borowiecki P., Das S., Dereniowski D., Kuszner Ł. (2016) Distributed Evacuation in Graphs with Multiple Exits. In: Suomela J. (eds) Structural Information and Communication Complexity. SIROCCO 2016. Lecture Notes in Computer Science, vol 9988. Springer, Cham

Abstract

We consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy based on locations of other agents in the graph, in order to minimize the total time needed for evacuation. We consider two scenarios: (i) the centralized (or offline) setting where the agents have full knowledge of initial positions of other agents, and (ii) the distributed (or online) setting where the agents do not have prior knowledge of the location of other agents but they can communicate locally with nearby agents and they must modify their strategy in an online fashion while they move and obtain more information. In the former case we present an offline polynomial time solution to compute the optimal strategy for evacuation of all agents. In the online case, we present a constant competitive algorithm when agents can communicate at distance two in the graph. We also show that when the agents are heterogeneous and each agent has access to only a subgraph of the original graph then computing the optimal strategy is NP-hard even with full global knowledge. This result holds even if there are only two types of agents.

Keywords

Discrete evacuation Distributed algorithm Mobile agents Network flow 

Copyright information

© Springer International Publishing AG 2016

Authors and Affiliations

  • Piotr Borowiecki
    • 1
  • Shantanu Das
    • 2
  • Dariusz Dereniowski
    • 1
  • Łukasz Kuszner
    • 1
  1. 1.Faculty of Electronics, Telecommunications and InformaticsGdańsk University of TechnologyGdańskPoland
  2. 2.Aix Marseille Univ., CNRS, LIFMarseilleFrance

Personalised recommendations