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

The DOI matches its Crossref record.

Minimum attention control

Brockett, W.·2002·Proceedings of the 36th IEEE Conference on Decision and Control

Abstract

In this paper we consider the question of how to trade-off the complexity of implementing a control law against the performance of the control system. We propose a measure of complexity and formulate optimization problems involving both a measure of the desirability of the trajectories and the difficulty of implementing the control law. By introducing criteria of the type proposed here it is possible to strike a balance between the performance of the system and the difficulty involved in implementing the control. The optimization problems coming from this formulation are similar to those arising in the variational description of fields in physics.

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/cdc.1997.657776

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.

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 170

Metadata

Authors
Brockett, W.
Venue
Proceedings of the 36th IEEE Conference on Decision and Control
Publisher
IEEE
Published
2002-11-23
Volume
3
Pages
2628-2632
ISSN
0191-2216 (ISSN-L)
OpenAlex
W2155219617
Cited by
170
References
0
FWCI
15.08
Type
conference paper
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: Minimum attention control. https://app.cochat.ai/papers/10.1109/cdc.1997.657776
The paper
Brockett, W. (2002). Minimum attention control. Proceedings of the 36th IEEE Conference on Decision and Control. https://doi.org/10.1109/cdc.1997.657776

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.