CoChat

A passivity-based decentralized strategy for generalized connectivity maintenance

Open access
Robuffo Giordano, Paolo, Franchi, Antonio, Secchi, Cristian, Bülthoff, Heinrich H · 2013 · The International Journal of Robotics Research
Cited by 169

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

The design of decentralized controllers coping with the typical constraints on the inter-robot sensing/communication capabilities represents a promising direction in multi-robot research thanks to the inherent scalability and fault tolerance of these approaches. In these cases, connectivity of the underlying interaction graph plays a fundamental role: it represents a necessary condition for allowing a group or robots to achieve a common task by resorting to only local information. The goal of this paper is to present a novel decentralized strategy able to enforce connectivity maintenance for a group of robots in a flexible way, that is, by granting large freedom to the group internal configuration so as to allow establishment/deletion of interaction links at anytime as long as global connectivity is preserved. A peculiar feature of our approach is that we are able to embed into a unique connectivity preserving action a large number of constraints and requirements for the group: (i) the presence of specific inter-robot sensing/communication models; (ii) group requirements such as formation control; and (iii) individual requirements such as collision avoidance. This is achieved by defining a suitable global potential function of the second smallest eigenvalue λ 2 of the graph Laplacian, and by computing, in a decentralized way, a gradient-like controller built on top of this potential. Simulation results obtained with a group of quadrotor unmanned aerial vehicles (UAVs) and unmanned ground vehicles, and experimental results obtained with four quadrotor UAVs, are finally presented to thoroughly illustrate the features of our approach on a concrete case study.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1177/0278364912469671

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Consensus and Cooperation in Networked Multi-Agent Systems

    Olfati-Saber, R., Fax, J. A., & Murray, R. M. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887293 · Cited by 10,522 · cited 2×

    “Among them, connectivity of the graph is perhaps the most ‘fundamental requirement’ in order to allow a group of robots accomplishing common goals by means of decentralized solutions (examples in this sense are given by consensus [9], rendezvous [10], flocking [11], leaderfollower [12], and similar cooperative tasks).”
    Background
  • Graph Theoretic Methods in Multiagent Networks

    Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 2×

    “For a more comprehensive treatment, we refer the interested reader to any of the existing books on this topic, for instance Mesbahi and Egerstedt (2010). Let G = (V , E) be an undirected graph with vertex set V = {1 .”
    Method

Show all 2 references

Cited by

See all 169

Metadata

Authors
Robuffo Giordano, P., Franchi, A., Secchi, C., & Bülthoff, H. H.
Venue
The International Journal of Robotics Research
Published
2013-03
Volume
32
Issue
3
Pages
299-323
ISSN
  • 0278-3649 (ISSN-L)
  • 1741-3176
OpenAlex
W2063596703
Cited by
169
References
2
FWCI
19.38
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A passivity-based decentralized strategy for generalized connectivity maintenance. https://app.cochat.ai/papers/10.1177/0278364912469671
The paper
Robuffo Giordano, P., Franchi, A., Secchi, C., & Bülthoff, H. H. (2013). A passivity-based decentralized strategy for generalized connectivity maintenance. The International Journal of Robotics Research. https://doi.org/10.1177/0278364912469671

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.