Multivariable Unconstrained Pattern Search Method for Optimizing Digital PID Controllers Applied to Isolated Forward Converter
Bibliographic record
Abstract
Most of the traditional PID tuning methods are heuristic in nature. The heuristic approach-based tuned PID controllers show only nominal performance. In addition, in the case of a digital redesign approach, mapping of the heuristically-designed continuous-time PID controllers into discrete-time PID controllers and in case of the direct digital design approach, mapping of the continuous-time plant (forward converter) into the discrete-time plant, results in frequency distortion (or warping). Besides this, nonlinear elements such as ADC and DAC, and delay in the digital control loop deteriorate the control performance. There is a need to tune conventionally-designed digital controllers to enhance performance. This paper proposes optimized discrete-time PID controllers for a forward DC–DC converter operating in continuous conduction mode (CCM). The considered conventional digital PID controllers designed on the basis of the digital redesign and direct digital approaches are tuned by one of the multivariable unconstrained pattern search methods named Hooke–Jeeves (H–J) search method to ensure excellent output voltage regulation performance against the changes in input voltage and load current. Numerical results show that the H–J-based optimized PID compensated forward converter system shows tremendous improvement in performance compared to its unoptimized counterpart and simulated annealing (SA)-based compensated system, thus justifying the applicability of the H–J method for enhancing the performance.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".