CoChat

A Decentralized Cluster Formation Containment Framework for Multirobot Systems

Open access
Hu, Junyan, Bhowmick, Parijat, Jang, Inmo, Arvin, Farshad, Lanzon, Alexander · 2021 · IEEE Transactions on Robotics
Cited by 159

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

Abstract

Cooperative control of multirobot systems (MRSs) has earned significant research interest over the past two decades due to its potential applications in multidisciplinary engineering problems. In contrast to a single specialized robot, the MRS can be designed to offer flexibility, reconfigurability, robustness to faults, and cost-effectiveness in solving complex and challenging tasks. In this article, we aim to develop a unified cluster formation containment coordination framework for networked robots that can be decomposed into two layers containing the leaders and the followers. According to the proposed methodology, the leader robots are first distributed into a set of distinct and nonoverlapping clusters depending on the positions and priorities of the targets exploiting a game-theoretic rule. Then, they are steered to attain the desired formations around the corresponding targets. Subsequently, the follower robots are made to converge into the convex hull spanned by the leaders of the individual clusters. A prototype search and rescue operation is considered to highlight the usefulness of the proposed coordination framework. Furthermore, real-time hardware experiments were conducted on miniature mobile robots to validate the feasibility of the theoretical results.

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.1109/tro.2021.3071615

Cites

1 of 1 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

Cited by

See all 159

Metadata

Authors
Hu, J., Bhowmick, P., Jang, I., Arvin, F., & Lanzon, A.
Venue
IEEE Transactions on Robotics
Published
2021-12
Volume
37
Issue
6
Pages
1936-1955
ISSN
  • 1552-3098 (ISSN-L)
  • 1941-0468
OpenAlex
W3153865577
Cited by
159
References
1
FWCI
11.24
Type
journal article
Language
en
Open access
hybrid

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

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.