S. Winograd
Journal of the ACM
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.
S. Winograd
Journal of the ACM
Ira Pohl
Artificial Intelligence
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023
Fahiem Bacchus, Joseph Y. Halpern, et al.
IJCAI 1995