Patent ID: 11945464
Assignee: EAST CHINA NORMAL UNIVERSITY
Field: Transport (Mechanical engineering)
Classification: CPC B  G  H | IPC B  G  H

Claim 7:
8. The method for assessing SOTIF of autonomous driving based on DAG block chain according to claim 1, wherein in the step 4, a credit balance of a final node is an assessment result; a credit assessment algorithm is used to implement the credit incentives and penalties for the nodes, and is designed, when the terminated transaction is safe transaction, to impart credit penalty to transaction nodes whose data are inconsistent with those of the terminated transaction during backtracing of the path, and to impart credit incentive to the rest of the nodes, and when the terminated transaction is a danger transaction or a hazard transaction, to impart credit incentive to the transaction nodes whose data are inconsistent with those of the terminated transaction, and to impart credit penalty to the rest of the nodes; in terms of credit inventive or credit penalty, the credit incentive is imparted at a time, an effect of which is not strengthened or weakened with the lapse of time, but is gradually weakened with the credit penalty, until the effect of the credit incentives is zeroed, and the effect of the credit penalty is gradually reduced as the number of the transaction paths is increased, and is ineliminable;
an equation for calculating the credit balance is Ci=CiP+CiN, where Ci represents the credit account balance of a node i, CiP represents the credit incentive imparted to the node i, and CiN represents the credit penalty imparted to the node i;
an equation for calculating the credit incentive is, C
    i
    P
   
   =
   
    
     
      ∑
      
       k
       =
       1
      
      
       n
       P
      
     
      
     
      v
      k
     
    
    
     n
     P
    
   
  
  ,
 

where nP represents a number of the transaction paths that the node i participates in and that make a positive contribution, among the transaction paths; vk represents a number of times the node i is verified on a k-th transaction path; the more times the node i is verified, the higher credibility of the node i, and the more credit incentives being imparted; an accumulation of the credit incentive is formulated as an arithmetic average of the number of the transaction paths that the nodes participate in and that make a positive contribution;
an equation for calculating the credit penalty is, C
    i
    N
   
   =
   
    -
    
     
      
       ∑
       
        k
        =
        1
       
       
        n
        N
       
      
      
       v
       k
      
     
     
      
       n
       N
      
      -
      k
      +
      1
     
    
   
  
  ,
 

where nN represents a number of the transaction paths that the node i participates in and that make a negative contribution, among the transaction paths; vk represents a number of times the node i is verified on the k-th transaction path; the more times the node i is verified, the deeper the influence of negative effect of the node i in the transaction path, and the stricter the credit penalty being imparted; the degree of the credit penalties in the preceding transaction paths is gradually reduced as the number of the transaction paths is increased.