Research Article  Open Access
Yan Mao, Kai Cheng, "Hopfield Neural Network Method for Problem of Telescoping Path Optimization of SingleCylinder PinType Multisection Boom", Mathematical Problems in Engineering, vol. 2019, Article ID 6195013, 14 pages, 2019. https://doi.org/10.1155/2019/6195013
Hopfield Neural Network Method for Problem of Telescoping Path Optimization of SingleCylinder PinType Multisection Boom
Abstract
Telescoping path optimization (TPO) of singlecylinder pintype multisection boom (SPMB) is a practical engineering problem that is valuable to investigate. This article studies the TPO problem and finds the key of TPO is to obtain the maximum retraction backmost combination. A mathematic model on the basis of the quadratic penalty function of a Hopfield neural network (HNN) is constructed. Two strategies are presented to improve the performance of TPO model: one is proportional integral derivative (PID) strategy that adaptively adjusts the parameter λ of the constrained term and the parameter of the optimization objective term by controlling the value of constraint violation and the other is efficiency factor strategy that an efficiency factor is introduced in model for prioritizing the constrained term over the objective term. Data test shows that compared with the path of boom length changing before optimization, both the number of sections that need to be moved and the total travels of cylinder can be reduced by 10%30% after optimization. Both the PID strategy and the efficiency factor strategy achieve good optimization effects. The efficiency factor strategy is excellent at moderating the conflicts between the constrained term and the objective term; thus the generations of the valid and the optimal solutions get well improved.
1. Introduction
The upstructure of a mobile crane is composed of four major mechanisms: slewer, derricking mechanism, winch, and telescopic boom. Singlecylinder pintype telescopic multisection boom (SPMB) is the structure of telescopic boom. The SPMB has a fixed section and multiple telescopic sections, and the telescopic sections are sleeved one by one in the way that the small section is inserted in the large one. The length of each section is divided into several scales, and each scale has a hole set for being locked by pin of the inner adjacent section. Therefore, the different hole of outer section being locked by the pin of inner section determines the different stretching of the inner section. A single long cylinder driving boom sections sequentially and the sections are pined gradually to keep the extension of the boom. Boom length is determined by all sections’ stretching, and each section’s stretching is decided by the location of the hole being pinned of its outer section. Obviously the boom length values of SPMB are discontinuous.
Singlecylinder pintype multisection boom (SPMB) has good load bearing performance that is mainly used in large tons automobile crane at present. For example, the truck cranes with over 100 tons lift weight are most equipped with SPMB mechanisms; a giant all terrain crane with lift weight of 2,000 tons has an eightsection SPMB, whose boom length exceeds 100 meters when the SPMB is being fully stretched. For now, the material of SPMB is steel for crane, and the maximum number of boom sections is only eight owing to weight limit of material. In future, with the design optimization and the applications of lightweight materials, such as carbon fiber and polymer materials, the sections number might be manufactured more than the eight, might be, n=10,20,30 and so on.
However, the telescoping efficiency of SPMB is low. Because all the sections are driven by a long single cylinder, the multiple sections must await to be retracted one by one in sequence from initial position to backmost position and then wait to be stretched in reverse sequence from the backmost position to target position, while changing boom length from one state to another. When telescoping one section, a set of complex procedure (telescoping step) must be operated, mainly involving processes of cylinder freely moving towards aimed section and cylinder driving the aimed section towards target position. Provided that a boom has sections, (2n1) telescoping steps should be operated when changing the boom length, where (n1) steps are for retracting sections and steps are for stretching sections. If optimization is performed, the telescoping steps can be reduced by one or two, and then the work efficiency can be evidently improved.
TPO of SPMB is a practical engineering problem. Although SPMB is widely applied in machinery and equipment, research on TPO is lacking.
Reference [1] (2012) described the TPO problem first in public and optimized a fivesection SPMB in a nested program. The principle was that, judging the sections from the outermost section to the innermost section, if the required cylinder travel exceeded the offered cylinder travel, retracted the section fully; otherwise, it kept the section unmoved [1]. Reference [1] is enumeration method and makes judgment only between two states of “retract fully” and “keep unmoved.” Thus the effect of optimization is very limited.
Mao Y et al. (2018) proposed a simplified Permutation and Combination (P&C) method that chose three states for each section to participate P&C; those were “hold at initial position,” “move to target position,” and “retract to full back” (actually, there are usually more states than these three. If there are number holes on a section, there will be number stretched states for the section). Took these three states of all sections to form state combinations and to participate P&C together, then eliminate the state combinations exceeding cylinder travel allowance (invalid solutions) by function evaluations, and finally, pick out the state combinations having the shortest paths (optimal solutions) from the remaining state combinations (valid solutions) [2]. P&C algorithm belongs to enumeration category, which can get optimal solutions in short time when boom sections are few. But if the number of boom sections increases, its calculation will grow up exponentially. Besides, the simplified handling that only three states for each section are chosen to form state combinations of all sections cannot describe all telescoping path possibilities.
Reference [3] (2018) is another method to calculate the TPO. The method evaluated permitted cylinder travel allowance starting from the endmost section back to the foremost section. Through two function evaluations of maximum permitted travel allowance and minimum permitted travel allowance, it was decided whether opening the side function evaluations or retracting one section full back and then continuing downward evaluations [3].
References [1–3] are enumeration methods in nature and are suitable for smallscale problems because their logic will be increasingly complicated with problem scales enlarging. Besides, these methods only pick out limited number of states of the holes locations to make judgments in order to simplify calculations and cannot reflect all the path possibilities, so their optimization effects are not very well.
TPO refers to the fact that when telescoping a multisection boom from an initial state to a target state, the number of telescoping steps is the smallest and the total travels of the driving cylinder is the shortest. TPO is essentially the shortestpath scheduling problem of combination optimization problem (COP). TPO aims to work out maximum retraction backmost combination (RBC); that is, the RBC position always exists while all sections retract from the initial position combination. After retracting sections to the RBC position, sections should be stretched to target position combination subsequently. RBC length is limited in the full travel of the long cylinder that is set as “1.” The TPO problem has the following features. Movements of sections should be operated in sequence. When one section is ready to be retracted or stretched, the current sufficiency of the travel allowance of the driving cylinder should be considered. Moreover, one section’s movement can affect other sections’ movability. Thus, TPO contains multiple constraints that associate with each other.
Smallscale COPs can be solved by exact algorithms, such as dynamic programming, branch definition, and enumeration. Heuristics can quickly calculate approximate optimal solutions for largescale complex problems, but their optimality cannot be guaranteed. Heuristics include neighbor algorithms, simulated annealing, evolutionary algorithms, and neural networks.
The Hopfield neural network (HNN) has advantages in solving COPs. In practical applications, when converting the objective function of the optimization problem to the energy equation of HNN to map variables to neural states in the network, HNN can be used to solve COPs. That is, when the neural state of the network tends to equilibrium, the energy equation of the network converges to minimum; the network’s convergence from initial state to steady state illustrates the optimization calculating process of the objective function [4].
The energy equation is convenient to constraints disposing, yet HNN has following difficulties: (I) the penalty parameters of energy equation are difficult to determine; (II) the convergence is often trapped in local minimum; (III) for problems of the optimal solutions distributing on boundary of constraints, the adjustments of constrained term sometimes conflict with the adjustment of objective term, which may cause oscillations near convergence point.
This study investigates the TPO problem. A mathematic model on the basis of the quadratic penalty function of HNN is constructed. Two strategies are presented to improve the performance of TPO model; one is the proportional integral derivative (PID) strategy that adaptively adjusts the parameter of the constrained term and parameter of the optimization objective term by controlling the value of constraint violation ; the other is efficiency factor strategy that an efficiency factor is introduced in model for prioritizing the constrained terms over the objective term.
Data test shows that compared with the path of boom length changing before optimization, both the number of sections that need to be moved and the total travels of cylinder can be reduced by 10%30% after optimization. Both the PID strategy and the efficiency factor strategy achieve good optimization effects. It is found that the main reason leading to the generations of low quality solution is the oscillations being triggered during convergence process. The efficiency factor strategy is excellent at moderating the conflict between the constrained term and the objective term and restrains the oscillations successfully thereby. The study consists of the following five parts. Section 1: Introduction. Section 2: SPMB mechanism and TPO problem. Section 3:: HNN method applied for TPO problem. Section 4: Simulation, analysis, and discussion. Section 5: Conclusion and prospect,
2. SPMB Mechanism and TPO Problem
2.1. SPMB Mechanism
Figure 1 illustrates an example of SPMB with five telescopic sections, which are denoted separately in signs of I, II, III, IV, and V. The length of each section is divided into four scales, and each scale has a hole set for being locked by pin of the inner adjacent section. Therefore, the different hole of the outer section being locked by the pin of the inner section determines the different stretching of the inner section. Let onesection length be defined as 1, and the hole locations are 0, 0.45, 0.9, and 1. The five telescopic sections of the boom length may be expressed as a combination , which means that Sections I and II are extended by 0.9, Sections III and IV are extended by 0.45, and Section V is not extended. To simplify the expression of section length combination, the holes locations 0, 0.45, 0.9, and 1 are replaced by four states of “1,” “2,” “3,” and “4,” respectively. Then, the mentioned section length combination is expressed in an array 3 3 2 2 1.
(a) Full retraction
(b) A boom stretching state
(c) Full extension
The array 1 1 1 1 1 in Figure 1(a) denotes the boom’s full retraction state, the array 3 3 2 2 1 in Figure 1(b) denotes the boom’s stretched state, and the array 4 4 4 4 4 in Figure 1(c) denotes the boom in full extension.
2.2. TPO Problem
A telescoping step means the whole procedure being executed when a section is moved. The procedure involves processes of the cylinder freely moving towards aimed section and the cylinder driving the aimed section to target position. The procedure of the cylinder movement is similar to a round trip; for example, when stretching a section, the leaving trip is the cylinder driving the section forwards to target position (), whereas the returning trip is the cylinder retracting itself backwards to the position of next section (). When retracting a section, the leaving trip is the cylinder driving the section backwards to target position () whereas the returning trip is the cylinder stretching itself to the position of next section (). Therefore, the optimization objective of TPO includes two parts: the shortest cylinder telescoping path and the shortest boom section telescoping path .
A boom with ntelescopic sections must run (2n1) times the above procedures (telescoping steps), n times are for retracting nsections full back; and (n1) times are for stretching nsections to target positions (because the endmost section can save one step for direct stretching from initial state to target state), if without optimization. Then, a boom with 5telescopic sections must run nine telescoping steps, if without optimization. The repeated operations of procedures mean heavy work and considerable time consumption. If TPO is performed, the telescoping steps can be reduced by one or two. Thus, energy consumption and labor intensity can be reduced, and work efficiency can be promoted in engineering applications. Table 1 shows an effect comparison before and after TPO.
 
