Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents

Quentin Bramas (1) , Toshimitsu Masuzawa (2) , Sébastien Tixeuil (3, 4, 5)

1 ICube - Laboratoire des sciences de l'ingénieur, de l'informatique et de l'imagerie
2 Osaka University [Osaka]
3 NPA - Networks and Performance Analysis
4 LINCS - Laboratory of Information, Network and Communication Sciences
5 IUF - Institut universitaire de France

This paper examines the exploration of a weighted graph by two mobile agents, where the energy cost of traversing an edge is equal to the edge weight. Agents located at the same position (potentially on an edge) can freely transfer energy, but one agent may unpredictably crash and cease operation. Two settings are considered: asynchronous, with no bound on the relative speed of the agents, and synchronous, with synchronized clocks and equal speeds. The study focuses ring networks and investigates the conditions for complete edge exploration based on the initial energy levels of the agents.

Domaines: Informatique [cs]; Calcul parallèle, distribué et partagé [cs.DC]; Algorithme et structure de données [cs.DS]; Informatique mobile; Robotique [cs.RO]

Quentin Bramas, Toshimitsu Masuzawa, Sébastien Tixeuil. Brief Announcement: Crash-Tolerant Exploration by Energy Sharing Mobile Agents. SSS 2023: Stabilization, Safety, and Security of Distributed Systems, Oct 2023, Jersey City, NJ, United States. pp.380-384, ⟨10.1007/978-3-031-44274-2_28⟩. ⟨hal-04232939⟩