Zobrazit v EDS

Discrete evacuation in graphs with multiple exits

Uloženo v:
Podrobná bibliografie
Název: Discrete evacuation in graphs with multiple exits
Zdroj: Theoretical Computer Science. 1035:1-15
Informace o vydavateli: 2025.
Rok vydání: 2025
Témata: distributed algorithm, discrete evacuation, network flow, mobile agents, collision-free
Popis: 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.
Druh dokumentu: Article
Jazyk: English
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2025.11514110.1016/j.tcs.2025.115141
Přístupové číslo: edsair.dris...02463..f64059068e12ccbf8a3d6d9bdaff533f
Databáze: OpenAIRE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edsair&genre=article&issn=03043975&ISBN=&volume=1035&issue=&date=20250101&spage=1&pages=1-15&title=Theoretical Computer Science&atitle=Discrete%20evacuation%20in%20graphs%20with%20multiple%20exits&aulast=&id=DOI:10.1016/j.tcs.2025.11514110.1016/j.tcs.2025.115141
    Name: Full Text Finder
    Category: fullText
    Text: Full Text Finder
    Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif
    MouseOverText: Full Text Finder
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsair
DbLabel: OpenAIRE
An: edsair.dris...02463..f64059068e12ccbf8a3d6d9bdaff533f
RelevancyScore: 999
AccessLevel: 3
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 998.988342285156
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Discrete evacuation in graphs with multiple exits
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <i>Theoretical Computer Science</i>. 1035:1-15
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: 2025.
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2025
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22distributed+algorithm%22">distributed algorithm</searchLink><br /><searchLink fieldCode="DE" term="%22discrete+evacuation%22">discrete evacuation</searchLink><br /><searchLink fieldCode="DE" term="%22network+flow%22">network flow</searchLink><br /><searchLink fieldCode="DE" term="%22mobile+agents%22">mobile agents</searchLink><br /><searchLink fieldCode="DE" term="%22collision-free%22">collision-free</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 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.
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: Article
– Name: Language
  Label: Language
  Group: Lang
  Data: English
– Name: ISSN
  Label: ISSN
  Group: ISSN
  Data: 0304-3975
– Name: DOI
  Label: DOI
  Group: ID
  Data: 10.1016/j.tcs.2025.11514110.1016/j.tcs.2025.115141
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsair.dris...02463..f64059068e12ccbf8a3d6d9bdaff533f
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsair&AN=edsair.dris...02463..f64059068e12ccbf8a3d6d9bdaff533f
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.tcs.2025.11514110.1016/j.tcs.2025.115141
    Languages:
      – Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 15
        StartPage: 1
    Subjects:
      – SubjectFull: distributed algorithm
        Type: general
      – SubjectFull: discrete evacuation
        Type: general
      – SubjectFull: network flow
        Type: general
      – SubjectFull: mobile agents
        Type: general
      – SubjectFull: collision-free
        Type: general
    Titles:
      – TitleFull: Discrete evacuation in graphs with multiple exits
        Type: main
  BibRelationships:
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2025
          Identifiers:
            – Type: issn-print
              Value: 03043975
            – Type: issn-locals
              Value: edsair
          Numbering:
            – Type: volume
              Value: 1035
          Titles:
            – TitleFull: Theoretical Computer Science
              Type: main
ResultId 1