Note: Sign “italic” denotes RBC. 
In Table 1, the initial state combination is 2 2 2 2 2, and the target state combination is 2 1 2 1 2. Without any optimization, RBC = 1 1 1 1 1. Eight steps are required to change from initial boom length to target boom length. The boom path length () is 3.6, and the cylinder path length () is 3.6. Thus, the total path length () is 7.2.
With optimization 1, RBC = 1 1 1 1 2, six steps are necessary, is 2.7, and the is 3.6. Therefore, is 6.3.
With optimization 2, RBC = 1 1 2 1 2 and with optimization 3, RBC = 2 1 1 1 2. Both RBCs only require four steps, is 1.8, and is 2.7. Thus, is 4.5.
Note that optimizations 2 and 3 are the optimal solutions, the steps required are the least, and the total paths are the shortest.
2.3. RBC
RBC is an extreme combination of retraction positions for sections when changing the boom length. After all sections are retracted to RBC state, sections should extend subsequently. The full retraction state 1 1 1 1 1 is always a valid RBC for sections, though the state is not an optimal RBC. Clearly, the larger the RBC, the shorter the path is, because only few retractions of sections being operated. Therefore, the optimization goal is to find the maximum RBC so as to achieve the minimum distances of boom retracting from the initial position to the RBC position and boom stretching from the RBC position to the target position. When the RBC is derived, the telescoping path can be listed out subsequently, as Table 1 listing.
2.4. SingleCylinder Travel Constraints during the Telescoping Process (Constraints)
Cylinder travel length must satisfy each step in each section during the telescoping process. Retraction or extension of any section is also performed. Whether the length of its former section is within the travel of the cylinder must be considered. The buildup evaluation equation of the cylinder travel allowance for each telescoping step is as follows:In (1), j is the current telescopic step, k is the current driven section, is the sum of the extension length of former (k1) sections, and = is the maximum extension required in Section . Herein, [k] is the target section length, and [k] is the initial section length.
2.5. Telescoping Path Definition (Optimization Objective)
Figure 2 demonstrates the telescoping process of a 5section boom and the total paths cylinder going through. Blue cycles indicate the initial and target positions of the sections. Orange cycles indicate the RBC positions of the sections. The white ring means the starting point of a cylinder (defined in zero). Values in brackets represent the potential energy height of the cylinder (absolute length). This measure cannot be over 1, which is the cylinder travel limit, at any time. Solid lines represent cylinder path , and dotted lines show boom path . Their equations are provided below: is the initial section state, is the target section state, is the RBC state, and d is the hole location combination. , . Figure 2 describes that the boom sections retract from 2 2 2 2 2 to 1 1 2 1 2 and then stretch from the RBC to T=2 1 2 1 2. During the telescoping process, the S_{boom} = 1.8, the S_{cylinder} = 2.7, and the total path is 4.5.
3. HNN Method Applied for TPO Problem
3.1. HNN Method
In 1982, American physicist John Joseph Hopfield proposed a neural network model, which vigorously promoted the study of neural networks [5]. Then Hopfield and Tank (1985) successfully used this model to find the solutions of the traveling salesman problem (TSP) [6]. However, matching parameters is always difficult, and improper parameters set leads to bad performance of HNN. In order to properly determine the weight coefficients of energy function, scientists have made a series of research. Shirazi B. and H. S. (1989) used a matrix method to analyze the dynamics of continuous HNN and thus analyze the basic characteristics, advantages, and disadvantages of the model [7]. Aiyer et al. (1990) explained why the Hopfield network often falls into an invalid solution in the TSP problem by means of analyzing matrix eigenvalues and hypercube mapping. Then, they modified the energy function and derived parameters setting principles to ensure that the network converges to a valid solution [8]. Abe S. (1993) analyzed the hypercube vertex condition as it becomes a local minimum. The author also provided a method for suppressing the inferior solution on the basis of which weights and coefficients of the energy equation are set [9]. Sun S. et al. (1995) simplified the equation of Aiyer et al.’s equation and demonstrated the validity of the penalty parameter determination based on Aiyer’s matrix eigenvalue analysis method. Their equation almost achieved a 100% valid solution obtained from the 10city TSP problem [10]. Subsequent researchers, such as Zhang J. et al. (1996), tested Sun’s network, but it was unable to obtain 100% valid solutions an only calculated 70% valid solutions after extensive examination of a fivecity TSP [11]. However, Sun’s equation is still a simple and efficient form for TSP problems. Pedro M. Talavan and Javier Yanez (2002) introduced a parameter setting method for a stable condition analysis using the valid solution of an energy equation. Once the parameters are determined by the analytical method, any stable point becomes a valid path for TSP [12]. Effati and Baymain (2005) proposed the parameters chosen from the constrained differential equations [13]. Effati S. et al. (2007) demonstrated that the neural network in the form of quadratic penalty function is a Lyapunov function with uniform convergence [14].
Equation of Sun Shouyu for TSP is listed as follows [10]:A and are parameters of the constrained terms; D is parameter of the objective term. Determinations of A, B, and follow principles of Aiyer’s matrix eigenvalue analysis. Seeing that the principles of Aiyer are complicated, we apply the quadratic penalty function to construct model but take adaptive method to determine parameters.
3.2. Permutation Matrix Representation of Section States
A permutation matrix is used to represent the sections and the corresponding positions of pins, where is the pinned position of the Section of RBC V; , with as the number of sections; , with as the number of pin holes; A is the initial state matrix; T is the target state matrix; V is the RBC state matrix; and is the pinhole location array, such as d = 0 0.45 0.9 1:The given example, matrix , denotes that RBC = 1 1 2 1 2; V × d denotes the extension length of boom sections.
3.3. Energy Equation of TPO
The energy function is given below:n is sections number and m is holes number of each section, supposing the hole distributions on each section are the same. There are total three terms in (7).
① Term B. Equality constrained term is the rowconstraint of permutation matrix . The term defines that each row in matrix has one and only one element “1,” and the remaining elements are “0.” Its physical meaning is that each section has one and only one hole being pinned.
② Term λ. Inequality constrained term is the rowconstrained term of RBC (V × d), which denotes the outstretched length of the section. This term is composed of number inequality constraints that are associated with one another. Its physical meaning is defined as the constraints on each section and on the stretching of each step. During the retraction and extension of Section x, the sum of the extension length of all previous (x1) sections plus the maximum extension required length of current Section must be less than or equal to “1” (total travel of a single cylinder). From the second term in (7), we can see that k = 1: when driving Section I, its maximum telescopic length should be less than the cylinder travel length “1,” k = 2: when driving Section II, the current extension of Section I plus the maximum telescopic length of Section II should be less than the cylinder travel length “1,” … k = n: when driving Section N, the current extensions of Sections I to (N1) plus the maximum telescopic length of Section N should be less than the cylinder travel length “1,”
③ Term γ. Optimization objective term is defined as the sum of squares of paths lengths (S_{cylinder} and S_{boom}) of each section retracting from the initial position to the RBC position and extending from the RBC position to the target position. Paths can only be minimized when the RBC of matrix takes a maximum.
B, λ, γ are term parameters of (7), where is the efficiency factor. When c = 1, efficiency factor does not work. Equation (11) reveals the relationship between the input and the output of neurons, in which the activation function is the hyperbolic tangent function. Furthermore, α is the ramp.
3.4. Dynamic Differential Equation
Dynamic differential equation is derived as follows:Let ; the second term of (13) can be expanded as follows:Equation (14) indicates that when being at the RBC state, the restraint for the extension of Section I ( × d) is at its strongest, which is (λ_{2}S_{2} + λ_{3}S_{3} + … + λ_{n}S_{n}). The restraint for the extension of Section II is slightly weak at (λ_{3}S_{3} + λ_{4}S_{4} +…+ λ_{n}S_{n}). No restraint exists for the extension of Section N. The given explanation is consistent with the reality that the endmost section (Section N) can arbitrarily retract and stretch since it will not influence the movement of other sections. Therefore, Section N is the most free. On the contrary, the length changing of the foremost section (Section I) will have a subsequent effect on the movements of all other sections. Thus, its freedom is the smallest, and its restraint is the strongest. Telescoping performed in sequence simply is to eliminate the associated influence on each section. In (14), Section I is subjected to the biggest penalty to minimize the stretching length ( × d) and release cylinder travel space for the retracting and stretching of subsequent sections.
Equation (15) is the dynamic updating equation, where is iteration step size.
3.5. PID Adaptive Parameter Adjustment Strategy
Matching penalty parameters is always difficult. The consequence of improper selection of parameters is that the convergence is trapped in local minimum and could not get optimal solution.
In order to escape the local optimal solution, there are generally some categories of strategies: one is to adjust the parameter and to change the weight values of the neural network. Since the weight values determine the shape of energy surface, the gradient descent path is changed thereby. PID adaptive parameter adjustment is in this way, which adaptively adjusts the descent path towards the lower point of energy loss by changing the shape of energy surface timely.
Other strategies are like that when the parameters and the input are constant; the shape of energy surface is determined. If the energy loss stops at a saddle point, there might have been a force to push it continuously descending, and the momentum strategy is in this way. If the energy loss is hard to converge to a balance point stably, the iteration step size can be regulated to help convergence, and the learning rate adjustment strategy is in this way [15].
Some other strategies are proposed by researchers to promote the searching effect of network. For example, the hill jumping algorithm divides energy function into two parts— and . Energy functions , , and are alternatively run, and their weights and bias are recorded. The weight and bias of one energy function are set as the new starting point of another energy function. Finally, a global minimum point is promisingly reached [16]. In addition, there are noise gradient strategy [17], Stable Manifold Theorem [18], noise chaotic neural network [19], noise vector strategy [20], method of increase training times [21], and so on.
Principles of PID adaptive parameter adjustment are as follows:
Associate Δλ with :
Associate Δγ with : is the proportional coefficient, is the integral coefficient, and is the differential coefficient. λ is the parameter of the constrained term of (7), equations (16) and (17) are the setting laws of λ, and the PID adaptive adjustment of λ is based on the control of constraint violation and is gradientrising. γ is the parameter of the objective term of (7), equations (18) and (19) are the setting laws of γ, and the PID adaptive adjustment of γ is based on the control of constraint violation and is gradientfalling. Figure 3 illustrates that are the PID adaptive curves for the constrained term, and are the PID adaptive curves for the objective term.
The adaptive parameter setting can often obtain good optimization effect. However, the PID parameters control may have conflict with the trend of gradient descending; when the two kinds of adjustments conflict on some equilibrium point, oscillations are triggered. Thus the network cannot converge to balance point stably. Moreover, the adaptive parameter setting is bounded. Thus, when parameter adjustment reaches the upper or the lower limit, adjustment strength does not change any more, thereby impeding the network converging to the global optimum. Basing on above difficulties, the further strategy for improvement is proposed.
3.6. Efficiency Factor Strategy
As a problem of the optimal solutions distributing on boundary of constraints, the adjustments of constrained terms sometimes conflict with the adjustment of objective terms, which may cause oscillations on equilibrium point. In addition, as the analysis in 3.5, the PID parameter adjustments may violate the gradient descent trend of the network, which also leads to oscillations on balance point. The main reason triggering oscillations is that the constraint parameter controls and the objective parameter controls are hard to balance. For example, when the constrained term dominates the descent, energy loss descends toward constraints satisfaction, whereas the optimization objective might not be satisfied. Therefore, in the next iteration, regulating strength for the objective term grows larger; thus the objective term dominates the descent and drives it toward the optimum, whereas the convergence might break away the domain of feasible solution and the constraints might not be satisfied. Such repeated processes lead to oscillations on the equilibrium point.
To solve the problem, one strategy is to convert the constrained optimization to multiobjective optimization. However, the higher the dimension of the multiobjective optimization, the more difficult the optimization model is to be calculated [22]. Therefore, this study takes another way that introduces an efficiency factor into the energy function to prioritize the constrained terms over the objective term.
The second term of (7) is the term for associated constraints. is the efficiency factor of Section k, k = . is the constraint violation of Section k, which belongs to . If Section is fully retracted, then the cylinder has full travel allowance and “1” for driving Section k, will be –1. If Section is fully extended, then the cylinder has no travel allowance, “0” for driving Section k, and will be 0. Generally, should be normalized, but because has been limited in the range of and has been limited to thereby does not need to be normalized here:Equation (20) indicates that when > 0, convergence is beyond the feasible domain, and then = 0. When –1 ≤ ≤ 0, convergence is within the feasible domain, and then is variable with changing. When = 0, network converges to the boundary of the feasible domain, which is the optimal solution, and then = 1. Figure 4 shows the curve of . c is the multiplication of as presented in (21).
4. Simulation, Analysis, and Discussion
4.1. Effect of TPO
Let n=5, m=4 in (7); that is, a SPMB has five telescopic sections, and four holes arranged on each section. The holes locations are the same for all sections. Parameters are set as shown in Table 2. Input the initial state A=2 2 2 2 2 and the target state T=2 1 2 1 2 and run the TPO HNN program to search for RBC state V.

