2026-07-23T01:12:42Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:22545 2025-10-02T11:05:45Z ddc:004 open_access

Crash-Tolerant Exploration of Trees by Energy-Sharing Mobile Agents Bramas, Quentin Masuzawa, Toshimitsu Tixeuil, Sébastien Mobile Agents Distributed Algorithms Energy sharing We consider the problem of graph exploration by energy sharing mobile agents that are subject to crash faults. More precisely, we consider a team of two agents where at most one of them may fail unpredictably, and the considered topology is that of connected acyclic graphs (i.e. trees). We consider both the asynchronous and the synchronous settings, and we provide necessary and sufficient conditions about the energy. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Quentin Bramas and Toshimitsu Masuzawa and Sébastien Tixeuil 2025 Is Part Of LIPIcs, Volume 324, 28th International Conference on Principles of Distributed Systems (OPODIS 2024) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2024.9 urn:nbn:de:0030-drops-225452 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2024.9 eng https://creativecommons.org/licenses/by/4.0/legalcode