Patent ID: 11916423
Assignee: GUIZHOU UNIVERSITY
Field: Electrical machinery, apparatus, energy (Electrical engineering)
Classification: CPC H  G  Y | IPC G  H

Claim 0:
1. A grouped consensus power allocation method for multiple energy storage units, comprising:
determining a grouped coordination control strategy of multiple battery energy storage units (BESUs), wherein a battery energy storage system (BESS) comprises the multiple BESUs, the multiple BESUs are communicated through a communication topology, and the multiple BESUs are grouped into a charging group CZ and a discharging group DZ; and
performing power coordination control between the charging group CZ and the discharging group DZ based on a distributed algorithm, and determining whether a switching between the charging group CZ and the discharging group DZ is triggered during an operation process of the BESS;
wherein the performing power coordination control between the charging group CZ and the discharging group DZ based on a distributed algorithm comprises:
step S31, initializing the BESS; and
step S32, determining an adjustment strategy of an adjacency matrix A, comprising:
determining, by a BESU i, whether a dual group is needed to participate in a process of iterating, and adjusting the adjacency matrix A through a formula (22) to achieve intergroup coordination in response to the dual group is needed to participate, wherein the formula (22) is expressed as follows:, {
     
      
       
        
         
          
           a
           
            ii
            o
           
          
          =
          1
         
        
        
         
          
           
            x
            i
           
           (
           
            k
            c
           
           )
          
          ∉
          
           [
           
            
             
              x
              _
             
             i
            
            ,
            
             
              x
              _
             
             i
            
           
           ]
          
         
        
       
       
        
         
          
           a
           
            ii
            o
           
          
          =
          0
         
        
        
         
          
           
            x
            i
           
           (
           
            k
            c
           
           )
          
          ∈
          
           [
           
            
             
              x
              _
             
             i
            
            ,
            
             
              x
              _
             
             i
            
           
           ]
          
         
        
       
      
      ,
     
    
   
   
    
     (
     22
     )
    
   
  
 

where xi and xi respectively represent a lower limit and an upper limit of a state constraint of the BESU i as an i-th node, xi(kc) represents a state of a consensus variable of the i-th node at a time kc, aii∘ represents an element in the adjacency matrix A, aii∘=1 represents that the BESU i exchanges data with the BESU i∘ being a dual unit of the BESU i, otherwise, there is no data exchange;
determining whether the BESU i with an initial power of Pbi0=PBSref(t) exits a communication iteration of a current control cycle, and adjusting the BESS as per a formula (25) in response to it is determined that the BESU i with the initial power exits the communication iteration, otherwise continuing to iterating without the adjusting until reaching a convergence accuracy, wherein the formula (25) is expressed as follows:, {
     
      
       
        
         
          
           
            x
            j
            ′
           
           (
           k
           )
          
          =
          
           
            
             x
             j
            
            (
            k
            )
           
           +
           
            
             
              
               x
               i
              
              (
              k
              )
             
             ⁢
             
              w
              i
             
            
            
             
              
               d
               i
              
              (
              
               k
               -
               1
              
              )
             
             ⁢
             
              w
              j
             
            
           
          
         
        
       
       
        
         
          
           
            x
            i
            ′
           
           (
           k
           )
          
          =
          0
         
        
       
       
        
         
          
           a
           ij
          
          =
          0
         
        
       
       
        
         
          
           
            d
            j
            ′
           
           (
           k
           )
          
          =
          
           
            
             d
             j
            
            (
            k
            )
           
           -
           1
          
         
        
       
      
      ⁢
      
       ∀
       
        j
        ∈
        
         
          N
          i
         
         (
         
          k
          -
          1
         
         )
        
       
      
     
    
   
   
    
     (
     25
     )
    
   
  
 

where aij represents an element in the adjacency matrix A representing a communication network topology, xi(k) represents a state of the i-th node at a time k, xj(k) represents a state of a j-th node at the time k, wi represents a weight coefficient of the BESU i, wj represents a weight coefficient of a BESU j, Ni(k−1) represents an adjacent node set of the BESU i before exits, xj′(k) represents a state quantity of the j-th node in Ni(k−1) after the BESU i exits, and dj′(k) represents the number of adjacent nodes of the j-th node in Ni(k−1) after the BESU i exits; and
calculating a power Pbi(t) of each of the multiple BESUs as per a formula (28) in response to the convergence accuracy is reached, wherein the formula (28) is expressed as follows:, {
     
      
       
        
         
          P
          ⁡
          (
          t
          )
         
         =
         
          WX
          *
         
        
       
      
      
       
        
         
          P
          ⁡
          (
          t
          )
         
         =
         
          
           [
           
            
             
              P
              
               b
               ⁢
               1
              
             
             (
             t
             )
            
            ,
            
             
              P
              
               b
               ⁢
               2
              
             
             (
             t
             )
            
            ,
            L
             
            ,
            
             
              
               P
               bi
              
              (
              t
              )
             
             ⁢
             L
            
            ,
            
             
              P
              bn
             
             (
             t
             )
            
           
           ]
          
          T
         
        
       
      
      
       
        
         
          
           P
           B
          
          (
          t
          )
         
         =
         
          
           
            ∑
             
           
           
            i
            =
            1
           
           n
          
          ⁢
          
           
            P
            bi
           
           (
           t
           )
          
         
        
       
      
     
    
   
   
    
     (
     28
     )
    
   
  
 

where X* represents a convergence state value meeting power constraints of all the n number of nodes, W=diag(w1, w2, . . . , wn) represents a weight matrix of the BESS, PB(t) represents a sum of powers of all the multiple BESUs, and Pbi(t) represents the power of the BESU i.