Figure 5 shows the telescoping processes with four RBC states. In these figures, the color blocks represent the sections, and the blue dotted line is the singlecylinder travel “1.” Because the travel of cylinder driving section () can identify path length well, we use instead of the total travel of cylinder () to indicate the optimization effect.
(a) V=1 2 1 1 1
(b) V=1 1 1 1 1
(c) =1 1 2 1 2
(d) =2 1 1 1 2
If the RBC states are not well optimized or not optimized, the telescoping paths will require six steps, and will be 3.6, as shown in Figures 5(a) and 5(b). If the RBC states are well optimized, they will just require four steps, and will only be 1.8, as shown in Figures 5(c) and 5(d). The efficiency of boom length changing increases obviously after well optimization.
4.2. Improvement of the TPO HNN Model
The probability that energy loss converges to the saddle point is large because most natural objective functions have exponential saddle points. Such points are unstable, implying invalid solutions. Momentum strategy helps accelerate gradient descent in certain directions and suppress oscillation [23]. The given formula is the iterative formula of momentum strategy, where v(t–1) is the direction of the last iteration, is the momentum coefficient, is the learning rate (iteration step size), du(t) is the gradient, and u(t) is the output [24].
The descent can easily stuck in the saddle point, thereby leading to divergent oscillation with a fixed learning rate. The adaptive gradient algorithm (Adagrad) adaptively adjusts the learning rate. ε is a very small constant that prevents the denominator from becoming zero [25].
In order to improve the performance of TPO model, these two strategies are used in TPO model to compare the effects with PID strategy and efficiency factor strategy. In the following, six strategies are simulated, respectively: HNN, HNN with efficiency factor, HNN with PID adjustment, HNN with PID and efficiency factor mixed, HNN with momentum, and HNN with Adagrad. Five groups of data are tested, and each group runs 25 times. The iteration is 2,000, and is randomly generated. Parameter settings are as Table 2, and the results are listed in Table 3.

When parameters are set as constants, the performance of HNN model is not good. During the 25 runs of program, the obtained valid solutions percentage is lower than 50%. However, after introducing efficiency factor in the HNN model, the performance is evidently improved, and the obtained average valid solution percentage increases to 95%. The PID adaptive parameter adjustment strategy also performs well, and the obtained average valid solution percentage reaches 65%. The HNN with both PID and efficiency factor strategy also improves the results well, and the obtained average valid solution percentage is 70%.
Furthermore, the average optimal solution percentages obtained by the efficiency factor strategy, by the PID strategy, and by the PID and efficiency factor mixed strategy are the best. Thus either the PID strategy or the efficiency factor strategy is effective in promoting the solution qualities.
As a problem that its highquality solutions are scattered on the boundary of a feasible domain as Keane’s bump problem [26], the oscillations of TPO model are caused by the mutual conflicts of the constrained terms and the objective terms. Besides, the PID adaptive parameters control might have contradiction with the trend of gradient descending, which brings the convergence oscillations as well while the efficiency factor strategy is workable to balance the contradictions of the constrained terms and the objective terms.
Although the strategy of momentum and the strategy of changing learning rate are efficient to help the convergence escape saddle point, they do not work well here, since stopping at saddle point is not the reason of triggering the oscillations while TPO model converging.
In addition, PID adaptive parameter adjustment strategy has a slightly higher complexity than other methods. Thus, its calculation time is slightly longer than other methods.
4.3. Analysis of TPO Calculation Process
The efficiency factor strategy plays an important role in promoting the qualities of solutions derived from Table 3. Through comparing the convergences before and after efficiency factor strategy being added in the model, we can know how the efficiency factor strategy works.
The parameter settings are as in Table 2, the iteration is 5,000, the initial RBC () is fixed, and the same initial conditions are applied for the compared strategies. Test data are A = 2 1 3 3 1, T = 1 2 2 2 2. HNN with PID adaptive parameters, HNN with PID adaptive parameters and efficiency factor mixed, HNN with constant parameters and HNN with efficiency factor—these four strategies—are tested.
HNN PID strategy adaptively adjusts constrained parameter λ and objective parameter γ by controlling the constraint violation to close the zero which is the boundary of the feasible domain. are the constraint violations of the five sections, and is the sum of …. Figure 6(a) depicts the and changes in the process of the HNN PID network converging with as the initial input. When the iteration is over, obtains high cylinder travel allowance, –2.75, which indicates that the path is not fully optimized. Figure 6(b) demonstrates the and changes in the process of the HNN PID and efficiency factor mixed network converging with the same as the initial input. When the iteration is over, obtains little cylinder travel allowance, –0.5, which indicates that the path is well optimized when the efficiency factor is being added in the HNN PID model.
(a) control of HNN+PID strategy
(b) control of HNN+PID+c strategy
Figures 7(a) and 7(b) compare the solution V’s convergence process under the given conditions. Figure 7(a) shows that has oscillations triggered between “1” and “2” after the program iterates approximately 2,500 times. The reason is that when iterating to a certain extent, value of and value of are almost equal, and the definition of matrix is based on a “maximum pick” principle where the maximum value among the row elements is picked out as the output, and all else values are ignored. Thus, when two similar elements exist in the same row, a selection jumps between these two elements. Figure 7(b) shows that when efficiency factor is introduced into the PID strategy, the oscillations of do not happen, and it converges stably on “2.” The efficiency factor prioritizes the constrained terms over the objective terms and all the terms do not have to compete with each other. Thus, the oscillations are suppressed and the generations of high quality solutions are increased.
(a) V convergence of HNN+PID
(b) V convergence of HNN+PID+c
Figure 8(a) describes the scheduled telescoping path in solution V = 1 1 1 1 2, which is derived by PID strategy. The process requires eight steps from the initial state to the RBC state and then to the target state. S_{boom} is 4.05. Figure 8(b) illustrates the scheduled telescoping path in solution V = 1 1 1 2 2, which is derived by PID and efficiency factor mixed strategy. The process requires seven steps from the initial state to the RBC state and then to the target state. S_{boom} is 3.15. The efficiency factor strategy is useful to help the convergence to optimal solution.
(a) With HNN+PID strategy
(b) With HNN+PID+c strategy
Figure 9 demonstrates the energy loss curves with PID strategy before and after introducing in efficiency factor under the same initial conditions. Blue curve is the energy loss of PID strategy, which converges to minimum 10.482, corresponding to a valid solution V = 1 1 1 1 2. Red curve is the energy loss of PID mixed with efficiency factor strategy, which converges to minimum 5.9212, corresponding to an optimal V = 1 1 1 2 2. The comparison indicates that efficiency factor is helpful in converging to the optimal point.
Figure 10 demonstrates the energy loss curves of HNN with constant parameters strategy before and after introducing efficiency factor under the same initial conditions. Blue curve is the energy loss, which converges to minimum 6.5127, corresponding to an invalid solution V = 1 2 2 1 2. Red curve is the energy loss with efficiency factor strategy, which converges to minimum 0.30891, corresponding to an optimal V = 1 1 1 2 2. The comparison indicates that the efficiency factor greatly enhances the descent searching strength, thus making the energy loss converging to a global minimum. While having no efficiency factor strategy, the energy loss should have oscillated around an invalid solution.
In summary, both PID strategy and efficiency factor strategy are effective in improving the performance of the TPO model. The efficiency factor strategy has its advantages on balancing the conflicts between the constrained terms and objective terms, so it can lead to stable convergence efficiently and can get high quality solutions thereby.
5. Conclusion and Prospect
This study investigates the practical engineering optimization problem, TPO of SPMB. TPO aims to obtain the maximum RBC. During the SPMB telescoping process, the movement of each section is associated with each other and mutually restrained; that is, multiple associated constraints are involved in TPO problem. TPO is a strongly constrained problem with the optimal solutions scattered on constraint boundaries. In a word, TPO aims to obtain the largest RBC; thus the scheduled telescoping steps can be the least and the cylinder telescoping paths can be the shortest when SPMB changes its boom length.
The energy function model of HNN can mitigate the complexity of constraints processing; thus, this article constructs the TPO mathematical model in quadric penalty function form of HNN. In the energy function, seeing that determining the penalty parameters is difficult, a PID strategy is proposed that adaptively adjusts the penalty parameters λ of the constrained term and the penalty parameters γ of the optimization objective term by controlling constraint violation value . Moreover, the λ is set as gradientrising and the γ is set as gradientfalling according to the trend of the dynamic equation gradient descending. The overlapping region of λ and γ is the place for the optimization searching of the network, where the larger the optimization searching area, the more likely converging to highquality solution.
TPO belongs to the optimization category that optimal solutions scattered on boundary of feasible domain. The constrained terms and the objective terms are sometimes mutually exclusive, so they are difficult to be balanced. The oscillations being triggered sometimes on equilibrium point make the network hardly converge to global optimal. Beside, although the PID strategy is effective in driving the convergence towards the valid or the optimal solutions, the PID adaptive parameters control might have contradiction with the trend of gradient descending, which brings the oscillations on equilibrium point as well. Oscillation is the reason that the network could not converge efficiently.
The introduction of efficiency factor that prioritizes the constrained terms over the objective terms is efficient to solve the oscillation problem and gets the best generations of both valid and optimal solutions.
The simulation result shows that compared with the boom length changing before optimization, both the number of sections that need to be moved (scheduled telescoping steps) and the total travels of the cylinder can be reduced by 10%30% after optimization.
Compared to the effect of the HNN with constant parameters strategy, the HNN PID strategy can improve the valid solutions percentage from 50% to 65% while the HNN efficiency factor strategy is more efficient and improves the valid solutions percentage from 50% to 95%. The optimal solutions percentage obtained by efficiency factor strategy is the highest as well. In summary, the efficiency factor strategy is excellent at balancing the conflicts between the constrained terms and objective terms.
The PID strategy and the efficiency factor strategy are universal that can be applied for other problems solving. The HNN method for TPO problem is a universal model that can be applied to calculate the TPOs under various conditions; for example, the boom sections n, the holes number , and the holes location combination on each section are variable, not limited by n=5 and m=4, d= 0 0.45 0.9 1 of the example being illustrated in the article. In addition, the HNN method can be used to the TPOs of complex SPMB mechanisms; for example, the holes number and the holes locations are various for every section.
Although the HNN model with PID strategy and the HNN model with efficiency factor strategy both obtain good results, there are flaws that should be attended,(I)PID adaptive parameters adjustment strategy has to determine the proportional coefficient , the integral coefficient , and the differential coefficient ; thus it is not the fully selfadaptive strategy.(II)The searching algorithm basing on gradient descent method is hard to obtain 100% valid solutions, and the generation of optimal solutions is not high generally.
In future, the genetic algorithm (GA) could be used to calculate TPOs, seeing that GA only requires the optimized objectives being computable, and no need being continuous and differentiable; besides, GA is based on population evolution that converges to global optimums, so it can overcome the weaknesses of traditional algorithms based on gradient optimization.
Data Availability
The [DATA programs] data used to support the findings of this study are available from the corresponding author upon request.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
References
 C. Zhan, Q. Liu, J. Guo et al., “Singlecylinder pintype telescopic boom track optimized control method and control system thereof,” Tech. Rep. WO/2011/038633, 2011. View at: Google Scholar
 Y. Mao and K. Chen, “Sequential telescopic path optimization method of singlecylinder pintype multisection boom,” Tech. Rep. CN106744386B, 2018 (Chinese). View at: Google Scholar
 Y. Mao and K. Chen, “An efficient sequential telescopic path optimization method of singlecylinder pintype multisection boom,” Tech. Rep. CN106744389B, 2018 (Chinese). View at: Google Scholar
 U.P. Wen, K.M. Lan, and H.S. Shih, “A review of Hopfield neural networks for solving mathematical programming problems,” European Journal of Operational Research, vol. 198, no. 3, pp. 675–687, 2009. View at: Publisher Site  Google Scholar  MathSciNet
 J. J. Hopfield, “Neural networks and physical systems with emergent collective computational abilities,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 79, no. 8, pp. 2554–2558, 1982. View at: Publisher Site  Google Scholar  MathSciNet
 J. J. Hopfield and D. W. Tank, “Neural computation of decisions in optimization problems,” Biological Cybernetics, vol. 52, no. 3, pp. 141–152, 1985. View at: Google Scholar  MathSciNet
 B. Shirazi and S. Yih, “Critical analysis of applying Hopfield neural net model to optimization problems,” in Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, vol. 1, pp. 210–215, 1989. View at: Google Scholar
 S. Aiyer, M. Niranjan, and F. Fallside, “A theoretical investigation into the performance of the Hopfield model,” IEEE Transactions on Neural Networks and Learning Systems, vol. 1, no. 2, pp. 204–215, 1990. View at: Publisher Site  Google Scholar
 S. Abe, “Global convergence and suppression of spurious states of the Hopfield neural networks,” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 40, no. 4, pp. 246–257, 1993. View at: Publisher Site  Google Scholar  MathSciNet
 S. Shouyu and J. Zheng, “A modified algorithm and theoretical analysis for hopfield network solving TSP,” Acta Electronica Sinica, 1995 (Chinese). View at: Google Scholar
 J. Zhang, “Theoretical analysis and improvement of the neural network to solve the TSP problem,” Journal of Xidian University, vol. 23, 1996 (Chinese). View at: Google Scholar
 P. M. Talaván and J. Yáñez, “Parameter setting of the Hopfield network applied to TSP,” Neural Networks, vol. 15, no. 3, pp. 363–373, 2002. View at: Publisher Site  Google Scholar
 S. Effati and M. Baymani, “A new nonlinear neural network for solving convex nonlinear programming problems,” Applied Mathematics and Computation, vol. 168, no. 2, pp. 1370–1379, 2005. View at: Publisher Site  Google Scholar
 S. Effati and M. Jafarzadeh, “A new nonlinear neural network for solving a class of constrained parametric optimization problems,” Applied Mathematics and Computation, vol. 186, no. 1, pp. 814–819, 2007. View at: Publisher Site  Google Scholar
 S. Ruder, “An overview of gradient descent optimization algorithms,” 2016. View at: Google Scholar
 R. Wang, S. Guo, and K. Okazaki, “A hilljump algorithm of Hopfield neural network for shortest path problem in communication network,” Soft Computing, vol. 13, no. 6, pp. 551–558, 2009. View at: Publisher Site  Google Scholar
 L. Wang and F. Tian, “Noisy chaotic neural networks for solving combinatorial optimization problems,” in Proceedings of the IEEEINNSENNS International Joint Conference on Neural Networks (IJCNN '00), vol. 4, pp. 37–40, IEEE, Como, Italy, 2000. View at: Publisher Site  Google Scholar
 L. Perko, Differential Equations and Dynamical Systems, Springer, 2001.
 R. Ge, F. Huang, C. Jin, and Y. Yuan, “Escaping from saddle points: online stochastic gradient for tensor decomposition,” Journal of Machine Learning Research, vol. 40, no. 2015, 2015. View at: Google Scholar
 A. ElBouri, S. Balakrishnan, and N. Popplewell, “A neural network to enhance local search in the permutation flowshop,” Computers & Industrial Engineering, vol. 49, no. 1, pp. 182–196, 2005. View at: Publisher Site  Google Scholar
 H. Qu, Z. Yi, and H. Tang, “Improving local minima of columnar competitive model for TSPs,” IEEE Transactions on Circuits and Systems I: Regular Papers, vol. 53, no. 6, pp. 1353–1362, 2006. View at: Publisher Site  Google Scholar
 Y. Wang, Z. Cai, G. Guo, and Y. Zhou, “Multiobjective optimization and hybrid evolutionary algorithm to solve constrained optimization problems,” IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 37, no. 3, pp. 560–575, 2007. View at: Publisher Site  Google Scholar
 M. Nielsen, “Neural networks and deep learning,” 2016. http://neuralnetworksanddeeplearning.com/. View at: Google Scholar
 N. Qian, “On the momentum term in gradient descent learning algorithms,” Neural Networks, vol. 12, no. 1, pp. 145–151, 1999. View at: Publisher Site  Google Scholar
 J. Duchi, E. Hazan, and Y. Singer, “Adaptive subgradient methods for online learning and stochastic optimization,” Journal of Machine Learning Research, vol. 12, no. 7, pp. 257–269, 2011. View at: Google Scholar  MathSciNet
 M. Schoenauer and Z. Michalewicz, “Boundary operators for constrained optimization problems,” in Proceedings of the 7th International Conference on Genetic Algorithms, T. Baeck, Ed., pp. 322–329, Morgan Kaufmann Publishers, San Mateo, Calif, USA, 1997. View at: Google Scholar
Copyright
Copyright © 2019 Yan Mao and Kai Cheng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.