Abstract:
A single-cylinder pin-type telescopic boom track optimized control method and control system thereof are applied to switch between any two working conditions of any sections of a telescopic boom. The method and system establish a constrained condition according to the stroke of a telescopic oil cylinder. When the telescopic boom is changed from the current state A to the target state B, the most rapid and convenient telescopic path can be obtained based on the current position of the pin mechanism and other conditions. The method and system greatly improve the telescopic reliability and work efficiency of the single-cylinder pin-type telescopic boom, and are applied to the telescopic boom of any engineering machine, in particular to the telescopic boom of a heavy duty crane.

Description:
[0001]    The present application claims the priority of Chinese Patent Application No. 200910178572.8, entitled as “Single-Cylinder Pin-Type Telescopic Boom Track Optimized Control Method and Control System Thereof”, and filed with the Chinese Patent Office on Sep. 29, 2009, the contents of which are incorporated herein by reference in its entirety. 
       FIELD OF THE INVENTION 
       [0002]    The present invention relates to a single-cylinder pin-type telescopic boom control method, in particular to a single-cylinder pin-type telescopic boom track optimized control method. 
       BACKGROUND OF THE INVENTION 
       [0003]    The telescopic structures of telescopic booms applied in existing engineering machines are available in two types: telescopic hydraulic cylinder and rope set type and single-cylinder pin-type. For a heavy-duty crane with 5 or more sections of booms, only the single-cylinder pin-type structure is applicable, due to the limitation of the structural form. 
         [0004]    The working principle of single-cylinder pin-type telescopic mechanism is: a telescopic oil cylinder is mounted in the boom, a pin mechanism is mounted in the head of the telescopic oil cylinder, and a working pin is arranged on the pin mechanism. Each section of boom has bearing pin holes distributed at approx. 0%, 46%, 90%, and 100% positions in length direction and a working pin hole at the tail end; in addition, each section of boom has a bearing pin at the tail end to lock up adjacent sections of boom to each other. When the boom extends or retracts, the telescopic oil cylinder drives the bolt mechanism to the tail of the section j, the telescopic oil cylinder is locked to the section j by extending the working pin, and the bearing pin of the section j inserted into section j−1 is retracted. When the telescopic oil cylinder extends (retracts), the section j moves with the telescopic oil cylinder (extends or retracts); when the target position is reached, the pin mechanism release the bearing pin, so that the section j is locked to the section j−1 relatively, and thereby the extension/retraction action of the section j is accomplished. Repeated in that way, the extension/retraction of each section is accomplished, and thereby the extension/retraction action of the entire boom is accomplished finally. 
         [0005]    However, in the process of transition from state A to state B, the existing technical scheme is: the boom is transited from state A to fully retracted state first, and then the sections are extended according to the required target state, to reach to state B. In that way, unnecessary telescopic actions of sections are executed; thus, unnecessary actions of relevant parts including boom slide blocks, telescopic oil cylinder, pin mechanism, and engine happen. Apparently, such a transition approach has a drawback of low extension/retraction efficiency. Especially, in every unnecessary action of pulling out the pin, the pin mechanism bears boom impact as high as tens of tons, and thus the service life of pin mechanism is severely shortened; it is well-known that terrible consequences such as equipment damage and personal injury or death may occur once the pin mechanism fails. 
         [0006]    Actually, for a crane with a boom composed of n sections with four bearing pin holes on each section, for example, the boom may have 4 n  position states and P(4 n ,2) transitions between two states. For example, a telescopic boom composed of five sections may have 4×4×4×4×4=1024 states, that is to say, there are 4 5 !/(4 5 −2)!=1024!/1022!=1047552 switching ways between two states. 
         [0007]    In view of above problem, it is urgent task to optimize the track control of existing single-cylinder pin-type telescopic booms, to adapt to the switching between any two states of a boom composed of any number of sections. 
       SUMMARY OF THE INVENTION 
       [0008]    In view of the drawback described above, the object of the present invention is to provide a single-cylinder pin-type telescopic boom track optimized control method, which determines the optimal sequence of actions of the sections between two states among the numerous switching ways, and thereby obtain the most rapid and convenient telescopic path. On that basis, the present invention further provides a single-cylinder pin-type telescopic boom track optimized control system. 
         [0009]    The single-cylinder pin-type telescopic boom track optimized control method provided in the present invention comprises the following steps: 
         [0010]    (1) Obtain an initial state array A[a 1 , a 2 , a 3 , a j , . . . , a n ] and a target state array B[b 1 , b 2 , b 3 , b j , b n ] of a telescopic boom; wherein, n is the number of sections of the telescopic boom, j is an integer that meets 1≦j≦n, and it represents any section of the telescopic boom; a j  and b j  are integers between 0˜k−1, respectively, and represent that a section is locked via a bearing pin to one of the k pin holes in the previous section; obtain the section n_code of the telescopic boom where a telescopic mechanism is; 
         [0011]    (2) Calculate with the following formula to obtain an intermediate parameter S x , and establish the constrained conditions for stroke of a telescoping cylinder according to the intermediate parameter and physical relationship: 
         [0000]    
       
         
           
             
               
                 S 
                 x 
               
               = 
               
                 
                   
                     ∑ 
                     j 
                     
                       x 
                       - 
                       1 
                     
                   
                    
                   
                     a 
                     m 
                   
                 
                 + 
                 
                   Max 
                    
                   
                     ( 
                     
                       
                         a 
                         x 
                       
                       , 
                       
                         b 
                         x 
                       
                     
                     ) 
                   
                 
               
             
             , 
             wherein 
             , 
             
               x 
               = 
               i 
             
             , 
             
               i 
               - 
               1 
             
             , 
             
               
                 
                   … 
                    
                   
                       
                   
                    
                   j 
                 
                 + 
                 1 
               
               ; 
             
           
         
       
     
         [0012]    (3) Determine whether the constrained conditions are met, and adjust the path vector for each transition from the initial state array to the target state array according to the determination result; 
         [0013]    (4) Output a control signal to a pin mechanism and the telescoping cylinder according to the path vector, adjust the coordinated action between the pin mechanism and the telescoping cylinder, so as to control the sequence of actions of the sections in the switching process from the initial state to the target state. 
         [0014]    Preferably, in step (2), calculate with the formula to obtain the intermediate parameter S x  after the following steps are executed: 
         [0015]    (21) set i=n, and set the intermediate variable to zero; 
         [0016]    (22) Determine whether a i  is equal to b i ; if negative, execute step (23); 
         [0017]    (23) j=1, obtain the arrays A 1  and B 1 , with the last equal terms eliminated; 
         [0018]    In step (3), the path vector is obtained by calculating through the following steps: 
         [0019]    (31) Determine whether S i  is greater than 2; if positive, execute step (32); 
         [0020]    (32) Determine whether each S x −1 is less than or equal to 2; if positive, execute step (321), and Cj=substitute term j in A 1  with Min(1,b j ); otherwise execute step (322), and Cj=substitute term j in A 1  with 0; 
         [0021]    (33) Determine whether Cj is equal to B 1 ; if positive, execute step (34); otherwise set A 1 =Cj, gg x =j, j=j+1, and then return to step (2); 
         [0022]    (34) Combine the similar terms in arrays C 1 , C 2 , C 3 , . . . , add and complete the last invariable terms, and then output the result. 
         [0023]    Preferably, if the determination result in step (22) is positive, execute step (24) and then return to step (22); 
         [0024]    Step (24), set i=i−1. 
         [0025]    Preferably, if the determination result in step (31) is negative, execute the following steps: 
         [0026]    (40) Set j=1; 
         [0027]    (41) Determine whether gg x  is equal to 0; if positive, execute step (42); otherwise set n_code=gg x , and then execute step (42); 
         [0028]    (42) Determine whether n_code is smaller than i; if positive, execute step (43); otherwise execute step (45); 
         [0029]    (43) Dj=substitute the term n_code in A 1  with b n     —     code , and calculate with the following formula to obtain the intermediate parameter S x : 
         [0000]    
       
         
           
             
               
                 S 
                 x 
               
               = 
               
                 
                   
                     ∑ 
                     j 
                     
                       x 
                       - 
                       1 
                     
                   
                    
                   
                     a 
                     m 
                   
                 
                 + 
                 
                   Max 
                    
                   
                     ( 
                     
                       
                         a 
                         x 
                       
                       , 
                       
                         b 
                         x 
                       
                     
                     ) 
                   
                 
               
             
             , 
             wherein 
             , 
             
               x 
               = 
               i 
             
             , 
             
               i 
               - 
               1 
             
             , 
             
               
                 … 
                  
                 
                     
                 
                  
                 n_code 
               
               ; 
             
           
         
       
     
         [0030]    (44) Determine whether each S x  is less than or equal to 2; if negative, execute step (45); 
         [0031]    (45) Dj=substitute the term i in A 1  with b i , set gg x =i; 
         [0032]    (46) Determine whether Dj is equal to B 1 ; if positive, execute step (47); 
         [0033]    (47) Combine the similar terms in arrays C 1 , C 2 , C 3 , . . . , D 1 , D 2 , D 3 , . . . , add and complete the last invariable terms, and then output the result. 
         [0034]    Preferably, if the determination result in step (44) is positive, execute step (51); 
         [0035]    (51) Dj=substitute the term n_code in A 1  with b n     —     code , set gg x =n_code and N=True, and then execute step (46); 
         [0036]    Preferably, if the determination result in step (46) is negative, execute the following steps: 
         [0037]    (61) Determine whether N is True; if positive, set N=False and then execute step (62); otherwise set i=i−1 and then execute step (62); 
         [0038]    (62) Set A 1 =Dj, j=j+1, Dj=substitute the term i in A 1  with b i , gg x =i, and then execute step (46). 
         [0039]    Preferably, execute step (25) after step (23): 
         [0040]    (25) Determine whether only a i  is not equal to 0 in A 1 , if positive, execute step (40); otherwise continue to execute step (2); and Set the minimum value of x to 2 in step (43). 
         [0041]    Preferably, execute step (323) after step (321): 
         [0042]    (323) Solve S i  from Cj and B 1 , determine whether S i  is greater than 2; if positive, execute step (322); otherwise execute step (33). 
         [0043]    The single-cylinder pin-type telescopic boom track optimized control system provided in the present invention comprises: 
         [0044]    an input unit, configured to obtain the initial state array A[a 1 , a 2 , a 3 , . . . a j , . . . , a n ] and target state array B[b 1 , b 2 , b 3 , . . . , b j , . . . , b n ] of a telescopic boom; wherein, n is the number of sections of the telescopic boom, j is an integer that meets 1≦j≦n, and it represents any section of the telescopic boom; a j  and b j  are integers between 0˜k−1, respectively, and represent that a section is locked via a bearing pin to one of the k pin holes in the previous section; obtain the section n_code of telescopic boom where a telescopic mechanism is; 
         [0045]    a controller, configured to calculate with the following formula to obtain an intermediate parameter S x , and establish the constrained conditions for stroke of a telescoping cylinder according to the intermediate parameter and physical relationship: 
         [0000]    
       
         
           
             
               
                 S 
                 x 
               
               = 
               
                 
                   
                     ∑ 
                     j 
                     
                       x 
                       - 
                       1 
                     
                   
                    
                   
                     a 
                     m 
                   
                 
                 + 
                 
                   Max 
                    
                   
                     ( 
                     
                       
                         a 
                         x 
                       
                       , 
                       
                         b 
                         x 
                       
                     
                     ) 
                   
                 
               
             
             , 
             wherein 
             , 
             
               x 
               = 
               i 
             
             , 
             
               i 
               - 
               1 
             
             , 
             
               
                 
                   … 
                    
                   
                       
                   
                    
                   j 
                 
                 + 
                 1 
               
               ; 
             
           
         
       
     
         [0046]    determine whether the constrained conditions are met, and adjust the path vector for each transition from the initial state array to the target state array according to the determination result; and 
         [0047]    an output unit, configured to output a control signal to a pin mechanism and the telescoping cylinder according to the path vector, adjust the coordinated action between the pin mechanism and the telescoping cylinder, so as to control the sequence of actions of the sections in the switching process from the initial state to the target state. 
         [0048]    The single-cylinder pin-type telescopic boom track optimized control method is applicable to switching between any two working states of a telescopic boom composed of any number of sections. The present invention determines the constrained conditions according to the stroke of the telescopic oil cylinder, and can be used to obtain the most rapid and convenient telescopic path on the basis of the current position of the pin mechanism and other conditions, when the telescopic boom transits from the current state A to a target state B. Compared to the prior art, the present invention can greatly improve the telescopic reliability and working efficiency of single-cylinder pin-type telescopic booms. 
         [0049]    The single-cylinder pin-type telescopic boom track optimized control method and system thereof provided in the present invention are applicable to the single-cylinder pin-type telescopic booms on any engineering machines, especially telescopic booms on heavy duty cranes. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0050]      FIG. 1  is a flow chart of an embodiment of the single-cylinder pin-type telescopic boom track optimized control method disclosed in the present invention; 
           [0051]      FIG. 2  is a flow chart of another embodiment of the single-cylinder pin-type telescopic boom track optimized control method disclosed in the present invention; 
           [0052]      FIG. 3  is a block diagram of the single-cylinder pin-type telescopic boom track optimized control system described in the embodiments of the present invention. 
       
    
    
     DETAILED DESCRIPTION OF THE EMBODIMENTS 
       [0053]    Based on the existing single-cylinder pin-type telescopic mechanisms, the core of the present invention is to establish a mathematical model, determine the constrained conditions according to the stroke of telescopic oil cylinder, and obtain the most rapid and convenient telescopic path with an optimized method, so as to effectively improve the telescopic reliability and working efficiency of single-cylinder pin-type telescopic booms. 
         [0054]    Hereunder the embodiments of the present invention will be detailed, with reference to the accompanying drawings. 
         [0055]    Please refer to  FIG. 3 , which is a block diagram of the single-cylinder pin-type telescopic boom track optimized control system in the embodiments of the present invention. 
         [0056]    The single-cylinder pin-type telescopic boom track optimized control system comprises an input unit  10 , a controller  20 , and an output unit  30 . 
         [0057]    wherein, the input unit  10  is configured to obtain the initial state array A[a 1 , a 2 , a 3 , . . . a j , . . . , a n ] and target state array B[b 1 , b 2 , b 3 , . . . , b j , . . . , b n ] of a telescopic boom; wherein, n is the number of sections of the telescopic boom, j is an integer that meets 1≦j≦n, and it represents any section of telescopic boom; a j  and b j  are integers between 0˜k−1, respectively, and represent that a section is locked via a bearing pin to one of the k pin holes in the previous section; obtain the section n_code of telescopic boom where the telescopic mechanism is. It is noted that the layout of bearing pin holes in each section of boom meets the following requirements: the sum of distances between adjacent three holes in any section A+distance between adjacent two holes in any other section B&gt;telescopic stroke of the telescopic oil cylinder. It is understood that at least the distances between the adjacent three holes near the tail of the boom meet above requirements. 
         [0058]    Wherein, the controller  20  is configured to calculate with the following formula to obtain an intermediate parameter S x , and establish the constrained conditions for stroke of the telescoping cylinder according to the intermediate parameter and the physical relationship: 
         [0000]    
       
         
           
             
               
                 S 
                 x 
               
               = 
               
                 
                   
                     ∑ 
                     j 
                     
                       x 
                       - 
                       1 
                     
                   
                    
                   
                     a 
                     m 
                   
                 
                 + 
                 
                   Max 
                    
                   
                     ( 
                     
                       
                         a 
                         x 
                       
                       , 
                       
                         b 
                         x 
                       
                     
                     ) 
                   
                 
               
             
             , 
             wherein 
             , 
             
               x 
               = 
               i 
             
             , 
             
               i 
               - 
               1 
             
             , 
             
               
                 
                   … 
                    
                   
                       
                   
                    
                   j 
                 
                 + 
                 1 
               
               ; 
             
           
         
       
     
         [0059]    determine whether the constrained conditions are met, and adjust the path vector for each transition from the initial state array to the target state array according to the determination result. 
         [0060]    Wherein, the output unit  30  is configured to output a control signal to the pin mechanism and telescoping cylinder according to the path vector, adjust the coordinated action between the pin mechanism and the telescoping cylinder, so as to control the sequence of actions of the sections in the switching process from the initial state to the target state. 
         [0061]    The control method employed by the system is shown in  FIG. 1 , which is a flow chart of the first embodiment of the optimized control method disclosed in the present invention. 
         [0062]    As shown in the Figure, the control method comprises the following steps: 
         [0063]    (1) Obtain the initial state array A[a 1 , a 2 , a 3 , . . . a j , . . . , a n ] and target state array B[b 1 , b 2 , b 3 , . . . , b j , . . . , b n ] of a telescopic boom; wherein, n is the number of sections of the telescopic boom, j is an integer that meets 1≦j≦n, and it represents any section of telescopic boom; a j  and b j  are integers between 0˜k−1, respectively, and represent that a section is locked via a bearing pin to one of the k pin holes in the previous section; obtain the section n_code of telescopic boom where the telescopic mechanism is. It is understood that the number of sections of the telescopic boom and the number of pin holes in each section can be arranged freely as required. 
         [0064]    (2) Calculate with the following formula to obtain an intermediate parameter S x , and establish the constrained conditions for stroke of the telescoping cylinder according to the intermediate parameter and the physical relationship: 
         [0000]    
       
         
           
             
               
                 S 
                 x 
               
               = 
               
                 
                   
                     ∑ 
                     j 
                     
                       x 
                       - 
                       1 
                     
                   
                    
                   
                     a 
                     m 
                   
                 
                 + 
                 
                   Max 
                    
                   
                     ( 
                     
                       
                         a 
                         x 
                       
                       , 
                       
                         b 
                         x 
                       
                     
                     ) 
                   
                 
               
             
             , 
             wherein 
             , 
             
               x 
               = 
               i 
             
             , 
             
               i 
               - 
               1 
             
             , 
             
               
                 
                   … 
                    
                   
                       
                   
                    
                   j 
                 
                 + 
                 1 
               
               ; 
             
           
         
       
     
         [0065]    (3) Determine whether the constrained conditions are met, and adjust the path vector for each transition from the initial state array to the target state array according to the determination result; 
         [0066]    (4) Output a control signal to the pin mechanism and telescoping cylinder according to the path vector, adjust the coordinated action between the pin mechanism and the telescoping cylinder, so as to control the sequence of actions of the sections in the switching process from the initial state to the target state. 
         [0067]    Preferably, in step (2), calculate with the formula to obtain the intermediate parameter S x  after the following steps are executed: 
         [0068]    (21) i=n, set the intermediate variable to zero; 
         [0069]    (22) Determine whether a i  is equal to b i ; if negative, execute step (23); 
         [0070]    (23) j=1, obtain the arrays A 1  and B 1 , with the last equal terms eliminated; In step (3), the path vector is obtained by calculating through the following steps: 
         [0071]    (31) Determine whether S i  is greater than 2; if positive, execute step (32); 
         [0072]    (32) Determine whether each S x −1 is less than or equal to 2; if positive, execute step (321), and Cj=substitute term j in A 1  with Min(1, b j ); otherwise execute step (322), and Cj=substitute term j in A 1  with 0; 
         [0073]    (33) Determine whether Cj is equal to B 1 ; if positive, execute step (34); otherwise set A 1 =Cj, gg x =j, j=j+1, and then return to step (2); 
         [0074]    (34) Combine the similar terms in arrays C 1 , C 2 , C 3 , . . . , add and complete the last invariable terms, and then output the result. 
         [0075]    Preferably, if the determination result in step (22) is positive, execute step (24) and then return to step (22): 
         [0076]    Step (24), set i=i−1. 
         [0077]    Preferably, if the determination result in step (31) is negative, execute the following steps: 
         [0078]    (40) Set j=1; 
         [0079]    (41) Determine whether gg x  is equal to 0; if positive, execute step (42); otherwise set n_code=gg x , and then execute step (42); 
         [0080]    (42) Determine whether n_code is smaller than i; if positive, execute step (43); otherwise execute step (45); 
         [0081]    (43) Dj=substitute the term n_code in A 1  with b n     —     code , and calculate with the following formula to obtain the intermediate parameter S x : 
         [0000]    
       
         
           
             
               
                 S 
                 x 
               
               = 
               
                 
                   
                     ∑ 
                     j 
                     
                       x 
                       - 
                       1 
                     
                   
                    
                   
                     a 
                     m 
                   
                 
                 + 
                 
                   Max 
                    
                   
                     ( 
                     
                       
                         a 
                         x 
                       
                       , 
                       
                         b 
                         x 
                       
                     
                     ) 
                   
                 
               
             
             , 
             wherein 
             , 
             
               x 
               = 
               i 
             
             , 
             
               i 
               - 
               1 
             
             , 
             
               
                 … 
                  
                 
                     
                 
                  
                 n_code 
               
               ; 
             
           
         
       
     
         [0082]    (44) Determine whether each S x  is less than or equal to 2; if negative, execute step (45); 
         [0083]    (45) Dj=substitute the term i in A 1  with b i , set gg x =i; 
         [0084]    (46) Determine whether Dj is equal to B 1 ; if positive, execute step (47); 
         [0085]    (47) Combine the similar terms in arrays C 1 , C 2 , C 3 , . . . , D 1 , D 2 , D 3 , . . . , add and complete the last invariable terms, and then output the result. 
         [0086]    Preferably, if the determination result in step (44) is positive, execute step (51): 
         [0087]    (51) Dj=substitute the term n_code in A 1  with b n     —     code , set gg x =n_code and N=True, and then execute step (46); 
         [0088]    Preferably, if the determination result in step (46) is negative, execute the following steps: 
         [0089]    (61) Determine whether N is True; if positive, set N=False and then execute step (62); otherwise set i=i−1 and then execute step (62); 
         [0090]    (62) Set A 1 =Dj, j=j+1, Dj=substitute the term i in A 1  with b i , gg x =i, and then execute step (46). 
         [0091]    Without loss of generality, hereunder the present invention will be described in an example of a telescopic boom composed of five sections, with four bearing pin holes in each section: 
         [0092]    Current state array of boom: A[1, 1, 2,0, 0] 
         [0093]    Target state array: B[2,0, 3, 1, 1] 
         [0094]    The section where the telescopic mechanism is: n_code=2 
         [0095]    1. Step (21): set i=5 (total number of sections), gg x =0 (clear the section gg x  where the telescopic mechanism is in the switching process to zero); 
         [0096]    Step (22): a 5 =0, b 5 =1, and the determination result is negative; 
         [0097]    Step (23): Set j=1, since there is no equal term between the current state array of boom A[1,1,2,0,0] and target state array B[2,0,3,1,1], then obtain A 1 [1,1,2,0,0], B 1  [2,0,3,1,1]. 
         [0098]    Step (2): Set x=5, 4, 3, 2, respectively, and solve S 5 , S 4 , S 3 , and S 2 , respectively: 
         [0000]    
       
         
           
             
               
                 S 
                 5 
               
               = 
               
                 
                   
                     
                       ∑ 
                       1 
                       4 
                     
                      
                     
                       a 
                       m 
                     
                   
                   + 
                   
                     Max 
                      
                     
                       ( 
                       
                         
                           a 
                           5 
                         
                         , 
                         
                           b 
                           5 
                         
                       
                       ) 
                     
                   
                 
                 = 
                 
                   
                     
                       a 
                       1 
                     
                     + 
                     
                       a 
                       2 
                     
                     + 
                     
                       a 
                       3 
                     
                     + 
                     
                       a 
                       4 
                     
                     + 
                     
                       b 
                       5 
                     
                   
                   = 
                   5 
                 
               
             
             ; 
           
         
       
     
         [0099]    Likewise, it is calculated that S 4 =5; S 3 =5, S 2 =2; 
         [0100]    Step (32): Cj=substitute the term j in A 1  with 0, according to the flow chart; 
         [0101]    Then: C 1 =[0,1,2,0,0] - - - gg x =1 
         [0102]    Step (33): Since C 1 =[0,1,2,0,0] is not equal to B 1 [2,0,3,1,1], go back to execute step (2). 
         [0103]    2. i=5, j=2, A 1 =[0,1,2,0,0], B 1 =[2,0,3,1,1], 
         [0104]    i.e., set x=5, 4, 3, and solve S 5 , S 4 , and S 3 , respectively 
         [0105]    S 5 =4, S 4 =4, S 3 =4; 
         [0106]    Cj=substitute the term j in A 1  with 0, according to the flow chart; 
         [0107]    Then: C 2 =[0,0,2,0,0] - - - gg x =2 
         [0108]    Similarly, since C 2 =[0,0,2,0,0] is not equal to B 1 [2,0,3,1,1], go back to execute step (2). 
         [0109]    3. i=5, j=3, A 1 =[0,0,2,0,0], B 1 =[2,0,3,1,1], i.e., set x=5, 4, and solve S 5  and S 4  respectively; 
         [0110]    S 5 =3, S 4 =3; 
         [0111]    Cj=substitute the term j in A 1  with Min(1, b j ), according to the flow chart; 
         [0112]    Then: C 3 =[0,0,1,0,0] - - - gg x =3 
         [0113]    It is noted that C 3 =[0,0,0,0,0] - - - gg x =3 if the optimized procedure is not executed; 
         [0114]    Similarly, since C 3 =[0,0,1,0,0] is not equal to B 1 [2,0,3,1,1], go back to execute step (2). 
         [0115]    4. i=5, j=4, A 1 =[0,0,1,0,0], B 1 =[2,0,3,1,1], i.e., set x=5, and solve S 5 ; 
         [0116]    S5=2; since S 5  is not greater than 2, execute: 
         [0117]    Step (40): Set j=1; 
         [0118]    Step (41): Since gg x =3 is not equal to 0, then n_code=gg x =3; 
         [0119]    Step (42): Since n_code=3 is smaller than i; 
         [0120]    Then, D 1 =[0,0,3,0,0] - - - gg x =3, and calculate and determine: 
         [0121]    i.e., set x=5, 4, 3, and solve S 5 , S 4 , and S 3 , respectively 
         [0122]    S 5 =4, S 4 =4, S 3 =3; 
         [0123]    Dj=substitute the term i in A 1  with b i , gg x =i according to the flow chart; 
         [0124]    Then: D 1 =[0,0,1,0,1] - - - gg x =5 
         [0125]    Step (46): Since D 1  is not equal to B 1 , then execute step (61). 
         [0126]    5. i=i−1=4, A 1 =D 1 =[0,0,1,0,1], j=j+1=2, B 1 =[2,0,3,1,1]; 
         [0127]    Dj=substitute the term i in A 1  with b i , gg x =i according to the flow chart; 
         [0128]    Then: D 2 =[0,0,1,1,1] - - - gg x =4 
         [0129]    6. According to the flow chart, i=i−1=3, j=j+1=3, B 1 =[2,0,3,1,1], A 1 =D 2 =[0,0,1,1,1] 
         [0130]    Dj=substitute the term i in A 1  with b i , gg x =i according to the flow chart; 
         [0131]    Then: D 3 =[0,0,3,1,1] - - - gg x =3 
         [0132]    7. According to the flow chart, i=i−1=2, j=j+1=4, B 1 =[2,0,3,1,1], A 1 =D 3 =[0,0,3,1,1] 
         [0133]    Dj=substitute the term i in A 1  with b i , gg x =i according to the flow chart; 
         [0134]    Then: D 4 =[0,0,3,1,1] - - - gg x =2 
         [0135]    8. According to the flow chart, i=i−1=1, j=j+1=5, B 1 =[2,0,3,1,1], A 1 =D 4 =[0,0,3,1,1] 
         [0136]    Dj=substitute the term i in A 1  with b i , gg x =i according to the flow chart; 
         [0137]    Then: D 5 =[2,0,3,1,1] - - - gg x =1 
         [0138]    In conclusion, the telescopic paths are in turn: 
         [0139]    C 1 =[0,1,2,0,0] - - - gg x =1 
         [0140]    C 2 =[0,0,2,0,0] - - - gg x =2 
         [0141]    C 3 =[0,0,1,0,0] - - - gg x =3 (If the optimized procedure is not executed, then C 3 =[0,0,0,0,0] - - - gg x =3) 
         [0142]    D 1 =[0,0,1,0,1] - - - gg x =5 
         [0143]    D 2 =[0,0,1,1,1] - - - gg x =4 
         [0144]    D 3 =[0,0,3,1,1] - - - gg x =3 
         [0145]    D 4 =[0,0,3,1,1] - - - gg x =2 - - - Since this term is equal to D 3 , similar terms are combined. 
         [0146]    D 5 =[2,0,3,1,1] - - - gg x =1 
         [0147]    In the present application, another embodiment of the single-cylinder pin-type telescopic boom track optimized control method is also provided. Please see  FIG. 2 , which is a flow chart of the second embodiment of the single-cylinder pin-type telescopic boom track optimized control method. 
         [0148]    As shown in  FIG. 1  and  FIG. 2 , this embodiment is completely the same as the first embodiment in terms of the design concept. The differences lie in: 
         [0149]    First, step (25) is executed after step (23): 
         [0150]    (25) Determine whether only a i  is not equal to 0 in A 1 , if positive, execute step (40); otherwise continue to execute step (2); and 
         [0151]    Set the minimum value of x to 2 in step (43). 
         [0152]    Hereunder that design will be described in an example of a telescopic boom composed of five sections, with four bearing pin holes in each section: 
         [0153]    Current state array of boom: A[0,0,2,0,0] 
         [0154]    Target state array: B[0,0,3,0,0] 
         [0155]    The section where the telescopic mechanism is: n_code=1 
         [0156]    Total number of section: i=5 
         [0157]    1. Step (21): set i=5 (total number of sections), gg x =0 (clear the section gg x  where the telescopic mechanism is in the switching process to zero); 
         [0158]    Step (22): a 5 =0, b 5 =0, and the determination result is positive; 
         [0159]    Step (24): set i=i−1=4; 
         [0160]    Step (22): a 4 =0, b 4 =0, and the determination result is positive; 
         [0161]    Step (24): set i=i−1=3; 
         [0162]    Step (22): a 3 =2, b 3 =3, and the determination result is negative; 
         [0163]    Step (23): Set j=1, since the last two terms are equal between the current state array of boom A[0,0,2,0,0] and target state array B[0,0,3,0,0], then obtain A 1 [0,0,2], B 1 [0,0,3]. 
         [0164]    Step (2): Set x=3, 2, and solve S 3  and S 2 , respectively 
         [0000]    
       
         
           
             
               
                 S 
                 3 
               
               = 
               
                 
                   
                     
                       ∑ 
                       1 
                       2 
                     
                      
                     
                       a 
                       m 
                     
                   
                   + 
                   
                     Max 
                      
                     
                       ( 
                       
                         
                           a 
                           3 
                         
                         , 
                         
                           b 
                           3 
                         
                       
                       ) 
                     
                   
                 
                 = 
                 
                   
                     
                       a 
                       1 
                     
                     + 
                     
                       a 
                       2 
                     
                     + 
                     
                       b 
                       3 
                     
                   
                   = 
                   3 
                 
               
             
             ; 
           
         
       
     
         [0165]    Similarly, it is calculated as S 2 =0; 
         [0166]    Step (32): Cj=substitute the term j in A 1  with the minimum term of 1 and b j , according to the flow chart; 
         [0167]    Then: C 1 =[0,0,2] - - - gg x =1 
         [0168]    Step (323), S i =S 3 =3, and the determination result is positive; 
         [0169]    Step (322): Substitute the term j in A 1  with 0, set j=1, C 1 =[0,0,2]; 
         [0170]    Step (33): Since C 1 =[0,0,2] is not equal to B 1 [0,0,3], go back to execute step (2). 
         [0171]    2. i=3, j=2, A 1 =[0,0,2], B 1 =[0,0,3], 
         [0172]    i.e., x=3, solve S 3 ; 
         [0173]    S 3 =3; 
         [0174]    Cj=substitute the term j in A 1  with the minimum term of 1 and b j , according to the flow chart; Then: C 2 =[0,0,2] - - - gg x =2 
         [0175]    Step (323), S i =S 3 =3, and the determination result is positive; 
         [0176]    Step (322): Substitute the term j in A 1  with 0, set j=2, C 2 =[0,0,2]; 
         [0177]    Similarly, since C 2 =[0,0,2] is not equal to B 1 [0,0,3], go back to execute step (2). 
         [0178]    3. i=3, j=3, A 1 =[0,0,2], B 1 =[0,0,3], 
         [0179]    i.e., x=3, solve S 3 ; 
         [0000]    
       
         
           
             
               
                 S 
                 3 
               
               = 
               
                 
                   
                     ∑ 
                     3 
                     2 
                   
                    
                   
                     a 
                     m 
                   
                 
                 + 
                 
                   Max 
                    
                   
                     ( 
                     
                       
                         a 
                         3 
                       
                       , 
                       
                         b 
                         3 
                       
                     
                     ) 
                   
                 
               
             
             ; 
           
         
       
     
         [0180]    Here, strictly speaking, S x  can&#39;t be calculated normally. 
         [0181]    After a determination of step (25) is added in the preferred scheme, step (40) is executed; 
         [0182]    Step (40): Set j=1; 
         [0183]    Step (41): gg x =0 is true; 
         [0184]    Step (42): n_code=1, and it is smaller than i; 
         [0185]    Then, execute step (43): 
         [0186]    D 1 =[0,0,2], x=3, 2, solve S 3 , S 2 ; 
         [0187]    S 3 =3, S 2 =0 
         [0188]    Step (44): S 3  and S 2  are not smaller than 2 
         [0189]    Step (45): D 1 =[0,0,3] - - - gg x =3; 
         [0190]    Step (46): Since D 1  is not equal to B 1 , then execute step (47). 
         [0191]    In conclusion, the telescopic path is: 
         [0192]    D 1 =[0,0,3] - - - gg x =3. 
         [0193]    Second, step (323) is executed after step (321): 
         [0194]    (323) Solve S i  from Cj and B 1 , determine whether S i  is greater than 2; if positive, execute step (322); otherwise execute step (33). 
         [0195]    Hereunder that design will be described in an example of a telescopic boom composed of five sections, with four bearing pin holes in each section: 
         [0196]    Current state array of boom: A[0,0,0,1,2] 
         [0197]    Target state array: B[2,0,0,1,1] 
         [0198]    The section where the telescopic mechanism is: n_code=1 
         [0199]    Total number of section: i=5 
         [0200]    1. Step (21): set i=5 (total number of sections), gg x =0 (clear the section gg x  where the telescopic mechanism is in the switching process to zero); 
         [0201]    Step (22): a 5 =2, b 5 =1, and the determination result is negative; 
         [0202]    Step (23): Set j=1, since there is no equal term between the current state array of boom A[0,0,0,1,2] and target state array B[2,0,0,1,1], then obtain A 1 [0,0,0,1,2], B 1 [2,0,0,1,1]. 
         [0203]    Step (2): Set x=5, 4, 3, 2, respectively, and solve S 5 , S 4 , S 3 , and S 2 , respectively 
         [0000]    
       
         
           
             
               S 
               5 
             
             = 
             
               
                 
                   
                     ∑ 
                     1 
                     4 
                   
                    
                   
                     a 
                     m 
                   
                 
                 + 
                 
                   Max 
                    
                   
                     ( 
                     
                       
                         a 
                         5 
                       
                       , 
                       
                         b 
                         5 
                       
                     
                     ) 
                   
                 
               
               = 
               
                 
                   
                     a 
                     1 
                   
                   + 
                   
                     a 
                     2 
                   
                   + 
                   
                     a 
                     3 
                   
                   + 
                   
                     a 
                     4 
                   
                   + 
                   
                     a 
                     5 
                   
                 
                 = 
                 3 
               
             
           
         
       
     
         [0204]    Likewise, it is calculated that S 4 =1; S 3 =0, S 2 =0; 
         [0205]    Since the condition of step (32) is met, Cj=substitute the term j in A 1  with Min(1, b j ), according to the flow chart; 
         [0206]    Then: C 1 =[1,0,0,1,2] - - - gg x =1 
         [0207]    In this case, if no determination is added in step (323), then C 1 [1,0,0,1,2]. Since the last section is 2, it is not in the stroke of the oil cylinder. 
         [0208]    In the preferred scheme, a determination is added in step (323) to effectively avoid the above problem. Thus, in this method, step (323) is executed, and then whether the last section is within the telescopic stroke of the oil cylinder is determined according to Cj and B 1 . 
         [0209]    Step (323): Solve S 5 =4 according to C 1 =[1,0,0,1,2] and B 1 [2,0,0,1,1]; since S 5 &gt;2, the condition is determined as true. 
         [0210]    Execute step (322), Cj=substitute the term j in A 1  with 0, according to the flow chart; 
         [0211]    Then: C 1 =[0,0,0,1,2] - - - gg x =1 
         [0212]    Step (33): Since C 1 =[0,0,0,1,2] is not equal to B 1 [2,0,0,1,1], go back to execute step (25); 
         [0213]    Step (25): Determine the condition is not true; 
         [0214]    Step (2): i=5, j=2, A 1 =[0,0,0,1,2], B 1 =[2,0,0,1,1], 
         [0215]    i.e., set x=5, 4, 3, and solve S 5 , S 4 , and S 3 , respectively; 
         [0216]    S 5 =3, S 4 =1, S 3 =0; 
         [0217]    Execute step (321), Cj=substitute the term j in A 1  with Min(1, b j ), according to the flow chart; 
         [0218]    Then, step (321): C 2 =[0,0,0,1,2] 
         [0219]    Step (323): i=5, j=2, C 2 =[0,0,0,1,2], B 1 =[2,0,0,1,1], 
         [0220]    i.e., obtain S 5 =3; 
         [0221]    Cj=substitute the term j in A 1  with 0, according to the flow chart; 
         [0222]    Then: C 2 =[0,0,0,1,2] - - - gg x =2 
         [0223]    Step (33): Since C 1 =[0,0,0,1,2] is not equal to B 1 [2,0,0,1,1], go back to execute step (25); 
         [0224]    Step (25): Determine the condition is not true; 
         [0225]    Step (2): i=5, j=3, A 1 =[0,0,0,1,2], B 1 =[2,0,0,1,1], 
         [0226]    i.e., set x=5, 4, and solve S 5 , and S 4  respectively; 
         [0227]    S 5 =3, S 4 1; 
         [0228]    Cj=substitute the term j in A 1  with Min(1, b j ), according to the flow chart; 
         [0229]    Then, step (321): C 3 =[0,0,0,1,2] 
         [0230]    Step (323): i=5, j=3, C 3 =[0,0,0,1,2], B 1 =[2,0,0,1,1], 
         [0231]    i.e., obtain S 5 =3; 
         [0232]    Cj=substitute the term j in A 1  with 0, according to the flow chart; 
         [0233]    Then: C 3 =[0,0,0,1,2] - - - gg x =3 
         [0234]    Similarly, since C 3 =[0,0,0,1,2] is not equal to B 1 [2,0,0,1,1], go back to execute step (25); 
         [0235]    Step (25): Determine the condition is not true; 
         [0236]    Step (2): i=5, j=4, A 1 =[0,0,0,1,2], B 1 =[2,0,0,1,1], 
         [0237]    i.e., set x=5, and obtain S 5 =3; 
         [0238]    Cj=substitute the term j in A 1  with Min(1, b j ), according to the flow chart; 
         [0239]    Then, step (321): C 4 =[0,0,0,1,2] 
         [0240]    Step (323): i=5, j=4, C 4 =[0,0,0,1,2], B 1 =[2,0,0,1,1], 
         [0241]    i.e., obtain S 5 =3; 
         [0242]    Cj=substitute the term j in A 1  with 0, according to the flow chart; 
         [0243]    Then: C 2 =[0,0,0,0,2] - - - gg x =4 
         [0244]    Similarly, since C 3 =[ 0 , 0 , 0 , 0 , 2 ] is not equal to B 1 [ 2 , 0 , 0 , 1 , 1 ], go back to execute step (25); 
         [0245]    Step (25): Determine the condition is true; 
         [0246]    Step (40): Set j=1; 
         [0247]    Step (41): gg x =4 is not equal to 0, then n_code=gg x =4; 
         [0248]    Step (42): n_code=4 is smaller than i; 
         [0249]    Then, D 1 =[0,0,0,1,2], B 1 =[2,0,0,1,1], and n_code=4, and calculate and determine: 
         [0250]    i.e., set x=5, 4, and solve S 5 , and S 4  respectively; 
         [0251]    S 5 =3, S 4 =1; 
         [0252]    Step (44): the condition is not true; 
         [0253]    Dj=substitute the term i in A 1  with b i , gg x =i=5 according to the flow chart; 
         [0254]    Then: D 1 =[0,0,0,0,1] - - - gg x =5 
         [0255]    Step (46): D 1  is not equal to B 1 , then execute step (61), N=TRUE is not true. 
         [0256]    According to the flow chart, i=i−1=4, now, D 1 =[0,0,0,0,1], j=1, B 1 =[2,0,0,1,1]; 
         [0257]    Step (62): A 1 =D 1 =[0,0,0,0,1], j=j+1=2, Dj=substitute the term i in A 1  with b i , gg x =i; 
         [0258]    Then: D 2 =[0,0,0,1,1] - - - gg x =4 
         [0259]    According to the flow chart, i=i−1=3, now, D 2 =[0,0,0,1,1], j=2, B 1 =[2,0,0,1,1]; 
         [0260]    Step (62): A 1 =D 2 =[0,0,0,1,1], j=j+1=3, Dj=substitute the term i in A 1  with b i , gg x =i; 
         [0261]    Then: D 3 =[0,0,0,1,1] - - - gg x =3 
         [0262]    According to the flow chart, i=i−1=2, now, D 3 =[0,0,0,1,1], j=3, B 1 =[2,0,0,1,1]; 
         [0263]    Step (62): A 1 =D 3 =[0,0,0,1,1], j=j+1=4, Dj=substitute the term i in A 1  with b i , gg x =i; 
         [0264]    Then: D 4 =[0,0,0,1,1] - - - gg x =2 
         [0265]    According to the flow chart, i=i−1=1, now, D 4 =[0,0,0,1,1], j=4, B 1 =[2,0,0,1,1]; 
         [0266]    Step (62), A 1 =D 4 =[0,0,0,1,1], j=j+1=5, Dj=substitute the term i in A 1  with b i , gg x =i; 
         [0267]    Then: D 5 =[2,0,0,1,1] - - - gg x =1 
         [0268]    Step (46): D 5 =B 1   
         [0269]    In conclusion, the telescopic paths are: 
         [0270]    C 1 =[0,0,0,1,2] - - - gg x =1 
         [0271]    C 2 =[0,0,0,1,2] - - - gg x =2 
         [0272]    C 3 =[0,0,0,1,2] - - - gg x =3 
         [0273]    C 4 =[0,0,0,0,2] - - - gg x =4 
         [0274]    D 1 =[0,0,0,0,1] - - - gg x =5 
         [0275]    D 2 =[0,0,0,1,1] - - - gg x =4 
         [0276]    D 3 =[0,0,0,1,1] - - - gg x =3 
         [0277]    D 4 =[0,0,0,1,1] - - - gg x =2 
         [0278]    D 5 =[2,0,0,1,1] - - - gg x =1 
         [0279]    Combine the similar terms, then: 
         [0280]    C 4 =[0,0,0,0,2] - - - gg x =4 
         [0281]    D 1 =[0,0,0,0,1] - - - gg x =5 - - - If the optimized procedure is not executed, then
       [0,0,0,0,0] - - - gg x =5   [0,0,0,0,1] - - - gg x =5       
 
         [0284]    D 2 =[0,0,0,1,1] - - - gg x =4 
         [0285]    D 5 =[2,0,0,1,1] - - - gg x =1 
         [0286]    It seen from the above description of the embodiments: the single-cylinder pin-type telescopic boom track optimized control method is applicable to switching between any two working states of a telescopic boom composed of any number of sections. Compared to the prior art, the method in the present invention determines the constrained conditions according to the stroke of the telescopic oil cylinder, and can be used to obtain the most rapid and convenient telescopic path on the basis of the current position of the pin mechanism and other conditions, when the telescopic boom transits from the current state A to a target state B, and thereby can greatly improve the telescopic reliability and working efficiency of single-cylinder pin-type telescopic booms. 
         [0287]    While the present invention has been illustrated and described with reference to some preferred embodiments, the present invention is not limited to these. Those skilled in the art should recognize that various variations and modifications can be made without departing from the spirit and scope of the present invention. For example, a plurality of bearing pin holes other in a number than four bearing pin holes can be arranged in each section. All of such variations and modifications shall be deemed as falling into the protected scope of the present invention.