Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
We consider a problem of decentralized exploration of a faulty network by several simple, memoryless agents. The model we adopt for a network is a directed graph. We design an asynchronous algorithm that can cope with failures of network edges and nodes. The algorithm is self-stabilizing in the sense that it can be started with arbitrary initializations and scalable -new agents can be added while other agents are already running.
Alain Vaucher, Philippe Schwaller, et al.
AMLD EPFL 2022
Leonid Karlinsky, Joseph Shtok, et al.
CVPR 2019
David Carmel, Haggai Roitman, et al.
ACM TIST
Chen-chia Chang, Wan-hsuan Lin, et al.
ICML 2025