Aditya Malik, Nalini Ratha, et al.
CAI 2024
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.
Aditya Malik, Nalini Ratha, et al.
CAI 2024
Daniel Karl I. Weidele, Hendrik Strobelt, et al.
SysML 2019
Zhikun Yuen, Paula Branco, et al.
DSAA 2023
Susan L. Spraragen
International Conference on Design and Emotion 2010