The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Optimal Control of Logical Control Networks
Abstract
This paper considers the infinite horizon optimal control of logical control networks, including Boolean control networks as a special case. Using the framework of game theory, the optimal control problem is formulated. In the sight of the algebraic form of a logical control network, its cycles can be calculated algebraically. Then the optimal control is revealed over a certain cycle. When the games, using memory μ >; 1 (which means the players only consider previous μ steps' action at each step), are considered, the higher order logical control network is introduced and its algebraic form is also presented, which corresponds to a conventional logical control network (i.e., μ = 1 ). Then it is proved that the optimization technique developed for conventional logical control networks is also applicable to this μ-memory case.
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
A N EW A PPROACH TO D ECODING L IFE : Systems Biology
Ideker, T., Galitski, T., & Hood, L. (2001) · Annual Review of Genomics and Human Genetics · doi:10.1146/annurev.genom.2.1.343 · Cited by 1,664
Cited by
Controllability and observability of Boolean control networks
Cheng, D., & Qi, H. (2009) · Automatica · doi:10.1016/j.automatica.2009.03.006 · Cited by 770
Self-citation
Metadata
- Authors
- Zhao, Y., Li, Z., & Cheng, D.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 2011-08
- Volume
- 56
- Issue
- 8
- Pages
- 1766-1776
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2113609870
- Cited by
- 262
- References
- 1
- FWCI
- 18.06
- 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: Optimal Control of Logical Control Networks. https://app.cochat.ai/papers/10.1109/tac.2010.2092290
- The paper
- Zhao, Y., Li, Z., & Cheng, D. (2011). Optimal Control of Logical Control Networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/tac.2010.2092290
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.
