Sciweavers

SPAA
2010
ACM
14 years 4 months ago
Delays induce an exponential memory gap for rendezvous in trees
The aim of rendezvous in a graph is meeting of two mobile agents at some node of an unknown anonymous connected graph. The two identical agents start from arbitrary nodes in the g...
Pierre Fraigniaud, Andrzej Pelc
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
14 years 5 months ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
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 (a...
Jérémie Chalopin, Shantanu Das, Nico...
CDC
2008
IEEE
126views Control Systems» more  CDC 2008»
14 years 6 months ago
Rendezvous under noisy measurements
— We describe a distributed algorithm for solving the rendezvous problem based on consensus protocols. We extend our previous work by considering the case when the evolution of t...
Carlos H. Caicedo-Nunez, Milos Zefran