Information Processing Letters
Comparison of initial conditions for distributed algorithms on anonymous networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Discrete Mathematics
An Effective Characterization of Computability in Anonymous Networks
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Agent Rendezvous: A Dynamic Symmetry-Breaking Problem
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Local and global properties in networks of processors (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Deterministic Rendezvous in Graphs
Algorithmica
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
Theory of Computing Systems
Searching for a Black Hole in Synchronous Tree Networks¶
Combinatorics, Probability and Computing
Mobile Search for a Black Hole in an Anonymous Ring
Algorithmica
Hardness and approximation results for Black Hole Search in arbitrary networks
Theoretical Computer Science
Mobile agent algorithms versus message passing algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Searching for black-hole faults in a network using multiple agents
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Optimal memory rendezvous of anonymous mobile agents in a unidirectional ring
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Gathering asynchronous oblivious mobile robots in a ring
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Mobile agent rendezvous in a synchronous torus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Rendezvous of Mobile Agents When Tokens Fail Anytime
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Mobile agent rendezvous in a ring using faulty tokens
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Mapping an unfriendly subway system
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Time optimal algorithms for black hole search in rings
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Tight bounds for scattered black hole search in a ring
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Improving the optimal bounds for black hole search in rings
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Black hole search with finite automata scattered in a synchronous torus
DISC'11 Proceedings of the 25th international conference on Distributed computing
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Asynchronous exploration of an unknown anonymous dangerous graph with o(1) pebbles
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Fault-Tolerant exploration of an unknown dangerous graph by scattered agents
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
| Hi-index | 0.00 |
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (asynchronous anonymous multi-agent) rendezvous problem has been studied extensively but only for networks that are safe or fault-free. In this paper, we consider the case when some of the edges in the network are dangerous or faulty such that any agent travelling along one of these edges would be destroyed. The objective is to minimize the number of agents that are destroyed and achieve rendezvous of all the surviving agents. We determine under what conditions this is possible and present algorithms for achieving rendezvous in such cases. Our algorithms are for arbitrary networks with an arbitrary number of dangerous channels; thus our model is a generalization of the case where all the dangerous channels lead to single node, called the Black Hole. We do not assume prior knowledge of the network topology; In fact, we show that knowledge of only a "tight" bound on the network size is sufficient for solving the problem, whenever it is solvable.