Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 205

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

Fully distributed flocking with a moving leader for Lagrange networks with parametric uncertainties

Open access
Ghapani, Sheida, Mei, Jie, Ren, Wei, Song, Yongduan · 2016 · Automatica

Abstract

This paper addresses the leader-follower flocking problem with a moving leader for networked Lagrange systems with parametric uncertainties under a proximity graph. Here a group of followers move cohesively with the moving leader to maintain connectivity and avoid collisions for all time and also eventually achieve velocity matching. In the proximity graph, the neighbor relationship is defined according to the relative distance between each pair of agents. Each follower is able to obtain information from only the neighbors in its proximity, involving only local interaction. We consider two cases: (i) the leader moves with a constant velocity, and (ii) the leader moves with a varying velocity. In the first case, a distributed continuous adaptive control algorithm accounting for unknown parameters is proposed in combination with a distributed continuous estimator for each follower. In the second case, a distributed discontinuous adaptive control algorithm and estimator are proposed. Then the algorithm is extended to be fully distributed with the introduction of gain adaptation laws. In all proposed algorithms, only one-hop neighbors' information (e.g., the relative position and velocity measurements between the neighbors and the absolute position and velocity measurements) is required, and flocking is achieved as long as the connectivity and collision avoidance are ensured at the initial time and the control gains are designed properly. Numerical simulations are presented to illustrate 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.1016/j.automatica.2016.01.004

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

Cited by

See all 205

Metadata

Authors
Ghapani, S., Mei, J., Ren, W., & Song, Y.
Venue
Automatica
Publisher
Elsevier BV
Published
2016-05
Volume
67
Pages
67-76
ISSN
0005-1098 (ISSN-L)
OpenAlex
W2228328747
Cited by
205
References
1
FWCI
21.48
Type
journal article
Language
en
Open access
bronze

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: Fully distributed flocking with a moving leader for Lagrange networks with parametric uncertainties. https://app.cochat.ai/papers/10.1016/j.automatica.2016.01.004
The paper
Ghapani, S., Mei, J., Ren, W., & Song, Y. (2016). Fully distributed flocking with a moving leader for Lagrange networks with parametric uncertainties. Automatica. https://doi.org/10.1016/j.automatica.2016.01.004

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.