1. Introduction
Medium voltage insulators are widely used in electrical switches, electrical control devices, and other electrical equipment [
1,
2]. Quality control for the insulators is of great significance for its economical manufacturing and safe, reliable operations. Currently, most of the medium voltage insulators are manufactured by a widely used technology—the epoxy resin automatic pressure gelation technology (APG) [
3]. For APG technology, the critical process for quality control is the automatic pressure gelation process. The APG process is a typical batch process, which is of high complexity and nonlinearity [
4]. Meanwhile, the insulators have a wide range of types with continually changing customer demands. Therefore, it must meet the needs of flexible manufacturing. All the above factors make it a challenge to implement quality control of medium voltage insulators efficiently. Thus, a severe challenge is put forward for quality control of the production of insulators.
During the manufacturing process of the medium voltage insulators, process parameters have a significant impact on product quality. Once the material recipe and the APG device are determined, the process parameters are the only controllable factors left. In practice, after the design stage, quality control of insulators is mainly achieved via the tuning of process parameters. Traditional quality control methods for batch processes can be categorized into three different types, that is, trial-and-error, design of experiments (DOE), simulation optimization based on product quality models (i.e., model-based optimization, MBO) [
5]. Generally speaking, the trial-and-error and the DOE are inefficient, inaccurate, and experience-dependent. However, for the MBO, although it has high efficiency in its optimization stage, the cost for model construction is very high, and the model mismatch always exists. Hence, the application of MBO is costly, time-consuming, and still cannot guarantee the optimality of the optimal process settings. Considering the flexibility required for the flexible manufacturing of the medium voltage insulators, the problem of inefficiency of MBO becomes more severe. Due to the inefficiency of MBO on model construction and the model mismatch, the trial-and-error and the DOE are still widely used in the industrial practice. The reason is that although the trial-and-error and the DOE are inefficient, they still have the advantage of easy implementation. To address the challenges, Kong et al. proposed a systematic model-free optimization (MFO) framework for a type of batch processes with short cycle time and low operational cost [
5], and Zhu and Yang et al. [
6,
7] further extended the framework. In their MFO framework, they suggested using relatively fewer direct experiments to substitute the role of the model in MBO based on the characteristics of batch processes with short cycle time and low operational cost. Hence, the MFO framework can keep the high-efficiency optimization characteristics of MBO and simultaneously avoids high modeling costs. Different methodologies, such as simultaneous perturbation stochastic approximation (SPSA), simplex search method, are integrated to form different realizations of MFO, and thus the efficiency of quality control is improved. However, MFO is formulated and constructed under an implicit hypothesis that the operational cost for a single batch is relatively low, and thus the cost of fewer experiments can be tolerable. Based on the hypothesis, MFO is less sensitive to fewer experiment costs. However, for the APG process, the above hypothesis is invalid anymore. Although the APG process has the same batch-to-batch characteristics as the low-operational-cost batch process, the operational cost and the cycle time for a single batch are relatively higher that they cannot be ignored. Due to the above reason, traditional MFO methodology cannot be extended to the APG process directly.
To reduce the experimental costs of MFO further, Zhao et al. proposed iterative modeling and the trust-region optimization method (IMTO) according to the advantages of both the MFO and the MBO [
8]. To improve the efficiency of the traditional MFO, the IMTO method utilizes a series of surrogate models to guide the optimization process, and the surrogate models are constructed based on iterative information generated during the optimization. That method actually tries to incorporate process knowledge generated during the optimization. IMTO is a hybrid strategy, which is no longer pure model-free; it can, to some extent, reduce the experimental cost of the traditional MFO. Lu et al. proposed a model-free quality optimization method based on the natural gradient for the injection molding processes [
9]. In their study, the natural gradient was used, and an adaptive stepping strategy based on Riemannian geodesic distance was constructed. Their method had been verified that it could improve the optimization convergence speed of MFO and reduce the costs of quality control. As model-free algorithms are critical for quality control, some researchers focus on the efficiency of the algorithms [
10,
11]. Hou et al. focused on the development of the data-driven strategy to improve the efficiency of model-free control (MFC) [
12,
13,
14]. The development process of MFC is instructive to the MFO. Xing et al. considered that when a complex optimization problem is to be solved, the knowledge of the problem could be excavated from the optimization process and could be utilized to guide the subsequent optimization process to improve the optimization efficiency. They had proposed a series of knowledge-based algorithms and learning-guided algorithms [
15,
16]. However, their study focused on global optimization algorithms, which are not suitable for MFO scenarios. To summarize, all the above research from IMTO to Xing’s study, knowledge either generated during the optimization or obtained as a prior are utilized to promote the efficiency of their methods. It provides us a definitive direction for the enhancement of the MFO, which is to mine and use knowledge fully to guide the optimization process.
To address the challenges faced by quality control for a type of batch process with relatively high operational costs, such as the production of the medium voltage insulators, an idea of knowledge-informed optimization, which integrates iteration knowledge generated during the optimization process, is put forward systematically. This optimization strategy is elaborately designed to guide the optimization process based on historical information to improve the efficiency of quality control for batch processes. The characteristics of the traditional SPSA method were analyzed in this paper. Considering the potential drawbacks of the SPSA, a revised SPSA method, knowledge-informed SPSA based on historical gradient approximations (GK-SPSA), was proposed. This method could cope with the stationary iteration step size problem of the SPSA and could be used to compensate for the gradient approximations at each iteration point. Thus, the efficiency of the revised SPSA could be improved.
The remainder of this paper is organized as follows. In
Section 2, the quality control problem for the manufacturing of medium voltage insulators was defined and analyzed. In
Section 3, the idea of a knowledge-informed optimization strategy was introduced, and a revised SPSA method (GK-SPSA) based on historical gradient approximations was proposed and detailed. In
Section 4, the GK-SPSA method was verified on the weight control of a kind of post insulator. At last, conclusions from this research are presented.
2. Quality Control for Medium Voltage Insulators
Once the manufacturing device and materials are predetermined, the quality of the medium voltage insulators would mainly be determined by the APG process parameters. Under this circumstance, quality control for the production of medium voltage insulators could thus be converted to the tuning of APG process parameters.
Considering the uncertainty in the actual manufacturing process, the mathematical relationship between a particular insulator quality index and the corresponding APG process parameters could be generally expressed as below:
where
represents the quality response of the quality index to be controlled,
is an
n-dimensional vector for the APG process parameters, and
is the
ith process parameters of
,
is the dimension of
,
represents the overall process uncertainty,
is the theoretical function between the quality response and the process parameters. However, due to the high complexity and nonlinearity of the process, the above quality model is mostly difficult or unable to obtain at a reasonable cost.
Correspondingly, quality control of medium voltage insulators could be formulated as:
where
represents the target of the quality index,
represents the mathematical expectation of the uncertainties,
is the quality error between the mathematical expectation of the actual quality
and the quality target,
and
represent the lower and upper bounds of
, respectively. Equation (2) is a constrained nonlinear optimization problem in essence, and the optimization objective is to find the optimal process parameters with a minimal quality error.
As the quality model of the APG process is usually unavailable, optimum process parameters mostly cannot be obtained via traditional simulation optimization strategy. Since the APG process is a typical batch process with run-to-run repetitive characteristics, to accomplish the quality control for medium voltage insulators, a model-free style optimization methodology is adopted. As a result, a closed-loop and online quality control methodology without a quality model is formulated. The schematics are shown in
Figure 1. Under the optimization framework, the role of the quality model is substituted by direct online measurements, and the model-free quality optimization methodology is elaborately designed and implemented. As the optimization process progresses, the quality target of medium voltage insulators could be achieved iteratively. Each iteration consists of four stages, i.e., process parameters tuning, experimentation, quality evaluation, and feedback. For this strategy, each iteration has a specific experimental cost. For a type of batch process with short cycle time and low operational cost, the optimization is not sensitive to the iteration number. Thus, a number of limited iterations for quality control are tolerable.
However, the APG process is different from the kind of batch processes with short cycle time and low operational cost. The experimental cost for a single batch of APG process is relatively high that it is sensitive to the iteration number of quality control. Thus, a critical challenge is presented for the online implementation of quality control for the insulators. To improve the efficiency of quality control, the iteration costs should be minimized, and thus the iteration number of quality optimization should be minimized. The traditional model-free optimization method should be improved further.
3. Knowledge-Informed SPSA Based on Historical Gradient Approximations
This section consists of five subsections: in the first subsection, an idea of integrating process knowledge in the traditional MFO optimization strategy was proposed and discussed, aiming to address the challenge mentioned above. In the second subsection, the traditional SPSA methodology was introduced. In the third subsection, the characteristics of the SPSA were discussed, and a basic idea on knowledge-informed SPSA, with the utilization of historical gradient approximation, was thus proposed. In the fourth subsection, an implementation scheme of the knowledge-informed SPSA based on historical gradient approximation was formulated and analyzed. In the fifth subsection, the efficiency of the revised methodology was demonstrated on a benchmark function.
3.1. Knowledge-Informed Optimization Strategy
For a type of batch process with high operational cost, such as an APG process for the medium voltage insulators, optimization celerity is a central concern of quality control. With the optimization framework, as shown in
Figure 1, the quality optimization strategy becomes the key to quality control. The performance of the optimization strategy significantly influences the efficiency of quality control. Generally speaking, the traditional MFO could meet the requirements of quality control on a type of batch processes with short cycle time and low operational cost. However, as the scenario is different for medium voltage insulators, quality control is faced with a great challenge of relatively high experimental cost at each batch. Although MFO already exhibits high efficiency in the previous scenario, it cannot satisfy the requirements on medium voltage insulators.
Whether or not the efficiency of quality control can be improved further under this optimization framework? Considering that in the iterative process of quality control, the optimization process will generate a series of historical iterative process information, which, in fact, contains specific process knowledge. In traditional MFO methods, this kind of information is not fully utilized. Taking the SPSA-based MFO method as an example, the optimization at each iteration only depends on the current iteration point and its corresponding perturbation points. If we could thoroughly investigate the characteristics of the process and monitor the status of quality control progress by using the information of historical iteration points generated during the quality control optimization process, then we could use this kind of knowledge to evaluate and adjust the quality control progress, to reduce the cost for quality control and improve the efficiency of quality control. This strategy, which improves the efficiency of the traditional quality control method and integrates process knowledge information to guide the optimization progress, is called a knowledge-informed quality optimization strategy. From the idea of optimization fused by iterative knowledge during the optimization, this section discusses a kind of SPSA-based knowledge-informed strategy based on historical gradient approximations in-depth and puts forward a feasible implementation mechanism.
3.2. Basic Principles of SPSA Methodology
SPSA is a type of stochastic gradient approximation optimization method [
17,
18]. For a multi-dimensional optimization problem, it perturbs all elements simultaneously at each iteration point to generate two perturbation points. Then, the gradient at the current iteration point is estimated by using the information of the loss functions of the two perturbation points. Compared with the finite difference stochastic approximation (FDSA) method, the cost of gradient estimation is significantly reduced [
19]. Thus, SPSA has higher optimization efficiency. The basic steps of the SPSA are as follows:
Method initialization: Determine the process parameters to be optimized and their feasible regions, and select the initial point X1 by experience or according to specific rules. Set appropriate optimization method coefficients
and iteration termination conditions.
Step size calculation: Update the step size
at the current iteration batch, and the iteration step size could be calculated as below:
where
,
,
are coefficients of SPSA,
is the current iteration number,
represents the iteration step size of SPSA at
kth iteration, which is the
kth element of the monotonic decreasing sequence of the iteration step size. According to Equation (3), the iteration step size decreases with the progress of the iterative optimization process.
The perturbation step size could be calculated as follows:
where
,
are coefficients of SPSA,
represents the perturbation step size of SPSA at
kth iteration. It also decreases with the progress of the iterative optimization process.
Perturbation points generation: Generating an n-dimensional perturbation vector by Monte Carlo method, with each of its elements generated randomly by Bernoulli distribution. Each component in the vector is independent and satisfies the zero mean principles. Suppose the current iteration point as Xk, then the positive perturbation point is , and the negative perturbation point is .
Loss function evaluation: Evaluate the loss functions of the iteration point, the positive perturbation point, and the negative perturbation point at the kth iteration, and .
Gradient approximation calculation: The gradient approximation could be calculated according to the positive and negative perturbation points and their corresponding loss function values. The formula for the gradient approximation is as below:
Iteration point updating: Determine the next iteration point by utilization of gradient approximations according to the following formula:
Termination conditions judgment: Determine whether the optimization termination criteria are met. Stop the optimization when the quality requirement is satisfied, or a maximum iterations number is achieved.
3.3. Basic Ideas for Knowledge-Informed SPSA Based on Historical Gradient Approximation
Although the traditional SPSA method already has high optimization efficiency, it still has some potential disadvantages. Firstly, as illustrated in Equation (3), the iteration step size of the SPSA method is a monotonic decreasing sequence only related to the number of iterations, which regularly decreases while the optimization progress is carrying forward. Essentially, this adjustment mechanism for the iteration step size is static and solidified, which is beneficial to the convergence of SPSA. As a result, the iteration step size does not have the adaptability to the status of the optimization progress. Thus, the traditional SPSA method lacks adaptive optimization search capability. As an example, at the initial stage of SPSA, even if the search direction is not in the descent direction, a larger iteration step size would be obtained according to the current adjustment mechanism, which might cause oscillation of the optimization progress. However, with the increase in the number of iterations, the iteration step size would decrease continually. At this moment, even if a proper descent direction is found, a fast descent could not be achieved by the SPSA due to the limits of small iteration step size. Therefore, the static adjustment mechanism of the iteration step size limits the optimization efficiency of SPSA. Secondly, SPSA only uses a few information at the current iteration point, which makes SPSA simple and easy to implement. Nevertheless, it also means that the method loses the global perception ability of the optimization process. Thirdly, with the restrictions of the above two factors, SPSA is easy to fall into local minima, which might seriously deteriorate the optimization performance in complex optimization scenarios.
Under the optimization framework of MFO, in order to improve the efficiency of quality control for the medium voltage insulators, a significant challenge brought by the above potential defects should be addressed. How to cope with the challenge mentioned before to improve the efficiency of quality control? Two critical questions are to be answered. The first question is: Whether the fixed step size tuning mechanism of SPSA could be changed to a dynamic tuning mechanism so that the method could have a kind of dynamic adaptive capability? The second question is: Whether the information of historical iteration points could be used to provide a certain extent of perception ability for the optimization progress? The answers to both the above questions are yes. As the historical iteration points carry some knowledge of the optimization process, this kind of knowledge could be integrated to investigate the status of the optimization progress, and thus could be used to guide the proceeding optimization process. According to Equation (6), the iteration step size and the gradient approximation are crucial for the iteration progress of SPSA. Suppose that the historical iteration points information could be effectively integrated to form a revised knowledge-informed method. Then, based on a dynamic adaptation mechanism, the iteration step size could be tuned adaptively; and based on a gradient approximation compensation mechanism, the gradient estimations could be compensated dynamically.
To construct such an improved knowledge-informed optimization method, as described above, the characteristics of the general optimization progress of industrial problems are further considered. Without loss of generality, a typical minimization problem is employed.
Figure 2 shows a typical sketch for a 2-dimensional optimization problem. In general, considering the different development trends of the optimization process in a small local neighborhood, the status of the optimization progress could be divided into two typical scenarios: the local rapidly descending scenario and the local stagnation scenario. When the optimization progress lies in the descending zone, the optimization progress should be accelerated by increasing the iteration step size; while when the optimization progress lies in the stagnation zone, the iteration step size might be decreased moderately to accelerate the convergence rate of SPSA.
Considering the framework of the MFO and the idea of a knowledge-informed quality optimization strategy, only knowledge generated during the optimization process would be incorporated. In this paper, the historical gradient approximations as important information during the optimization process were utilized. The key to the knowledge-informed method is how to judge the current status of optimization progress. Suppose that the iterative gradient approximations keep following the same search direction in several successive iterations, it is reasonable to indicate that the optimization progress lies in the descending zone. Thus, the iteration step size might be enlarged according to the consistency of the directions of the adjacent gradients. Conversely, if the gradient approximations keep changing their search directions, it might be indicated that it has already fallen into a stagnation zone. In this case, the iteration step size thus could be cut down correspondingly to accelerate its convergence.
SPSA is a highly efficient method due to its two-measurements gradient approximation principles, which dramatically reduces gradient approximation costs for the stochastic approximation method. However, its efficiency is accomplished at the cost of only obtaining relatively poor gradient approximation at each single iteration point. If the accuracy of the gradient approximations could be further improved under the SPSA framework, it certainly could enhance the efficiency of SPSA. Considering that the iterative gradient approximations generated during the optimization process certainly carry some knowledge, such as the gradient tendency, they might be utilized to compensate for the gradient approximations at each iteration point. In fact, gradient averaging or gradient smoothing technique for optimization algorithm efficiency promotion had already been investigated before [
20,
21]. However, these methods were not widely used in engineering for they still stay at the algorithm investigation stage and lack of application in engineering practice.
Based on the above ideas, a revised knowledge-informed SPSA strategy, which incorporates the historical gradient approximations to guide the optimization progress, was proposed and formulated. This method utilized historical gradients to determine the status of the current optimization progress and tunes the iteration step size adaptively. Furthermore, the gradient approximations at each iteration point could be compensated moderately by the historical gradients. This methodology was named as knowledge-informed SPSA based on historical gradient approximations (GK-SPSA for short), and it is a typical knowledge-informed optimization strategy. An implementation scheme for GK-SPSA was proposed and illustrated in detail in the following subsection.
3.4. An Implementation Scheme of GK-SPSA
The basic procedure of GK-SPSA was almost the same as that of the traditional SPSA. The difference lies that GK-SPSA tried to effectively utilize the information of the gradient approximations during the optimization process and guided the optimization process via the historical data. Through the usage of information on historical gradient approximations, the gradient approximations compensation could be accomplished, and the iteration step size could be tuned adaptively. An implementation scheme of GK-SPSA was formulated based on the above ideas. The detailed mechanism is illustrated.
The gradient compensation rule was as follows:
where
is the
kth iteration point,
is the current simultaneous perturbation gradient approximation (CSPGA) at
, as shown in Equation (5),
is the
kth compensated composite gradient approximation (CGA) at the
,
is the gradient compensation coefficient at the
kth iteration point. From Equation (7), the CGA at the
is a linear combination of the previous CGA at
and the CSPGA at the
. Through the above mechanism, the historical gradient approximations were integrated into the SPSA. The CGA was utilized to substitute the original simultaneous perturbation gradient approximations.
Considering that the credibility of CGA increases with the iteration number
k according to the characteristics of SPSA, the gradient compensation coefficient could be constructed as follows:
where
is an upper limit that a CGA could be approached, which is usually set to 0.5,
is the initial deviation between
and its lower limit, which is usually set to 0.2, and
is a coefficient, which counts on the iteration number effects on the credibility of CGA. The coefficient
represents the tendency of the cumulative effect of historical gradient approximations on compensated gradients.
To evaluate the status of the optimization process, an indicator, which is the angle between the CGA and the CSPGA, was adopted. A sketch of the angle could be seen in
Figure 3. The smaller the angle was, the better the consistency of the gradient direction between the current iteration point and the previous iteration point was. Thus, if the optimization progress lied in the descending zone, the angle might be relatively small; conversely, if the optimization progress lied in the stagnation zone, the angle might be relatively larger. The cosine value of the angle was set as the status indicator (SI), and it could be calculated as below:
where
is the angle between the CGA and the CSPGA at the current iteration point.
Based on the SI, the status of the optimization progress could be roughly evaluated quantitatively. Considering that the angle lied between 0 and , accordingly, the range of SI was [−1, 1]. When the CSPGA was exactly consistent with CGA, the SI approached 1 as the angle approached 0. When the direction of CSPGA was in contrary to the CGA, the SI approached –1 as the angle approached .
With the above SI, the iteration step size thus could be tuned according to the estimated status of the current iteration point. The tuning formula for the revised iteration step size was defined as below:
where
is the revised iteration step size,
is a tuning coefficient for iteration step size (
),
is a coefficient that counts on the iteration number effects on
. To make the tuning coefficient have nonlinear asymptotic characteristics with the SI, the tangent function trajectory was chosen to construct the distribution trajectory for the adjustment coefficients of the iteration step size. The formula was intentionally designed to tune the iteration step size into a theoretical range of
according to the SI. Thus, the GK-SPSA would obtain the capability to tune the iteration step size adaptively based on the estimated status of the optimization progress.
The iteration points updating rule was substituted as follows:
The frameworks of SPSA and GK-SPSA are illustrated in
Figure 4. Compared to the SPSA, an additional step was added by GK-SPSA to compensate for the gradient approximation and to tune the iteration step size based on the historical gradient approximation.
3.5. Benchmark Function Test
To illustrate the performance of GK-SPSA vs. SPSA, an optimization test on a benchmark function was conducted. The Rosenbrock function, which is a widely-used benchmark function, with a dimension of 10, was adopted. The initial settings was set at X
0 = [0.0015, 1, 0.4208, 0.4503, 0.3416, 0.3424, 0.9372, 0.5422, 0.867, 0.1635]
T, which was a randomly selected initial point.
Figure 5 shows one typical optimization result of a single run with the two methods. It was indicated that GK-SPSA behaved very well relative to the traditional SPSA in this case. It could be concluded that the GK-SPSA was effective and fast that the optimization cost was significantly reduced.
Figure 5b shows the trajectories of the iteration step size of GK-SPSA and SPSA. It was clear to see that the GK-SPSA could tune its iteration step size adaptively, in the meantime, not deteriorate the convergence ability of SPSA.