Name
Abstract | ||
|---|---|---|
In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower bounds as well as some necessary conditions. We also propose an algorithm that is asymptotically optimal in both space and round complexities. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1142/S012905411100860X | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE |
Keywords | Field | DocType |
Autonomous agents, mobile robot networks, optimality, rendezvous | Discrete mathematics,Graph,Combinatorics,Autonomous agent,Spacetime,Rendezvous,Connectivity,Asymptotically optimal algorithm,Mathematics,Finite time | Journal |
Volume | Issue | ISSN |
22 | 5 | 0129-0541 |
Citations | PageRank | References |
0 | 0.34 | 14 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fabienne Carrier | 1 | 15 | 1.97 |
| Stéphane Devismes | 2 | 192 | 25.74 |
| Franck Petit | 3 | 736 | 60.02 |
| Yvan Rivierre | 4 | 34 | 4.69 |