Name
Abstract | ||
|---|---|---|
A common assumption made in multi-robot research is that robots operate in a fully networked environment, where any two robots can communicate reliably at any time. However, in real-world missions over large geographical areas robots have a limited communication range and signal propagation conditions may be unpredictable due to obstacles or interferences. In such cases, communication limitations must be taken explicitly into account. In this paper, we present a multi-robot routing algorithm for dense environments under limited communication range. We focus on the aspect of careful mission planning in order to guarantee continuous connectivity and mission completeness, while offering a guarantee on performance under a variety of team objectives. The proposed algorithms are demonstrated in a large-scale domain using realistic simulations on the Player/Stage platform. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-642-00644-9_43 | DISTRIBUTED AUTONOMOUS ROBOTIC SYSTEMS 8 |
Field | DocType | Citations |
Multipath routing,Link-state routing protocol,Dynamic Source Routing,Static routing,Computer science,Policy-based routing,Routing domain,Geographic routing,Distributed computing,Routing protocol | Conference | 8 |
PageRank | References | Authors |
0.59 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alejandro R. Mosteo | 1 | 33 | 4.33 |
| Luis Montano | 2 | 54 | 5.24 |
| Michail G. Lagoudakis | 3 | 1164 | 79.51 |