<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>Scenario Quantile Predictive Control of Bioreactor Cultivation under Kinetic Parameter Uncertainty</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Abdelrahman</surname><given-names>Tarek</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Müller</surname><given-names>Wolfgang H.</given-names></name><xref ref-type="aff" rid="aff2"/></contrib>
<contrib contrib-type="author"><name><surname>Nasef</surname><given-names>Arafa Abdelzaher</given-names></name><xref ref-type="aff" rid="aff3"/></contrib>
<aff id="aff1">Department of Electrical Power and Machines Engineering, Faculty of Engineering, Ain Shams University, Cairo, Egypt.</aff>
<aff id="aff2">Department of Computer Science, Technical University of Munich, Munich, Germany.</aff>
<aff id="aff3">Department of Engineering, Kafrelsheikh University, Egypt.</aff>
</contrib-group>
<abstract><p>Bioreactor feeding requires a balance between product formation, substrate limits, and uncertain kinetics. This study examines an empirical scenario-quantile model predictive controller that constrains an order statistic of predicted substrate concentrations and adds a quadratic exceedance penalty. The reported simulation campaign uses a constant-volume, three-state continuous-culture surrogate with Monod growth, product inhibition, Luedeking–Piret product formation, and six lognormally dispersed kinetic parameters. Thirty parameter draws crossed with five process-noise seeds give 150 paired runs per controller. The proposed controller has a reported final titer of 5.049 ± 1.593 g/L and a pooled step violation frequency of 4.9%, compared with 2.788 ± 1.130 g/L for Open-Loop (OL) nominal optimization, 4.798 ± 1.516 g/L for Proportional–Integral (PI) control, 4.913 ± 1.506 g/L for fixed-margin Model Predictive Control (MPC), 5.044 ± 1.545 g/L for nominal MPC, and 5.059 ± 1.576 g/L for hard-scenario MPC. The hard-scenario controller has fewer observed violations, while an 80/90/95% order-statistic ablation changes violation frequencies from 7.9% to 2.9% with small mean-titer differences. These observations support a tunable empirical risk mechanism at the tested scale. They establish neither a finite-sample chance-constraint guarantee nor a joint batch safety guarantee. Inference, changing-volume fed-batch dynamics, and structural model error remain outside the executed comparison; the nested simulation design also limits interpretation of the reported run-level significance tests.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Empirical quantile control</kwd><kwd>Model predictive control</kwd><kwd>Kinetic parameter uncertainty</kwd><kwd>Continuous</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1">
<p>culture, Scenario optimization, Bioprocess simulation.</p>
</sec>
<sec id="sec-2"><label>1</label><title>Introduction</title>
<p>Feeding policy links bioreactor kinetics to operational objectives. Monod kinetics describe substrate-limited growth <xref ref-type="bibr" rid="ref-1">[1]</xref>, while the Andrews model incorporates substrate inhibition <xref ref-type="bibr" rid="ref-2">[2]</xref>. These mechanisms motivate control of substrate concentration, but a substrate ceiling is a biological inhibition limit only when the organism and kinetic model support that interpretation. The present study examines uncertain-parameter predictive control in a simulation whose substrate ceiling is an operational guard rather than an identified inhibition threshold.</p>
<p>Dynamic optimization provides a computational basis for selecting cultivation trajectories, including path-constrained nonlinear bioprocess models <xref ref-type="bibr" rid="ref-3">[3]</xref>. A nominal trajectory uses one kinetic parameter vector; changing that vector can alter both productivity and constraint satisfaction. The resulting sensitivity motivates feedback and explicit uncertainty propagation, without implying that every parameter perturbation causes a violation.</p>
<p>Model Predictive Control (MPC) repeatedly solves a finite-horizon problem using updated state information. Established stability and feasibility results require stated model, terminal, and disturbance assumptions <xref ref-type="bibr" rid="ref-4">[4]</xref>. Stochastic MPC instead introduces probability models and violation budgets <xref ref-type="bibr" rid="ref-5">[5]</xref>. The present implementation uses scenario predictions and local nonlinear optimization; its constraint behavior is assessed empirically rather than inferred from a general MPC stability theorem.</p>
<p>Bioprocess estimation can supply kinetic information for a controller <xref ref-type="bibr" rid="ref-6">[6]</xref>. Here the controller receives samples from a specified kinetic distribution, and a paired simulation design compares the influence of uncertainty representation on titer and substrate excursions. This isolates the control layer: Bayesian parameter learning and uncertainty calibration from sparse assays are proposed extensions rather than tested components. The contribution is an empirical order-statistic controller with an explicit quantile level and exceedance penalty, evaluated against Open-Loop (OL) optimization, Proportional–Integral (PI) control, nominal MPC, hard-scenario MPC, and fixed-margin MPC under common simulated parameter and noise realizations. The comparison reports final titer, productivity, pooled step violations, runs with any violation, lower-tail titer, and solve time. A quantile-level ablation assesses how the chosen order statistic changes observed constraint behavior.</p>
<p>The implementation uses warm-started Sequential Least Squares Quadratic Programming (SLSQP) single shooting. Its measured solve time describes the stated simulator and hardware campaign, while the distinction between empirical violation frequencies and probabilistic guarantees governs interpretation of the results. Section 2 places the construction within bioprocess optimization and stochastic control. Sections 3 and 4 define the model, objectives, and implemented scenario mechanism. Section 5 presents the reported paired simulation results, and Sections 6 and 7 discuss their scope and the next validation steps.</p>
</sec>
<sec id="sec-3"><label>2</label><title>Related Work</title>
<sec id="sec-4"><label>2.1</label><title>Optimal Control of Cultivation Processes</title>
<p>Bioprocess trajectory optimization combines kinetic models, product-formation laws, and path constraints. Numerical methods for these problems are reviewed by Banga and co-workers <xref ref-type="bibr" rid="ref-3">[3]</xref>. The growth-associated and non-growth-associated terms of the Luedeking–Piret law provide a conventional product model <xref ref-type="bibr" rid="ref-8">[7]</xref>. Their use here specifies a simulator architecture; the nominal coefficients are study settings and are not estimates for a named organism.</p>
</sec>
<sec id="sec-5"><label>2.2</label><title>Model Predictive, Robust, and Stochastic Control</title>
<p>Constrained MPC supplies a receding-horizon optimization framework <xref ref-type="bibr" rid="ref-4">[4]</xref>, while stochastic MPC makes the probability model and constraint budget explicit <xref ref-type="bibr" rid="ref-5">[5]</xref>. The scenario approach yields probabilistic results for specified classes of sampled optimization problems, with assumptions and sample requirements tied to those results <xref ref-type="bibr" rid="ref-9">[8]</xref>. Those results do not automatically certify a nonconvex order-statistic program solved locally and reused in closed loop. The construction evaluated here therefore distinguishes its probability target from its empirical planning surrogate.</p>
<p>At the tested scale, tractability depends on horizon length, number of scenarios, and nonlinear-solver behavior. Warm starts reduce repeated optimization effort, but a comparison of one nominal model with ten scenarios is not a controlled scaling experiment.</p>
</sec>
<sec id="sec-6"><label>2.3</label><title>Parameter Uncertainty and Estimation in Bioprocesses</title>
<p>Kinetic estimation and adaptive bioreactor control have an established literature <xref ref-type="bibr" rid="ref-6">[6]</xref>. Bayesian inference provides a distribution over uncertain parameters <xref ref-type="bibr" rid="ref-10">[9]</xref>, and sequential Monte Carlo supplies one possible update mechanism <xref ref-type="bibr" rid="ref-11">[10]</xref>. A learned distribution requires an explicit likelihood, assay design, identifiability assessment, and predictive checks. None of these inference steps is exercised in the reported campaign, which samples a known simulation law.</p>
</sec>
<sec id="sec-7"><label>2.4</label><title>Synthesis and Research Gap</title>
<p>The present study connects uncertain kinetics to predictive substrate control through an empirical quantile constraint. Its contribution is the paired comparison and quantile ablation under a specified simulator, rather than a claim that posterior-aware bioprocess control has no precedent. <xref ref-type="table" rid="tab1">Table 1</xref> distinguishes the assumptions of established control families from the empirical status of this implementation.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>Control-design landscape for cultivation under kinetic parameter uncertainty.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:2:62.4,236.2,537.1,515.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
</sec>
<sec id="sec-8"><label>3.1</label><title>Research Questions and Hypotheses</title>
<p>The study asks how scenario-based kinetic uncertainty affects the productivity–violation trade-off and whether the resulting optimization is inexpensive at the tested horizon. The questions below distinguish a design target from an observed result.</p>
<p>RQ1: Can an empirical scenario quantile provide a tunable substrate-risk mechanism in the reported simulator, and how does its observed violation frequency relate to the nominal probability target?</p>
<p>RQ2: How do titer and substrate excursions differ among the six controllers under paired parameter draws and process-noise seeds?</p>
<p>RQ3: What solve-time budget is observed for the stated horizon and scenario count?</p>
<p>The titer hypothesis compares the quantile controller with the fixed-margin controller, while the risk hypothesis examines whether a higher scenario order statistic reduces observed violations. The computation hypothesis concerns the measured budget at the executed scale.</p>
</sec>
<sec id="sec-9"><label>3.2</label><title>System Model and Notation</title>
<p>The general fed-batch model has biomass, substrate, and product concentrations together with culture volume, x = (X, S, P, V) and a clean feed of rate F and substrate concentration S_in. Eq. (1) includes the dilution of biomass and product caused by increasing volume. The illustrative inhibited growth law in Eq. (2) uses θ = (μ_max, K_S, K_I, K_P, Y, a, b). The executed comparison instead uses the constant-volume system of Eq. (6), a six-parameter law without substrate inhibition. <xref ref-type="table" rid="tab2">Table 2</xref> separates the physical quantities from the controller settings.</p>
<table-wrap id="tab2"><label>Table 2</label><caption><p>Notation for the robust cultivation control problem.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:3:66,385.7,537.1,589.9"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
</sec>
<sec id="sec-10"><label>3.3</label><title>Formal Problem Statement</title>
<p>At each control cycle, the ideal stochastic program of Eq. (4) balances an expected objective with marginal state constraints of Eq. (3). Its probability must cover the parameter and disturbance laws used to describe the plant. A joint path requirement would instead constrain the event that all inequalities hold simultaneously and would need a separate batch or horizon risk budget. The reported controller approximates the marginal target using deterministic parameter scenarios; it does not solve the ideal program exactly.</p>
<p>dX F = (μ − )X, dt V dS μX F = − + (Sin − S), dt Y V dP F = (aμ + b)X − P, dt V dV = F.</p>
<p>dt S KP</p>
<p>μ(S, P) = μmax S2 · KP + P. (2)</p>
<p>KS + S + K</p>
<p>Prθ,w{gj(xk+ℓ) ≤ 0} ≥ 1 − εj, for each l and j. (3) minF Eθ,w[J(x, F; θ, w)], subject to (1), (3), 0 ≤ F ≤ Fmax, V ≤ Vmax.</p>
<p>Π(θ | y) ∝ p(y | θ)p0(θ). (5)</p>
</sec>
</sec>
<sec id="sec-11"><label>4</label><title>Proposed Methodology</title>
<sec id="sec-12"><label>4.1</label><title>Posterior Construction for Kinetic Parameters</title>
<p>A posterior-informed implementation would combine a kinetic likelihood with prior information and update it when assays become available <xref ref-type="bibr" rid="ref-10">[9]</xref>, <xref ref-type="bibr" rid="ref-11">[10]</xref>. Such a layer would need parameter identifiability and posterior-predictive checks before its uncertainty could support a control decision. The executed study uses a specified lognormal law directly and contains no assay-driven inference. This distribution is therefore a known simulation input, not an estimated posterior.</p>
</sec>
<sec id="sec-13"><label>4.2</label><title>Scenario-Based Chance-Constrained MPC</title>
<p>At every control cycle, the implemented controller propagates ten deterministic parameter scenarios over the prediction horizon. The scenario set is drawn once per run and reused, as described in Section 5.1. For each horizon step, the ninth ordered substrate prediction must not exceed the ceiling; a quadratic mean-exceedance penalty also enters the objective. This is an empirical nearest-rank 90% planning rule. It permits one of ten scenarios to exceed the ceiling and provides no established 90% population coverage guarantee. The convex scenario results of <xref ref-type="bibr" rid="ref-9">[8]</xref> require assumptions and sample bounds that have not been established for this locally solved nonlinear quantile program.</p>
<p>The scenario order statistic is applied separately at each predicted step. A pointwise scenario constraint does not certify the simultaneous event over the full horizon or batch, and process noise is absent from the planning scenarios. The empirical step and run violation summaries in Section 5 measure these distinct effects. They are diagnostics of the chosen design, not substitutes for a closed-loop probabilistic proof.</p>
</sec>
<sec id="sec-14"><label>4.3</label><title>Comparison Controllers</title>
<p>The nominal MPC benchmark uses one nominal kinetic vector. Hard-scenario MPC enforces the substrate ceiling for every sampled parameter vector. The fixed-margin benchmark, labelled tube-lite in the reported tables and figure, is nominal MPC with a 15% substrate back-off. It contains no propagated tube, affine disturbance feedback, or min-max optimization. Its zero observed violations must therefore be interpreted as a result of this campaign, not as recursive feasibility or worst-case safety.</p>
</sec>
<sec id="sec-15"><label>4.4</label><title>Numerical Implementation</title>
<p>The executed controllers share explicit-Euler prediction and warm-started SLSQP single shooting through SciPy <xref ref-type="bibr" rid="ref-16">[15]</xref>. These are locally solved nonlinear programs <xref ref-type="bibr" rid="ref-12">[11]</xref>; global optimality and recursive feasibility are not established. Previous control blocks initialize the next solve. Reproducible implementation requires the exact objective and terminal surrogate, control-block parameterization, stopping tolerances, unsuccessful-solve policy, and timing protocol. The reported aggregate solve times appear in Section 5.2.</p>
</sec>
<sec id="sec-16"><label>4.5</label><title>Constraint Handling, Complexity, and Failure Modes</title>
<p>The general design distinguishes actuator and vessel limits from recoverable state limits. Its executed instantiation constrains only the dilution-rate actuator and substrate ceiling. Increasing the number of scenario rollouts adds prediction work, but nonlinear-solver iterations also affect total cost. Prior misspecification, poor identifiability, and structural model error are validation concerns for a future learned-parameter implementation; this campaign does not quantify them.</p>
<p>The actuator constraint is 0 ≤ F ≤ F_max in the general fed-batch model and 0 ≤ u ≤ 0.5 h⁻¹ in the executed constant-volume model. The volume ceiling V ≤ V_max belongs to the general model and is inactive in the</p>
</sec>
</sec>
<sec id="sec-17"><title>experiment.</title>
<p>The substrate ceiling S ≤ S_sup is the general risk constraint. The executed value S_max = 4.0 g/L is an operational guard; Eq. (6) contains no substrate-inhibition term. A product guard P ≤ P_crit or a terminal biomass requirement X(T) ≥ X_min could be added, but neither is tested here.</p>
<p>Algorithm 1. Empirical scenario quantile MPC used in the simulation.</p>
<p>Input: Eq. (6), current full state, fixed run-level parameter scenarios, horizon H, actuator limits, substrate ceiling, order-statistic level, and penalty coefficient.</p>
<p>Initialize the scenario set and the warm-start control blocks at run start.</p>
<p>At each step, read the simulated full state and propagate every scenario under candidate control blocks.</p>
<p>Enforce actuator bounds and the selected substrate order statistic at each predicted step.</p>
<p>Optimize the mean scenario objective with the quadratic exceedance penalty using warm-started SLSQP.</p>
<p>Apply the first control move, shift the control blocks, and record solve time and realized substrate excursions. Repeat to T and summarize titer and violations. State estimation, posterior learning, volume constraints, and guarantees of successful or safe fallback are outside the executed algorithm.</p>
</sec>
<sec id="sec-18"><label>5</label><title>Experimental Results and Analysis</title>
<sec id="sec-19"><label>5.1</label><title>Experimental Setup</title>
<p>The reported campaign instantiates the control design on a constant-volume, three-state bioreactor surrogate with x = (X, S, P) and manipulated dilution rate 0 ≤ u ≤ 0.5 h⁻¹. The dilution losses in Eq. (6) correspond to a well-mixed continuous-culture model with equal inflow and outflow. They do not describe a changing-volume fed-batch vessel. Growth follows Monod kinetics <xref ref-type="bibr" rid="ref-1">[1]</xref> with multiplicative product inhibition, and product formation uses the Luedeking–Piret structure <xref ref-type="bibr" rid="ref-8">[7]</xref>:</p>
<p>dX = (μ − u)X, dt dS μX = u(Sin − S) − , dt Y</p>
<p>dP (6)</p>
<p>= (βμ + γ)X − uP, dt</p>
<p>μ = μmax .</p>
<p>KS + S P KP The stated discretization is explicit Euler with Δt = 0.2 h for 60 steps, giving T = 12.0 h. The feed concentration is S_in = 20.0 g/L and x₀ = (0.2, 2.0, 0.0) g/L. Nominal coefficients are μ_max = 0.4 h⁻¹, K_S = 0.8 g/L, Y = 0.5 g/g, β = 1.5 g/g, γ = 0.02 g/(g h), and K_P = 6.0 g/L. The substrate ceiling is 4.0 g/L with a nominal 0.9 marginal probability target. Volume, product, and terminal biomass guards are inactive. Because Eq. (6) has no Andrews term <xref ref-type="bibr" rid="ref-2">[2]</xref>, the ceiling does not mark a modeled transition into substrate inhibition.</p>
<p>The six parameters follow the study-selected law θ = θ_nom exp(0.2z), z ~ N(0,I₆), independently by component. The nominal vector is the median, not the mean; each component has coefficient of variation √(exp(0.04) − 1), approximately 20.2%. Evaluation crosses 30 parameter draws with five process-noise seeds. Within each of the 150 cells, controllers use the same true parameter vector and noise realization. Additive per-step Gaussian noise has standard deviations (0.01, 0.01, 0.02) g/L, followed by truncation at zero. The two scenario controllers share ten planning parameter draws sampled once per run. A violation is S &gt; 4.0 g/L at a sampled step. The campaign reports a total runtime of 168.2 s on a desktop Central Processing Unit (CPU).</p>
<p>OL control solves the nominal single-shooting program once (reported solve time 114 ms) with four 15-step constant-control segments, producing u = (0.036, 0.019, 0.250, 0.150) h⁻¹. PI control <xref ref-type="bibr" rid="ref-17">[16]</xref> tracks 3.9 g/L with conditional integration; K_p = 0.2 and K_i = 0.005 were selected from a stated 5 × 5 nominal-plant search. Nominal MPC uses H = 10 steps and two control blocks. Hard-scenario MPC (SMPC) enforces the maximum substrate prediction over ten scenarios. The proposed quantile MPC (CCMPC) uses the ninth order statistic and a quadratic mean squared-exceedance penalty with ρ = 2.0. Fixed-margin MPC (TUBE in the tables) imposes predicted S ≤ 3.4 g/L. All MPC variants use the stated horizon-end-product and remaining-production surrogate; its exact formula is required to reproduce the comparison. The Chance-Constrained Model Predictive Control (CCMPC)– Stochastic Model Predictive Control (SMPC) comparison changes both the constraint and the penalty, so it is not a pure quantile ablation.</p>
<p>The reported outcomes are final titer P(T), productivity P(T)/T, sampled-step violation fraction, peak substrate, and solve time. Tables give mean ± standard deviation, rather than confidence intervals, across the 150 paired cells; lower-decile titer is the mean of the lowest 10% of runs. The reported software versions are Python 3.12.15, NumPy 2.1.3 <xref ref-type="bibr" rid="ref-18">[17]</xref>, SciPy 1.14.1 <xref ref-type="bibr" rid="ref-16">[15]</xref>, and Matplotlib 3.9.2 <xref ref-type="bibr" rid="ref-19">[18]</xref>. Figures are reported as generated from result files at 300 dpi.</p>
<p>The implemented study isolates the control layer under a known parameter law. It uses full-state feedback and a shared Euler discretization for plant and planner, with parametric mismatch and additive noise. It does not test posterior estimation, structural mismatch, min-max or certified tube control, changing-volume fed-batch operation, or inhibition- and biomass-specific guards. The quantile ablation uses 15 draws crossed with three seeds, a 45-cell subset.</p>
</sec>
<sec id="sec-20"><label>5.2</label><title>Main Comparison (RQ1, RQ2)</title>
<p><xref ref-type="table" rid="tab3">Table 3</xref> reports the six-method comparison over the 150 paired runs; <xref ref-type="fig" rid="fig1">Fig. 1</xref> shows substrate trajectories against the chance-constraint bound for the three highest-titer controllers on a representative draw, and <xref ref-type="fig" rid="fig2">Fig. 2</xref> places every individual run in the violation-titer plane. Three regimes are immediately visible.</p>
<table-wrap id="tab3"><label>Table 3</label><caption><p>Closed-loop performance over 150 paired runs (30 parameter draws x 5 process-noise seeds; mean +/- std across runs; violation rate = fraction of the 60 steps with S &gt; S_max = 4.0 g/L; worst-decile titer = mean of the lowest 10% of runs).</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:6:62.3,164.1,537.1,351.8"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>The nominal OL profile has a reported predicted peak of 4.000 g/L and nominal titer of 4.507 g/L. Applied to the uncertain systems, it gives 2.788 ± 1.130 g/L, or 61.9% of that nominal prediction, and violates the ceiling in 49.1% of sampled steps and all 150 runs. The reported mean peak substrate is 12.22 g/L and the maximum is 14.841 g/L, about 3.7 times the ceiling. The early low feed and mid-course rise expose the sensitivity of an unchanged profile to kinetic mismatch. These results show overfeeding relative to the operational guard; they do not quantify biological damage from substrate inhibition, which is absent from Eq. (6).</p>
<p>PI and fixed-margin MPC have no observed violations in this campaign, with reported peaks of 3.908 and 3.483 g/L. Their mean titers are 4.798 ± 1.516 and 4.913 ± 1.506 g/L. Relative to CCMPC, their differences are −0.251 and −0.136 g/L, corresponding to discounts of approximately 5.0% and 2.7% using CCMPC as denominator. PI has a lower-decile titer of 2.334 g/L but a highest draw-mean titer of 8.467 g/L. Thus the classical loop is competitive within the simulated conditions. Neither zero observed violations nor a fixed planning margin constitutes a safety guarantee.</p>
<p>The mean titers of Nonlinear Model Predictive Control (NMPC), SMPC, and CCMPC differ by at most 0.015 g/L, while pooled step violation fractions are 0.065, 0.032, and 0.049 and runs with any violation are 33.3%, 16.7%, and 25.3%, respectively. NMPC is a point-parameter controller; the other two propagate parameter scenarios. SMPC has the higher reported mean and lower violation frequency than CCMPC, so these data do not establish a performance advantage for the quantile form. Mean solve times are 3.10, 3.90, 4.40, and 3.98 ms for NMPC, SMPC, CCMPC, and fixed-margin MPC. The 4.40-ms value is about 164,000 times shorter than the 720-s sampling interval. This is a measured implementation budget, not a real-time worst-case bound; solver failure and timing variability require separate analysis.</p>
<fig id="fig1"><label>Figure 1</label><caption><p>Substrate trajectories against the chance-constraint bound S_max = 4.0 g/L on the representative parameter draw 21 (the median-performance draw for the proposed controller).</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:7:66,421.7,537.1,562.9"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>Lines: Seed-mean paths of the three highest-titer controllers; shaded bands: Min-max envelope across the five process-noise seeds; dashed line: S_max (<xref ref-type="fig" rid="fig1">Fig. 1</xref>).</p>
<p><xref ref-type="fig" rid="fig1">Fig. 1</xref> shows similar trajectories for the three MPC controllers on draw 21. The paths approach the ceiling, and the seed envelope includes shallow excursions above it. Their similarity is consistent with the small titer differences in <xref ref-type="table" rid="tab3">Table 3</xref>; the aggregate violation summaries address behavior beyond this illustrative draw.</p>
<fig id="fig2"><label>Figure 2</label><caption><p>Per-run substrate-violation fraction versus final titer, with method means marked by stars.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:7:66,155.7,537.1,302.1"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>Each method has 150 simulated cells. The tube-lite label denotes fixed-margin nominal MPC (<xref ref-type="fig" rid="fig2">Fig. 2</xref>).</p>
<p><xref ref-type="fig" rid="fig2">Fig. 2</xref> places PI and fixed-margin MPC on the observed zero-violation axis, the three MPC variants at higher mean titer with nonzero excursions, and OL control at a substantially larger violation frequency. This comparison is an empirical trade-off across the tested designs, rather than a certified productivity–safety frontier.</p>
</sec>
<sec id="sec-21"><label>5.3</label><title>Ablation: The Quantile Dial</title>
<p><xref ref-type="table" rid="tab4">Table 4</xref> compares nearest-rank levels 80%, 90%, and 95% on the stated 45-cell subset. For ten scenarios, the selected ranks are ceil (10q), namely eight, nine, and ten. The 95% rule therefore uses the scenario maximum; its difference from SMPC includes the additional penalty. On the same subset, SMPC has reported titer 5.470 ± 1.610 g/L, violation fraction 0.031, eight violating runs, and lower-decile titer 3.235 g/L.</p>
<table-wrap id="tab4"><label>Table 4</label><caption><p>Quantile-level ablation of the chance-constrained controller (45 paired runs: 15 draws x 3 noise seeds; the 90% row is the main configuration of Table 3 restricted to this subset; the last row is scenario MPC on the identical subset).</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:8:66,527.4,537.1,641.3"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>Observed violation fractions decrease from 0.079 to 0.051 to 0.029 as the selected rank increases, and violating-run fractions decrease from 33.3% to 26.7% to 17.8%. Mean titers are 5.434, 5.482, and 5.421 g/L, so the response is not monotone. The reported results include run-level Wilcoxon values W = 0, p = 6.5 × 10⁻⁴ for 80% versus 95% violations; W = 435, p = 0.358 and W = 423, p = 0.292 for 90% versus 80% and 95% titer; and W = 3, p = 2.8 × 10⁻¹³ for 80% versus 95% titer, with median difference 0.006 g/L and 44 of 45 pairs aligned. The last comparison is statistically different under the reported calculation, although its mean gap is only 0.013 g/L. The three seeds within each of 15 draws limit independent inference. These results support an empirical quantile response, not a universally optimal 90% setting.</p>
<p>The constraint controls an order statistic of scenario substrate predictions at each step. The quadratic exceedance penalty acts on squared positive violations and is not Conditional Value-at-Risk (CVaR), whose optimization construction is different <xref ref-type="bibr" rid="ref-20">[19]</xref>. The 95% row and SMPC have similar violation fractions, 0.029 and 0.031, and a reported titer difference of −0.049 g/L. Without a separate penalty-coefficient ablation and solver diagnostics, the results do not identify the causal contribution or gradient strength of the penalty.</p>
</sec>
<sec id="sec-22"><label>5.4</label><title>Robustness across Parameter Draws</title>
<p><xref ref-type="table" rid="tab5">Table 5</xref> reports parameter-draw means over the five noise seeds. CCMPC draw-mean titer spans 1.775–8.269 g/L. The reported analysis identifies draw 29 with μ_max = 0.243 h⁻¹ and draw 13 with β = 2.725 g/g, and reports titer correlations of +0.84 with μ_max, −0.53 with K_S, +0.48 with β, −0.03 with Y, and −0.12 with K_P. These are descriptive associations across 30 draws and do not isolate parameter effects or prove that the same uncertainty controls titer and constraint risk. The substrate guard does not protect final titer against adverse kinetics.</p>
<table-wrap id="tab5"><label>Table 5</label><caption><p>Draw-level robustness summary (per-draw means over the 5 noise seeds; 30 draws; per-step satisfaction = 1 - mean violation rate).</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:8:65.5,52.4,537.1,170.3"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>Among runs with any violation, reported mean violating-step fractions are 0.194, 0.189, and 0.193 for NMPC, SMPC, and CCMPC, corresponding to approximately 11–12 sampled steps or 2.3 h. CCMPC violations arise within 15 draws; SMPC has 19 fully violation-free draws. The reported largest MPC peak is 4.058 g/L, approximately 1.5% above the ceiling, compared with 14.841 g/L for OL control. These durations and magnitudes help distinguish excursions, but their mechanisms require trajectory-level examination rather than inference from aggregates alone.</p>
<p>The pooled step satisfaction fractions are 93.5% for NMPC, 95.1% for CCMPC, and 96.8% for SMPC. A pooled average over times and runs does not establish Pr{S(t) ≤ S_max} ≥ 0.9 at every time. Fully violation-free runs account for 66.7%, 74.7%, and 83.3%, respectively, and therefore do not meet a 90% batch-level empirical target. On the ablation subset, the 95% order statistic raises violation-free runs from 73.3% to 82.2%. Fixed-margin MPC has zero observed violations, but none of these observations certifies a joint guarantee for future batches.</p>
</sec>
<sec id="sec-23"><label>5.5</label><title>Statistical Analysis</title>
<p>The analysis uses Wilcoxon signed-rank comparisons <xref ref-type="bibr" rid="ref-21">[20]</xref>, a Friedman screen <xref ref-type="bibr" rid="ref-22">[21]</xref>, and Holm correction across five baseline comparisons <xref ref-type="bibr" rid="ref-23">[22]</xref>. <xref ref-type="table" rid="tab6">Table 6</xref> reports those calculations on the 150 paired run cells. The parameter-draw unit is shared by five noise seeds, however, so the cells are nested rather than 150 independent biological draws. The reported p-values are exploratory; confirmatory inference requires a draw-level analysis or a justified clustered procedure.</p>
<table-wrap id="tab6"><label>Table 6</label><caption><p>Reported run-level test calculations for final titer. There are 150 paired cells nested within 30 parameter draws; p-values require draw-level or clustered reanalysis before confirmatory interpretation.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:9:66,272.3,537.1,457.2"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p><xref ref-type="table" rid="tab6">Table 6</xref> reports a Friedman statistic of 359.1, and CCMPC paired mean differences of +2.261, +0.251, +0.005, −0.010, and +0.136 g/L against OL, PI, NMPC, SMPC, and fixed-margin MPC. Its primary CCMPC–SMPC calculation gives W = 5348 and p = 0.555; this absence of rejection does not establish equivalence. The analysis additionally reports a post hoc violation comparison, W = 172.5 and p = 8.2 × 10⁻⁴, with 38 versus 25 violating runs. The independent-draw limitation prevents treating them as definitive significance or superiority evidence.</p>
</sec>
<sec id="sec-24"><label>5.6</label><title>Interpretation of the Reported Comparison</title>
<p>The comparison supports three descriptive findings. An unchanged nominal OL profile performs poorly under the stated uncertainty. Feedback controllers reduce substrate excursions substantially, and the scenario representations have similar mean titers but different observed violation frequencies. Within the quantile ablation, a higher selected rank reduces observed violations with small mean-titer changes. The measured optimization cost is modest at this scale. The 26.1% difference between SMPC and NMPC timing does not establish a sublinear scenario-count scaling law, because their constraints and solver paths also differ.</p>
<p>SMPC is ahead of CCMPC in the reported mean titer, violation fraction, and lower-decile titer. Fixed-margin MPC and PI have no observed violations and achieve approximately 97.3% and 95.0% of CCMPC mean titer; PI wins 46 of 150 paired cells. These observations make baseline selection consequential. A practitioner would need application-specific valuations of excursions, computation, and product output before choosing a controller; the simulation does not designate a universally preferable policy.</p>
<p>The known-law scenarios remove estimation error from the experiment, but they do not provide a mathematical optimistic bound on safety under a learned law. Common plant and planner discretization also excludes structural error and integration mismatch. The evidence concerns one simulator, one dispersion scale, one horizon, and the stated paired draws. Its positive result is an empirical mechanism for adjusting observed substrate risk; certified guarantees, posterior learning, and organism-specific validation remain separate tasks.</p>
</sec>
</sec>
<sec id="sec-25"><label>6</label><title>Discussion</title>
<sec id="sec-26"><label>6.1</label><title>Limitations</title>
<p>The study uses a continuous-culture surrogate rather than a volume-explicit fed-batch model. It omits substrate inhibition, dissolved-oxygen and pH interactions, sensor faults, contamination, and estimator delay. Thus the substrate ceiling has an operational role, and final concentration is not a complete measure of harvested mass or economic productivity. Euler step-size convergence and unsuccessful-solve behavior also need verification. The six-component lognormal law is a simulation assumption, not a measured biological variability model.</p>
</sec>
<sec id="sec-27"><label>6.2</label><title>Alternative Viewpoints and Responses</title>
<p>The empirical comparison illustrates when simple policies can be competitive. PI provides direct substrate regulation, and a fixed planning margin reduces observed excursions without scenario propagation. A posterior-aware extension could use estimation tools <xref ref-type="bibr" rid="ref-6">[6]</xref>, <xref ref-type="bibr" rid="ref-10">[9]</xref>, <xref ref-type="bibr" rid="ref-11">[10]</xref>, but credible risk statements would require the resulting distribution to be validated and the control and disturbance assumptions to be stated. Scenario-count, prior-misspecification, structural-mismatch, and penalty-coefficient studies would separate the mechanisms that the present comparison changes together.</p>
</sec>
</sec>
<sec id="sec-28"><label>7</label><title>Conclusion</title>
<p>This study examines empirical scenario-quantile MPC on a constant-volume continuous-culture surrogate with uncertain kinetics. The reported paired campaign shows similar mean titer across the three MPC controllers, fewer observed violations for hard-scenario MPC than for the ninth-order-statistic controller, and a monotone violation response to the selected order statistic. These results identify a tunable empirical mechanism rather than a certified chance-constrained solution.</p>
<p>At the 90% planning level, CCMPC has reported mean titer 5.049 ± 1.593 g/L, 95.1% pooled step satisfaction, and 74.7% violation-free runs. Its 4.4-ms mean solve time is small relative to the 720-s interval, but neither this timing nor the pooled satisfaction fraction supplies a worst-case or joint guarantee. The reported tests require reanalysis at the parameter-draw unit before inferential claims can be strengthened. Further validation should use the original executable and raw outputs, specify the terminal objective and failure policy, and analyze uncertainty at the independent-draw level. Subsequent studies can then introduce learned kinetic distributions, explicit disturbance scenarios, and volume-explicit fed-batch dynamics. Formal batch-risk budgeting or CVaR objectives <xref ref-type="bibr" rid="ref-20">[19]</xref> are distinct constructions that would require their own derivation and experiments.</p>
</sec>
<sec id="sec-29"><title>Declarations</title>
<p>Data availability: The study uses simulated bioreactor models. No public access location is specified for the seeds or raw simulation outcomes.</p>
<p>Code availability: The experiment files are identified as exp_27.py, exp_27_results.json, exp_27_f1.png, and exp_27_f2.png. No public access location is specified.</p>
</sec>
<sec id="sec-30"><title>Funding</title>
<p>This research received no specific grant from any funding agency in the public, commercial, or not-for-profit sectors.</p>
</sec>
<sec id="sec-31"><title>Conflicts of interest</title>
<p>The authors declare no conflicts of interest.</p>
</sec>
<sec id="sec-32"><title>Author contributions</title>
<p>Tarek Abdelrahman: conceptualization, methodology, software, and writing—original draft. Wolfgang H. Müller: data curation, formal analysis, and visualization. Arafa Abdelzaher Nasef: validation, supervision, and writing—review and editing.</p>
<p>Generative Artificial Intelligence (AI) disclosure: AI-assisted drafting tools were used in preparing the manuscript text. The authors retain responsibility for scientific verification and the accuracy of this disclosure.</p>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Monod, J. (1949). The growth of bacterial cultures. Annual Review of Microbiology, 3, 371–394. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1146/annurev.mi.03.100149.002103">https://doi.org/10.1146/annurev.mi.03.100149.002103</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>Andrews, J. F. (1968). A mathematical model for the continuous culture of microorganisms utilizing inhibitory substrates. Biotechnology and Bioengineering, 10(6), 707–723. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1002/bit.260100602">https://doi.org/10.1002/bit.260100602</ext-link></mixed-citation></ref>
<ref id="ref-3"><label>3</label><mixed-citation>Banga, J. R., Balsa-Canto, E., Moles, C. G., &amp; Alonso, A. A. (2005). Dynamic optimization of bioprocesses: Efficient and robust numerical strategies. Journal of Biotechnology, 117(4), 407–419. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.jbiotec.2005.02.013">https://doi.org/10.1016/j.jbiotec.2005.02.013</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>4</label><mixed-citation>Mayne, D. Q., Rawlings, J. B., Rao, C. V, &amp; Scokaert, P. O. M. (2000). Constrained model predictive control: Stability and optimality. Automatica, 36(6), 789–814. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/S0005-1098(99)00214-9">https://doi.org/10.1016/S0005-1098(99)00214-9</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>5</label><mixed-citation>Mesbah, A. (2016). Stochastic model predictive control: An overview and perspectives for future research. IEEE Control Systems Magazine, 36(6), 30–44. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/MCS.2016.2602087">https://doi.org/10.1109/MCS.2016.2602087</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>6</label><mixed-citation>Bastin, G., &amp; Dochain, D. (1990). On line estimation and adaptive control of bioreactors. Elsevier Amsterdam.</mixed-citation></ref>
<ref id="ref-7"><label>379</label><mixed-citation><ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/C2009-0-12088-3">https://doi.org/10.1016/C2009-0-12088-3</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>7</label><mixed-citation>Luedeking, R., &amp; Piret, E. L. (1959). A kinetic study of the lactic acid fermentation. Batch process at controlled pH. Journal of Biochemical and Microbiological Technology and Engineering, 1(4), 393–412. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1002/jbmte.390010406">https://doi.org/10.1002/jbmte.390010406</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>8</label><mixed-citation>Calafiore, G. C., &amp; Campi, M. C. (2006). The scenario approach to robust control design. IEEE Transactions on Automatic Control, 51(5), 742–753. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/TAC.2006.875041">https://doi.org/10.1109/TAC.2006.875041</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>9</label><mixed-citation>Gelman, A., Carlin, J. B., Stern, H. S., &amp; Rubin, D. B. (2013). Bayesian data analysis. Chapman and hall cRc. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1201/b16018">https://doi.org/10.1201/b16018</ext-link></mixed-citation></ref>
<ref id="ref-11"><label>10</label><mixed-citation>Doucet, A., De Freitas, N., &amp; Gordon, N. (2001). Sequential Monte Carlo methods &amp; particle filters resources. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-1-4757-3437-9">https://doi.org/10.1007/978-1-4757-3437-9</ext-link></mixed-citation></ref>
<ref id="ref-12"><label>11</label><mixed-citation>Nocedal, J., &amp; Wright, S. (2006). Numerical Optimization. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1007/978-0-387-40065-5">https://doi.org/10.1007/978-0-387-40065-5</ext-link></mixed-citation></ref>
<ref id="ref-13"><label>12</label><mixed-citation>J. B. Rawlings, D. Q. Mayne, and M. M. D. (2017). Model Predictive Control: Theory, Computation, and Design, 2nd ed. Nob Hill. <ext-link ext-link-type="uri" xlink:href="https://sites.engineering.ucsb.edu/~jbraw/mpc/MPC-book-2nd-edition-1st-printing.pdf">https://sites.engineering.ucsb.edu/~jbraw/mpc/MPC-book-2nd-edition-1st-printing.pdf</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>13</label><mixed-citation>Scokaert, P. O. M., &amp; Mayne, D. Q. (1998). Min max feedback model predictive control for constrained linear systems. IEEE Transactions on Automatic Control, 43(8), 1136–1142. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/9.704989">https://doi.org/10.1109/9.704989</ext-link></mixed-citation></ref>
<ref id="ref-15"><label>14</label><mixed-citation>Langson, W., Chryssochoos, I., Raković, S. V, &amp; Mayne, D. Q. (2004). Robust model predictive control using tubes. Automatica, 40(1), 125–133. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.automatica.2003.08.009">https://doi.org/10.1016/j.automatica.2003.08.009</ext-link></mixed-citation></ref>
<ref id="ref-16"><label>15</label><mixed-citation>Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., … &amp; van Mulbregt, P. (2020). SciPy 1.0: Fundamental algorithms for scientific computing in Python. Nature Methods, 17(3), 261–272. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41592-019-0686-2">https://doi.org/10.1038/s41592-019-0686-2</ext-link></mixed-citation></ref>
<ref id="ref-17"><label>16</label><mixed-citation>K. J. Åström &amp; T. Hägglund. (1995). PID controllers: Theory, design, and tuning. <ext-link ext-link-type="uri" xlink:href="https://portal.research.lu.se/en/publications/pid-controllers-theory-design-and-tuning/">https://portal.research.lu.se/en/publications/pid-controllers-theory-design-and-tuning/</ext-link></mixed-citation></ref>
<ref id="ref-18"><label>17</label><mixed-citation>Harris, C. R., Millman, K. J., Van Der Walt, S. J., Gommers, R., Virtanen, P., Cournapeau, D., … &amp; Oliphant, T. E. (2020). Array programming with NumPy. Nature, 585(7825), 357–362. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1038/s41586-020-2649-2">https://doi.org/10.1038/s41586-020-2649-2</ext-link></mixed-citation></ref>
<ref id="ref-19"><label>18</label><mixed-citation>Hunter, J. D. (2007). Matplotlib: A 2D graphics environment. Computing in Science &amp; Engineering, 9(03), 90–95. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/mcse.2007.55">https://doi.org/10.1109/mcse.2007.55</ext-link></mixed-citation></ref>
<ref id="ref-20"><label>19</label><mixed-citation>Rockafellar, R. T., Uryasev, S. (2000). Optimization of conditional value-at-risk. Journal of Risk, 2(3), 21–41. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.21314/JOR.2000.038">https://doi.org/10.21314/JOR.2000.038</ext-link></mixed-citation></ref>
<ref id="ref-21"><label>20</label><mixed-citation>Wilcoxon, F. (1945). Individual comparisons by ranking methods. Biometrics Bulletin, 1(6), 80–83. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.2307/3001968">https://doi.org/10.2307/3001968</ext-link></mixed-citation></ref>
<ref id="ref-22"><label>21</label><mixed-citation>Friedman, M. (1937). The use of ranks to avoid the assumption of normality implicit in the analysis of variance. Journal of the American Statistical Association, 32(200), 675–701. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1080/01621459.1937.10503522">https://doi.org/10.1080/01621459.1937.10503522</ext-link></mixed-citation></ref>
<ref id="ref-23"><label>22</label><mixed-citation>Holm, S. (1979). A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 6(2), 65–70. <ext-link ext-link-type="uri" xlink:href="https://www.jstor.org/stable/4615733">https://www.jstor.org/stable/4615733</ext-link></mixed-citation></ref>
</ref-list></back>
</article>