The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Formation Control and Network Localization via Orientation Alignment
Abstract
We propose a formation control strategy based on inter-agent displacements for single-integrator modeled agents in the plane. Since the orientations of the local reference frames of the agents are not aligned with each other due to the absence of a common sense of orientation, the proposed strategy consists of an orientation alignment law and a formation control law. Under the proposed strategy, if the interaction graph is uniformly connected and all the initial orientation angles belong to an interval with length less than π, the orientations are exponentially aligned and the formation exponentially converges to the desired formation. We also show that the proposed strategy can be utilized for network localization as a dual problem.
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
Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
Olfati-Saber, R., & Murray, R. M. (2004) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.834113 · Cited by 12,788 · cited 1×
“A consensus protocol for the agents has been proposed in [12], [13] as follows: for all , where , which can be written in a vector form”
BackgroundOn frame and orientation localization for relative sensing networks
Piovan, G., Shames, I., Fidan, B., Bullo, F., & Anderson, B. D. O. (2013) · Automatica · doi:10.1016/j.automatica.2012.09.014 · Cited by 105 · cited 1×
“Though relevant problems have been studied in [8]–[10], position estimation laws were not proposed in [8] and [9], and convergence conditions of the orientations and the”
Background
Cited by
A survey of multi-agent formation control
Oh, K.-K., Park, M.-C., & Ahn, H.-S. (2015) · Automatica · doi:10.1016/j.automatica.2014.10.022 · Cited by 2,457
Self-citationBearing Rigidity and Almost Global Bearing-Only Formation Stabilization
Zhao, S., & Zelazo, D. (2016) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2015.2459191 · Cited by 463
Metadata
- Authors
- Oh, K.-K., & Ahn, H.-S.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2014-02
- Volume
- 59
- Issue
- 2
- Pages
- 540-545
- ISSN
- 0018-9286 (ISSN-L)
- 1558-2523
- 2334-3303
- OpenAlex
- W2016411453
- Cited by
- 184
- References
- 2
- FWCI
- 18.50
- Type
- journal article
- Language
- en
- Open access
- closed
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.