A two-stage method computes relay chains and cluster-visit orders that let large robot teams reach many goals while keeping intermittent connectivity to a base station.
Distributed data gathering with bu ff er constraints and intermit- tent communication,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.RO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Fast and scalable multi-robot deployment planning under connectivity constraints
A two-stage method computes relay chains and cluster-visit orders that let large robot teams reach many goals while keeping intermittent connectivity to a base station.