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

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

State Agreement for Continuous‐Time Coupled Nonlinear Systems

Lin, Zhiyun, Francis, Bruce, Maggiore, Manfredi·2007·SIAM Journal on Control and Optimization

Abstract

Two related problems are treated in continuous time. First, the state agreement problem is studied for coupled nonlinear differential equations. The vector fields can switch within a finite family. Associated to each vector field is a directed graph based in a natural way on the interaction structure of the subsystems. Generalizing the work of Moreau, under the assumption that the vector fields satisfy a certain subtangentiality condition, it is proved that asymptotic state agreement is achieved if and only if the dynamic interaction digraph has the property of being sufficiently connected over time. The proof uses nonsmooth analysis. Second, the rendezvous problem for kinematic point‐mass mobile robots is studied when the robots’ fields of view have a fixed radius. The circumcenter control law of Ando et al. [IEEE Trans. Robotics Automation, 15 (1999), pp. 818–828] is shown to solve the problem. The rendezvous problem is a kind of state agreement problem, but the interaction structure is state dependent.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/050626405

Cites

2 of 2 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.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Show all 2 references

Cited by

See all 508

Metadata

Authors
Lin, Z., Francis, B., & Maggiore, M.
Venue
SIAM Journal on Control and Optimization
Published
2007-01
Volume
46
Issue
1
Pages
288-307
ISSN
  • 0363-0129 (ISSN-L)
  • 1095-7138
OpenAlex
W2024571424
Cited by
508
References
2
FWCI
33.98
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: State Agreement for Continuous‐Time Coupled Nonlinear Systems. https://app.cochat.ai/papers/10.1137/050626405
The paper
Lin, Z., Francis, B., & Maggiore, M. (2007). State Agreement for Continuous‐Time Coupled Nonlinear Systems. SIAM Journal on Control and Optimization. https://doi.org/10.1137/050626405

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.