Method for quickly solving minimum cut sets of micro-grids on basis of breadth first search

A technology of breadth-first search and micro-grid, which is applied in the field of rapid calculation of the minimum cut set of micro-grid based on breadth-first search, and can solve problems such as slow calculation speed and complicated steps

Inactive Publication Date: 2017-06-13
TIANJIN UNIV
View PDF4 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Practice has shown that, because of the calculation and processing of the minimum path set, the steps from the structural topology map to the minimum cut set are relatively complicated at this stage, and the calculation rate is relatively slow.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method for quickly solving minimum cut sets of micro-grids on basis of breadth first search
  • Method for quickly solving minimum cut sets of micro-grids on basis of breadth first search
  • Method for quickly solving minimum cut sets of micro-grids on basis of breadth first search

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0019] The microgrid has the characteristics of obvious structural features, a small number of nodes, and simple connection relationships. Therefore, the specific implementation steps are introduced by taking the microgrid as an example. It is assumed that the network node diagram has been obtained from the topology diagram of the microgrid structure. The following calculations are performed based on the network node graph:

[0020] 1. Create a rank matrix

[0021] Use the Breadth First Search algorithm (Breadth First Search) to classify each node: record an arc between two points as the length unit 1, and divide the network node graph into 1, 2, 3 according to the different lengths of a node reaching the specified node. ·· n different grades and recorded in the grade matrix.

[0022] 2. Create a root-leaf matrix

[0023] According to the different levels, the directly connected nodes are separated according to the root-leaf relationship. The high-level node (the algebra v...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention relates to a method for quickly solving minimum cut sets of micro-grids on the basis of breadth first search. The method includes establishing structural topological diagrams of the micro-grids so as to obtain network node diagrams; grading various nodes by the aid of Breadth First Search and creating grade matrixes; creating root-leaf matrixes and separating the directly connected nodes according to different grads and root-leaf relations; creating selected matrixes and storing all possible cut sets. Each cut set is represented by a row vector.

Description

technical field [0001] The invention relates to all fields that need reliability analysis based on cut sets. Background technique [0002] In the authoritative book "Introduction to Graph Theory" on graph theory, there is such a definition of point cut: a separate set or point cut of graph G is a set It makes G-S connected components more than one. A similar concept exists for edge cutting. A set of edge cuts and point cuts is called a cut set. [0003] The concept of cut set was mainly used in graph theory analysis at first, and it was gradually widely used in practical engineering after the fault tree method was proposed. In practical applications, more contact is based on the concept of cut sets proposed by fault trees. That is, in the fault tree, if several bottom events occur at the same time, the relevant top events will be triggered, and the set of these bottom events is called the cut set of the fault tree. For any cut set of the fault tree, if the top event do...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/50G06Q50/06
CPCG06F30/18G06Q50/06
Inventor 车延博赵远程杨立勋
Owner TIANJIN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap