Abstract
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.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
F.R. Adler and D.M. Gordon, Information collection and spread by networks of patrolling ants, The American Naturalist 140(3) (1992) 373-400.
R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász and C. Rackoff, Random walks, universal traversal sequencs and the complexity of mave problems, in: Proceedings of the 20th Annual Symposium on Foundation of Computer Science (1979) pp. 218-223.
S. Even, Graph Algorithms (Addisson-Wesley, Reading, MA, 1979).
D.M. Gordon, The expandable network of ant exploration, Animal Behaviour 50 (1995) 372-378.
K. Knight, Are many reactive agents better than a few deliberative ones, in: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI) (1993) pp. 432-437.
S. Koenig, B. Szymanski and Y. Liu, Efficient and inefficient ant coverage methods, Annals of Mathematics and Artificial Intelligence, Special Issue on Ant Robotics (2001).
R.E. Korf, Real-time heuristic search, Artificial Intelligence 42 (1992) 189-211.
R. Tarjan, Depth-first search and linear graph algorithms, SIAM J. Comput. 1(2) (1972) 146-160.
G. Tarry, Le probleme des labyrinths, Nouvelles Annales de Mathematiques 14(187) (1895).
I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, Smell as a computational resourse-A lesson we can learn from the ants, in: Proceedings of the 4th Israeli Symposium on Theory of Computing and Systems (ISTCS), Jerusalem, June 10-11, 1996, pp. 219-230.
I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, On-line graph searching by a smell-oriented vertex process, in: AAAI-97 Workshop on On-Line Search, Providence, RI (28 July 1997).
I.A. Wagner, M. Lindenbaum and A.M. Bruckstein, ANTS: Agents on Networks, Trees and Subgraphs, Future Generation Computer Systems, Special Issue on Ant Colony Optimization 8(16) (2000) 915-926.
V.M. Yanovski, I.A. Wagner and A.M. Bruckstein, Distributed ant algorithm for efficiently patrolling a network, in: Proceedings of ANTS'2000, Bruxelles, Belgium (September 2000) pp. 152-155.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yanovski, V., Wagner, I.A. & Bruckstein, A.M. Vertex-Ant-Walk – A robust method for efficient exploration of faulty graphs. Annals of Mathematics and Artificial Intelligence 31, 99–112 (2001). https://doi.org/10.1023/A:1016688707365
Issue Date:
DOI: https://doi.org/10.1023/A:1016688707365