The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Distributed leaderless consensus algorithms for networked Euler–Lagrange systems
Abstract
This article proposes and analyses distributed, leaderless, model-independent consensus algorithms for networked Euler–Lagrange systems. We propose a fundamental consensus algorithm, a consensus algorithm accounting for actuator saturation, and a consensus algorithm accounting for unavailability of measurements of generalised coordinate derivatives, for systems modelled by Euler–Lagrange equations. Due to the fact that the closed-loop interconnected Euler–Lagrange equations using these algorithms are non-autonomous, Matrosov's theorem is used for convergence analysis. It is shown that consensus is reached on the generalised coordinates and their derivatives of the networked Euler–Lagrange systems as long as the undirected communication topology is connected. Simulation results show the effectiveness of the proposed algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 3×
“Current consensus algorithms primarily focus on vehicles with single-integrator kinematics (see Ren, Beard, and Atkins (2007), Olfati-Saber, Fax, and Murray (2007) and references therein), double-inte-grator dynamics (e.g. Lafferriere, Williams, Caughman, and Veerman 2005; Veerman, Lafferriere,…”
BackgroundResultFlocking for Multi-Agent Dynamic Systems: Algorithms and Theory
Olfati-Saber, R. (2006) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2005.864190 · Cited by 5,037
Spong, M. W., Hutchinson, S., & Vidyasagar, M. (2006) · Cited by 3,313
Information consensus in multivehicle cooperative control
(2007) · IEEE Control Systems · doi:10.1109/mcs.2007.338264 · Cited by 3,156
Kronecker Products and Matrix Calculus: With Applications
Graham, A. (1981) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,630
Laplacian matrices of graphs: a survey
Merris, R. (1994) · Linear Algebra and its Applications · doi:10.1016/0024-3795(94)90486-3 · Cited by 1,520
Distributed multi‐vehicle coordinated control via local information exchange
Ren, W., & Atkins, E. (2007) · International Journal of Robust and Nonlinear Control · doi:10.1002/rnc.1147 · Cited by 1,484
Self-citationFlocking in Fixed and Switching Networks
Tanner, H. G., Jadbabaie, A., & Pappas, G. J. (2007) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2007.895948 · Cited by 1,431
On Consensus Algorithms for Double-Integrator Dynamics
Ren, W. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.924961 · Cited by 1,413
Self-citationProceedings of the 45th IEEE Conference on Decision and Control
(2006) · doi:10.1109/cdc10086.2006 · Cited by 968
Cited by
Lyapunov-Based Reinforcement Learning for Decentralized Multi-agent Control
Zhang, Q., Dong, H., & Pan, W. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-64096-5_5 · Cited by 18
Metadata
- Authors
- Ren, W.
- Venue
- International Journal of Control
- Publisher
- Informa UK Limited
- Published
- 2009-09-14
- Volume
- 82
- Issue
- 11
- Pages
- 2137-2149
- ISSN
- 0020-7179 (ISSN-L)
- 1366-5820
- OpenAlex
- W2131189029
- Cited by
- 485
- References
- 19
- FWCI
- 25.70
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Distributed leaderless consensus algorithms for networked Euler–Lagrange systems. https://app.cochat.ai/papers/10.1080/00207170902948027
- The paper
- Ren, W. (2009). Distributed leaderless consensus algorithms for networked Euler–Lagrange systems. International Journal of Control. https://doi.org/10.1080/00207170902948027
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.
