Bearing-Based Formation Control of A Group of Agents with Leader-First Follower Structure
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
This paper studies bearing-based formation control of a group of autonomous agents with the leader-first follower (LFF) structure in an arbitrary dimensional space. First, the bearing-based Henneberg construction and some properties of the LFF formation are introduced. Then, we propose and analyze bearing-only control laws that almost globally stabilize LFF formations to a desired formation. Further strategies to rotate and rescale the target formation are also discussed. Finally, simulation results are provided to support the analysis.
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.
Integrity signals
Registry
Cites
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.
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
Graph Theoretic Methods in Multiagent Networks
Mesbahi, M., & Egerstedt, M. (2010) · Princeton University Press eBooks · doi:10.1515/9781400835355 · Cited by 2,897 · cited 1×
“For an acyclic directed graph, we define the parent set of a vertex vi as Pi = {vk| ∃ a directed path from vk to vi} [37].”
Metadata
- Authors
- Trinh, M. H., Zhao, S., Sun, Z., Zelazo, D., Anderson, B. D. O., & Ahn, H.-S.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2018
- Pages
- 1-1
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- OpenAlex
- W2796974626
- Cited by
- 178
- References
- 1
- FWCI
- 10.74
- 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
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.