Brief Announcement: Crash-Tolerant Exploration of Trees by Energy Sharing Mobile Agents
Résumé
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 acyclic graphs (i.e. trees). We consider both the asynchronous and the synchronous settings, and we provide necessary and sufficient conditions about the energy in two settings: line-shaped graphs, and general trees.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
