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

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

Removing the Feasibility Conditions Imposed on Tracking Control Designs for State-Constrained Strict-Feedback Systems

Zhao, Kai, Song, Yongduan·2019·IEEE Transactions on Automatic Control

Abstract

For strict-feedback nonlinear systems under full-state constraints, current barrier Lyapunov function (BLF) and integral BLF based control solutions rely on feasibility conditions for virtual controllers. In this work, we present a new solution that completely removes such restrictive conditions. First, we construct a nonlinear state-dependent function that purely depends on constrained states to cope with full state and asymmetric constraints directly; second, we introduce a new coordinate transformation and integrate it into each step of dynamic surface control based backstepping design, completely circumventing the demanding feasibility conditions on virtual controllers. Consequently, there is no need for the tedious offline computations for feasibility verification, allowing the designer more freedom to select design parameters, enabling the system with a larger range of initial conditions to be handled, and rendering the solution more user-friendly in design and implementation. Simulation verification also confirms the benefits and effectiveness of the proposed control method.

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.1109/tac.2018.2845707

Cites

29 of 29 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 29 references

Cited by

See all 565

Metadata

Authors
Zhao, K., & Song, Y.
Venue
IEEE Transactions on Automatic Control
Published
2019-03
Volume
64
Issue
3
Pages
1265-1272
ISSN
  • 0018-9286 (ISSN-L)
  • 1558-2523
  • 2334-3303
OpenAlex
W2805998202
Cited by
565
References
29
FWCI
19.39
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: Removing the Feasibility Conditions Imposed on Tracking Control Designs for State-Constrained Strict-Feedback Systems. https://app.cochat.ai/papers/10.1109/tac.2018.2845707
The paper
Zhao, K., & Song, Y. (2019). Removing the Feasibility Conditions Imposed on Tracking Control Designs for State-Constrained Strict-Feedback Systems. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2018.2845707

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.