A method for identifying the last circuit breaker of valve group based on Dijkstra algorithm
A final circuit breaker and identification method technology, applied in the direction of circuit devices, complex mathematical operations, emergency protection circuit devices, etc., can solve problems such as large amount of calculation, and achieve the effect of simple identification method, simple method, and strong practicability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example
[0052] Example: figure 2 The electrical main wiring diagram of the AC field is given. The AC field includes 2 valve groups P1 and P2, 2 bus tie circuit breakers 5101 and 5102, 5011~5073 are interval series circuit breakers, and the lines are represented by L1~L7. T1-T9 represent the intersection of the AC line or the valve group and the AC string.
[0053] In the initial stage of DC project construction, figure 2 Only the first 6 interval strings are put into operation in the AC field, so the adjacency matrix C of the AC field is established as follows:
[0054]
[0055] The vertex set of the shortest path from valve group P1 to line convergence point L obtained by Dijkstra algorithm is P={P1, T4, 5033, B2, 5013, T2, L}.
[0056] Thus, the shortest path circuit breaker vertex set U={5013, 5033} corresponding to this set is obtained. Set the circuit breakers in the set to open in turn, and set the row and column elements of the circuit breaker in the adjacency matrix to...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com