Vertex-Ant-Walk – A robust method for efficient exploration of faulty graphs

Authors:
Vladimir Yanovski;Israel A. Wagner;Alfred M. Bruckstein
Affiliations:
Computer Science Department, Technion IIT, Haifa 32000, Israel;Computer Science Department, Technion IIT, Haifa 32000, Israel, IBM Haifa Research Laboratory, MATAM, Haifa 31905, Israel;Computer Science Department, Technion IIT, Haifa 32000, Israel
Venue:
Annals of Mathematics and Artificial Intelligence
Year:
2001

Citing 4
Cited 9

Real-time heuristic search

Artificial Intelligence
Ants: agents on networks, trees, and subgraphs

Future Generation Computer Systems
Graph Algorithms

Graph Algorithms
Efficient and inefficient ant coverage methods

Annals of Mathematics and Artificial Intelligence

A biological programming model for self-healing

Proceedings of the 2003 ACM workshop on Survivable and self-regenerative systems: in association with 10th ACM Conference on Computer and Communications Security
Multi-agent Physical A* with Large Pheromones

Autonomous Agents and Multi-Agent Systems
Cooperative Cleaners: A Study in Ant Robotics

International Journal of Robotics Research
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts

International Journal of Robotics Research
Of robot ants and elephants

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
PHA*: finding the shortest path with A* in an unknown physical environment

Journal of Artificial Intelligence Research
Multi-agent Cooperative Cleaning of Expanding Domains

International Journal of Robotics Research
Review: Of robot ants and elephants: A computational comparison

Theoretical Computer Science
Covering a continuous domain by distributed, limited robots

ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.