Discrete evacuation in graphs with multiple exits
Saved in:
| Title: | Discrete evacuation in graphs with multiple exits |
|---|---|
| Source: | Theoretical Computer Science. 1035:1-15 |
| Publisher Information: | 2025. |
| Publication Year: | 2025 |
| Subject Terms: | distributed algorithm, discrete evacuation, network flow, mobile agents, collision-free |
| Description: | In this paper, we consider the problem of efficient evacuation of mobile agents from distinct nodes in a graph to multiple exit nodes, while avoiding congestion and bottlenecks, and minimizing the total evacuation time. Each node in the graph can only hold one agent at a time, so the agents must choose their movements based on the locations of other agents to optimize the evacuation process. We consider two scenarios: the centralized (offline) and the distributed (online) setting. In the former one, the agents have complete information about the initial positions of other agents. In the distributed setting, agents lack prior knowledge of other agents’ locations but can communicate locally with nearby agents and must adapt their strategy in an online fashion as they move and gather more information. In this study, we propose an offline polynomial time solution for determining the optimal evacuation strategy for all agents. In the online case, where agents can communicate at a distance of two in the graph, a constant-competitive algorithm is presented. Additionally, we demonstrate that when agents are heterogeneous and each type of agent can access only a certain subgraph of the original graph, computing the optimal strategy becomes NP-hard, even with full global knowledge. This result remains true even if there are only two types of agents or, even if the optimal evacuation time is a small constant. |
| Document Type: | Article |
| Language: | English |
| ISSN: | 0304-3975 |
| DOI: | 10.1016/j.tcs.2025.11514110.1016/j.tcs.2025.115141 |
| Accession Number: | edsair.dris...02463..e9b73e82e2ab3fb869d771e1116fb321 |
| Database: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstract: | In this paper, we consider the problem of efficient evacuation of mobile agents from distinct nodes in a graph to multiple exit nodes, while avoiding congestion and bottlenecks, and minimizing the total evacuation time. Each node in the graph can only hold one agent at a time, so the agents must choose their movements based on the locations of other agents to optimize the evacuation process. We consider two scenarios: the centralized (offline) and the distributed (online) setting. In the former one, the agents have complete information about the initial positions of other agents. In the distributed setting, agents lack prior knowledge of other agents’ locations but can communicate locally with nearby agents and must adapt their strategy in an online fashion as they move and gather more information. In this study, we propose an offline polynomial time solution for determining the optimal evacuation strategy for all agents. In the online case, where agents can communicate at a distance of two in the graph, a constant-competitive algorithm is presented. Additionally, we demonstrate that when agents are heterogeneous and each type of agent can access only a certain subgraph of the original graph, computing the optimal strategy becomes NP-hard, even with full global knowledge. This result remains true even if there are only two types of agents or, even if the optimal evacuation time is a small constant. |
|---|---|
| ISSN: | 03043975 |
| DOI: | 10.1016/j.tcs.2025.11514110.1016/j.tcs.2025.115141 |