The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Design of optimal disturbance rejection PID controllers using genetic algorithms
Abstract
This paper presents a method to design an optimal disturbance rejection PID controller. First, a condition for disturbance rejection of a control system-H/sub /spl infin//-norm-is described. Second, the design is formulated as a constrained optimization problem. It consists of minimizing a performance index, i.e., the integral of the time weighted squared error subject to the disturbance rejection constraint. A new method employing two genetic algorithms (GA) is developed for solving the constraint optimization problem. The method is tested by a design example of a PID controller for a servomotor system. Simulation results are presented to demonstrate the performance and validity of the method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Nonlinear programming: theory and algorithms
(1993) · Computers & Operations Research · doi:10.1016/0305-0548(93)90042-h · Cited by 5,779
PID Controllers: Theory, Design, and Tuning
Åström, K. J., & Hägglund, T. J. (1995) · Lund University Publications (Lund University) · Cited by 4,741
Doyle, J. C., Francis, B. A., & Tannenbaum, A. (1992) · Cited by 3,085
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1994) · Springer eBooks · doi:10.1007/978-3-662-07418-3 · Cited by 2,158
Evolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536 · cited 1×
“Representation In the real-coded representation, each individual is coded as a vector of floating-point numbers (a similar approach could be taken with evolution strategies or evolutionary programming [9]).”
BackgroundNonlinear Programming — Theory and Algorithms
Ovuworie, G. C. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.231 · Cited by 1,182
Cited by
A Particle Swarm Optimization Approach for Optimum Design of PID Controller in AVR System
Gaing, Z.-L. (2004) · IEEE Transactions on Energy Conversion · doi:10.1109/tec.2003.821821 · Cited by 1,774
Das, D. C., Roy, A. K., & Sinha, N. (2012) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2012.05.025 · Cited by 522
A hybrid genetic algorithm and bacterial foraging approach for global optimization
Kim, D. H., Abraham, A., & Cho, J. H. (2007) · Information Sciences · doi:10.1016/j.ins.2007.04.002 · Cited by 469
Krohling, R. A., & dos Santos Coelho, L. (2006) · IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics) · doi:10.1109/tsmcb.2006.873185 · Cited by 326
Self-citationA Fuzzy Logic Controller tuned with PSO for 2 DOF robot trajectory control
Bingül, Z., & Karahan, O. (2011) · Expert Systems with Applications · doi:10.1016/j.eswa.2010.07.131 · Cited by 254
Metadata
- Authors
- Krohling, R. A., & Rey, J. P.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2001
- Volume
- 5
- Issue
- 1
- Pages
- 78-82
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2168013035
- Cited by
- 418
- References
- 7
- FWCI
- 10.97
- 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
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.