CN115146879A - Optimization method for safety measure arrangement path of transformer substation relay protection room - Google Patents
Optimization method for safety measure arrangement path of transformer substation relay protection room Download PDFInfo
- Publication number
- CN115146879A CN115146879A CN202211079662.3A CN202211079662A CN115146879A CN 115146879 A CN115146879 A CN 115146879A CN 202211079662 A CN202211079662 A CN 202211079662A CN 115146879 A CN115146879 A CN 115146879A
- Authority
- CN
- China
- Prior art keywords
- unit
- area
- coordinates
- virtual
- binary operation
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 33
- 238000005457 optimization Methods 0.000 title claims description 17
- 230000003245 working effect Effects 0.000 claims abstract description 41
- 230000004913 activation Effects 0.000 claims description 61
- 230000008014 freezing Effects 0.000 claims description 61
- 238000007710 freezing Methods 0.000 claims description 50
- 238000012423 maintenance Methods 0.000 claims description 16
- 230000003213 activating effect Effects 0.000 claims description 14
- 229910002056 binary alloy Inorganic materials 0.000 claims 1
- 206010014357 Electric shock Diseases 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 15
- 238000004891 communication Methods 0.000 description 11
- 230000000694 effects Effects 0.000 description 11
- 238000002955 isolation Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02B—BOARDS, SUBSTATIONS OR SWITCHING ARRANGEMENTS FOR THE SUPPLY OR DISTRIBUTION OF ELECTRIC POWER
- H02B3/00—Apparatus specially adapted for the manufacture, assembly, or maintenance of boards or switchgear
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Economics (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Health & Medical Sciences (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Power Engineering (AREA)
- Game Theory and Decision Science (AREA)
- Manufacturing & Machinery (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Train Traffic Observation, Control, And Security (AREA)
Abstract
The invention discloses a method for optimizing a safety measure arrangement path of a relay protection room of a transformer substation, and belongs to the technical field of safety measure arrangement of transformer substations. According to the invention, the transverse coordinates and the longitudinal coordinates are divided by taking an entrance as the origin of coordinates in the relay protection chamber, and the coordinates are labeled, so that the initial value of the binary operation code corresponding to each coordinate area is given; when a plurality of working activity areas are involved, the main route of the working activity area farthest from the entrance is calculated preferentially, the branch route closest to the coordinates of the next-farthest working activity area and the main route is calculated again until all the working activity areas are connected to the main route, and then the non-working activity areas are subjected to closed management. The optimized path of the method can reduce the possibility that the maintainer mistakenly enters other screen cabinets for misoperation, thereby reducing the electric shock risk and misoperation risk of the staff and further reducing the probability of power grid risk. The safety of personnel, equipment and a power grid is guaranteed while the working efficiency is improved.
Description
Technical Field
The invention belongs to the technical field of transformer substation safety measure arrangement, and particularly relates to a method for optimizing a safety measure arrangement path of a transformer substation relay protection room.
Background
The electrical equipment in the substation is divided into primary equipment and secondary equipment. Primary equipment refers to equipment that directly produces, delivers, distributes, and uses electrical energy. The secondary equipment is equipment for measuring, monitoring, controlling and protecting the operation condition of the primary equipment and the system, and mainly comprises a relay protection device, an automatic device, a measurement and control device, a metering device, an automatic system and direct current equipment for providing power for the secondary equipment. A large amount of secondary equipment have been installed in the relay protection room of transformer substation, when the maintenance staff need overhaul work such as debugging to some secondary equipment, the operation and maintenance personnel need arrange a escape way between examining and repairing equipment workplace and relay protection room access & exit before the maintenance work begins, and this passageway provides the route guide for the maintenance staff, makes it can follow the relay protection cabinet that relay protection room gate was through examined and repaired the equipment place. The safety channel also has a more important effect, is to set up isolation measure between maintenance area territory and the normal operating equipment, can prevent that the maintainer from reaching non-maintenance equipment screen cabinet and carrying out the maloperation to the secondary equipment of normal operating, has reduced the probability that the maintainer electrocuted, has also reduced the emergence of electric wire netting risk when guaranteeing personal safety.
Therefore, in the process of arranging safety measures in the relay protection chamber, the substation operation and maintenance personnel need to search an optimized path between the working place and the access of the relay protection screen cabinet, and the path is used as a safety channel for the maintenance personnel to access to the working place, so that the working efficiency of the personnel can be improved, the electric shock risk and the misoperation risk of the personnel can be reduced, the probability of power grid risk occurrence is further reduced, and the substation operation and maintenance method has important significance for the maintenance work of the secondary equipment of the substation.
Disclosure of Invention
The invention provides a method for optimizing a safety measure arrangement path of a relay protection room of a transformer substation, aiming at the problems of path optimization and misoperation in the process of arranging safety measures in the relay protection room by operation and maintenance personnel of the transformer substation.
In order to achieve the purpose, the invention adopts the following technical scheme:
a method for optimizing safety measure layout paths of a substation relay protection room,
the relay protection chamber comprises an indoor screen cabinet, a road and an entrance and an exit of the relay protection chamber;
dividing horizontal and vertical coordinates by taking an entrance as an origin of coordinates, and dividing indoor screen cabinets, roads and entrances and exits of the relay protection room into screen cabinet areas, screen cabinet front and rear areas, road areas and entrance and exit areas; each divided area is a grid area and carries out coordinate marking; giving a corresponding binary operation code initial value to each coordinate area;
dividing the relay protection chamber indoor screen cabinet into three primary independent units, including an activation unit, a freezing unit and a virtual unit;
setting an activation unit of an indoor screen cabinet of a relay protection chamber and a shortest route communicated between an expansion area of the activation unit and an upper and lower expansion areas of the activation unit as a working activity area;
setting a nearest route calculated by coordinates between the entrance and the exit and the work activity area as a safety measure layout path optimization route; when a plurality of working activity areas are involved, the main route of the working activity area farthest from the entrance is calculated preferentially, the branch route closest to the coordinates of the next-farthest working activity area and the main route is calculated again until all the working activity areas are connected to the main route, and then the non-working activity areas are subjected to closed management.
Further, the regular operation method of the binary operation code is as follows: in the primary independent unit, no operation is performed between the transversely adjacent activation unit and activation unit, between the transversely adjacent freezing unit and freezing unit, between the transversely adjacent virtual unit and virtual unit, and between the transversely adjacent activation unit and freezing unit; and the activating unit, the freezing unit and the horizontally adjacent virtual units are operated by binary bitwise AND, and the binary operation codes of the virtual units are reassigned.
Further, the specific method for reassigning the binary operation code of the virtual unit is as follows: the binary operation code b00 of the activation unit and the binary operation code b11 of the adjacent virtual unit are subjected to bitwise AND operation to obtain the binary operation code b00, the result b00 is reassigned to the virtual unit, the virtual unit with the binary operation code b00 can be treated as the same as the activation unit and is called a virtual activation unit, the binary operation code b01 of the freezing unit and the binary operation code b11 of the adjacent virtual unit are subjected to bitwise AND operation to obtain the binary operation code b01, the result b01 is reassigned to the virtual unit, and the virtual unit with the binary operation code b01 can be treated as the same as the freezing unit and is called a virtual freezing unit.
Further, the activation unit is a screen cabinet which needs to work in the maintenance work; the freezing unit is a non-overhaul screen cabinet which needs to be subjected to closed management; the virtual unit is a reserved screen cabinet position, the virtual unit is a screen cabinet which does not exist actually, and only is a screen cabinet position reserved for later extension equipment, and the virtual unit can be classified as an activation unit or a freezing unit for management.
Further, the specific method for assigning the initial value of the binary operation code corresponding to each coordinate region is as follows: the binary operation code of the activation unit and the expansion area of the activation unit is b00; the binary operation code of the freezing unit and the freezing unit expansion area is b01; the binary operation code of the virtual unit and the virtual unit extension area is b11; the binary operation code of the entrance and exit area is b00; the binary operation code of the road area is b01;
the final binary operation code of the working active area, the entrance area, the exit area and the path area communicated with the entrance is b00, and the final binary operation code of the non-working active area is b01.
Further, the coordinates of the entrance and exit area are the origin coordinates (0, 0); the row of the minimum value and the maximum value of the abscissa of the relay protection room is a road area; the screen cabinet area is divided by taking the independent screen cabinet as a unit, one screen cabinet corresponds to one screen cabinet coordinate area, and the front area and the rear area of the screen cabinet are vertically extended coordinate areas by taking the screen cabinet as a center.
Further, the coordinate area with the final binary operation code of b00 is used for arranging an optimized path for the safety measures in the relay protection room.
Compared with the prior art, the invention has the following advantages:
the optimization method for the safety measure arrangement path of the transformer substation relay protection chamber can be realized through computer software programming, safety measure arrangement path reference is provided for transformer substation operation and maintenance personnel, the method enables maintenance personnel to directly reach a working place through shortest path guidance when entering the relay protection chamber, and compared with the existing artificial autonomous arrangement path, the optimization path can reduce the possibility that the maintenance personnel mistakenly enter other screen cabinets for misoperation, thereby reducing the electric shock risk and misoperation risk of the personnel, and further reducing the occurrence probability of power grid risk. The safety of personnel, equipment and a power grid is guaranteed while the working efficiency is improved.
Drawings
FIG. 1 is a flow chart of the steps for implementing the technical solution of the present invention;
FIG. 2 is a top view of the relay protection chamber in example 1;
FIG. 3 is a schematic diagram of dividing the coordinates of a top view area of the relay protection chamber in embodiment 1;
FIG. 4 is a schematic view of an activation unit configuration according to embodiment 1;
FIG. 5 is a schematic diagram of primary independent unit binary opcode assignment according to embodiment 1;
FIG. 6 is a schematic diagram illustrating the bitwise AND operation of the primary independent unit binary opcode of embodiment 1;
fig. 7 is a schematic diagram of assignment of binary operation codes in the extended area according to embodiment 1;
FIG. 8 is a diagram illustrating a final result of the extended region binary opcode of embodiment 1;
FIG. 9 is a schematic diagram of the embodiment 1 in which the activation unit expands the upper and lower regions to establish the active region of operation by communicating with the shortest route;
FIG. 10 is a schematic view showing the main line communication in embodiment 1;
FIG. 11 is a schematic view showing the branch line communication in embodiment 1;
fig. 12 is a schematic diagram of a safety arrangement optimization path result in embodiment 1;
fig. 13 is a schematic diagram of dividing the coordinates of the top view area of the relay protection chamber in embodiment 2;
FIG. 14 is a diagram illustrating assignment of binary opcodes to primary individual units according to embodiment 2;
fig. 15 is a schematic diagram of assigning binary operation codes to extended areas in embodiment 2;
FIG. 16 is a diagram illustrating a final result of extended region binary opcode in accordance with embodiment 2;
fig. 17 is a schematic diagram of a safety arrangement optimization path result in embodiment 2;
FIG. 18 is a schematic diagram of coordinate division and binary opcode assignment according to embodiment 3;
FIG. 19 is a diagram illustrating final results of primary individual unit binary opcodes according to embodiment 3;
FIG. 20 is a schematic view of establishing a work activity area according to embodiment 3;
FIG. 21 is a schematic view of the main circuit communication in embodiment 3;
fig. 22 is a schematic diagram of branch line communication and establishment of a final safety layout optimization path in embodiment 3.
Detailed Description
Example 1
As shown in fig. 1, a method for optimizing a safety measure arrangement path of a substation relay protection room includes the following steps:
first, as shown in fig. 2, a plan view of the substation relay protection room is taken, and the area is divided into coordinates, as shown in fig. 3, wherein coordinates of a certain entrance and exit are set to be (0, 0), a binary operation code of the area of the coordinates (0, 0) is b00, the entrance and exit is in a horizontal direction, so the horizontal direction of the entrance and exit is an axis of 0 vertical coordinate, horizontal coordinates sequentially extend rightward from the coordinates of the entrance and exit, 12 lines (0 line to 11 line) in total in fig. 3, the 0 th line and the 11 th line are vertical roads, and binary operation codes of other coordinate areas of the area related to the roads except for an origin of coordinates (0, 0) are set to be b01. And dividing the rest horizontal coordinates (1 to 10 columns) according to the width of the screen cabinet.
And secondly, setting an activation unit, namely setting the screen cabinet which needs to be worked by the maintainer as the activation unit, and setting the rest normal operation screen cabinets as the freezing units. As shown in fig. 4, the cabinet of coordinates (9, 3), (3, 1), (3, -3) is set as the activation unit.
And thirdly, assigning a binary operation code to the primary independent unit, assigning b00 to the binary operation code of the activation unit, assigning b01 to the binary operation code of the freezing unit, and assigning b11 to the binary operation code of the virtual unit. As shown in fig. 5, the binary operation code b00 is assigned to the activated cells of the coordinates (9, 3), (3, 1), (3, -3), the binary operation code b11 is assigned to the virtual cells of the coordinates (2, 3), (10, 3), (5, 1), (6, 1), (2, -1), (6, -1), (8, -1), (2, -3), (4, -3), (5, -3), (7, -3), (8, -3), (9, -3), and the remaining frozen cells are assigned to the binary operation code b01.
Fourthly, binary operation codes of the activated unit, the frozen unit and the adjacent virtual unit are operated, the activated unit coordinates (9, 3) and the frozen units of the adjacent coordinates (8, 3) are not operated according to the binary operation code operation rule, calculation between the activated unit and the virtual unit has high priority, the binary operation codes of the activated unit coordinates (9, 3) and the virtual units of the adjacent coordinates (10, 3) are operated according to bits, b00& b11= b00, the binary operation codes of the virtual units of the coordinates (10, 3) are assigned as b00 again, and the virtual unit is changed into a virtual activated unit. The adjacent units on the left and right of the coordinate (3, 1) activation unit are all freezing units, so that the units do not participate in the operation. Coordinates (2, -3) the virtual unit left side is a coordinate (1, -3) freezing unit, the right side is a coordinate (3, -3) activating unit, according to the priority rule, the coordinate (2, -3) virtual unit preferentially performs binary bitwise AND operation with the coordinate (3, -3) activating unit, b11& b00= b00, the binary operation code of the virtual unit of the coordinates (2, -3) is assigned to b00 again, the virtual unit is changed into a virtual activating unit, the virtual activating unit can be processed by being equal to the activating unit, according to the operation rule, the activating unit does not perform operation with the freezing unit, and then the final binary operation code of the virtual unit of the coordinates (2, -3) is b00. Coordinates (4, -3) the virtual unit has coordinates (3, -3) the active unit on the left and coordinates (5, -3) the virtual unit on the right. According to the operation rule, the coordinate (4, -3) virtual unit preferentially performs bitwise AND operation with the coordinate (3, -3) activation unit but does not perform operation with the coordinate (5, -3) virtual unit, b11& b00= b00, the binary operation code of the virtual unit of the coordinate (4, -3) is assigned b00 again, the virtual unit is changed into a virtual activation unit, the virtual activation unit can be processed equivalently to the activation unit, in this case, the virtual activation unit of the coordinate (5, -3) on the left side is a virtual activation unit of (4, -3) and the freezing unit of the coordinate (4, -3) on the right side is a freezing unit of (6, -3), according to the priority operation rule, the binary operation code of the virtual unit of the coordinate (5, -3) preferentially performs bitwise AND operation with the virtual activation unit of (4, -3), b11& b00= b00, the binary operation code of the virtual unit of the coordinate (5, -3) is assigned b00 again, the virtual unit is changed into a virtual activation unit, the virtual activation unit can be processed equivalently to the activation unit, according to the operation rule, the binary operation code of the coordinate (5, -3) and the activation unit of the coordinate (5, -3) and the binary operation code of the activation unit of the final freezing unit of the virtual activation unit of the coordinate (5, -3) is assigned b00. The calculation between the frozen cell and the virtual cell has a medium priority, the left and right adjacent of the virtual cell of the coordinates (2, 3) are the frozen cells, bitwise and operation is required, b11& b01= b01, the binary operation code of the virtual cell of the coordinates (2, 3) is assigned to b01 again, and the virtual cell is changed to the virtual frozen cell. The left side of the coordinate (5, 1) virtual unit is a coordinate (4, 1) freezing unit, the right side is a coordinate (6, 1) virtual unit, according to the operation rule, the coordinate (5, 1) virtual unit preferentially performs binary operation code operation with the coordinate (4, 1) freezing unit, b11& b01= b01, the binary operation code of the virtual unit of the coordinate (5, 1) is assigned to b01 again, and the virtual unit is changed into a virtual freezing unit. The virtual freezing unit can be processed as the freezing unit, in this case, the left side of the coordinate (6, 1) virtual unit is the coordinate (5, 1) virtual freezing unit, the right side of the coordinate (7, 1) freezing unit is processed by the freezing unit, and the final results of the binary operation codes of the coordinate (6, 1) virtual freezing unit, the left side coordinate (5, 1) virtual freezing unit and the right side coordinate (7, 1) freezing unit are both b01. Similarly, the final binary operation code of the virtual units of the coordinates (2, -1), (6, -1), (8, -1), (7, -3), (8, -3) and (9, -3) is b01, and all the binary operation codes are changed into the virtual frozen units. After this step is completed, the binary opcodes of the active cells and the virtual active cells are b00, the binary opcodes of the frozen cells and the virtual frozen cells are b01, and the virtual cells with the binary opcodes b11 do not exist, as shown in fig. 6.
And fifthly, assigning and operating binary operation codes to the extension areas of all the units, assigning the extension areas of the units according to the final assignment of the binary operation codes of the units in the previous step, wherein the calculation among the extension areas has low priority, and as shown in fig. 7, due to the existence of an overlapping part, for example, coordinates (3, 2) of an upper extension area of an activation unit of coordinates (3, 1) also belong to a lower extension area of a freezing unit of coordinates (3, 3), the extension areas of the coordinates (3, 2) are simultaneously assigned with two values of b00 and b01. Similarly, the extended regions of coordinates (9, 2), (10, 2), (3, 0), (2, -2), (3, -2), (4, -2), (5, -2) are each assigned two values, b00 and b01. At this time, the bitwise and operation itself needs to be performed on the region having two binary operation codes, b00& b01= b00, the final binary operation code of the extended region of coordinates (3, 2), (9, 2), (10, 2), (3, 0), (2, -2), (3, -2), (4, -2), (5, -2) is b00, and the final result is as shown in fig. 8, and the operation of the extended region is completed in this step.
And sixthly, the upper area of the activation unit extension is communicated with the lower area through the shortest distance line, and a working activity area is established. As shown in fig. 8, the unit of the coordinates (9, 3), (10, 3) belongs to the activation unit, the extended areas of the coordinates (9, 4), (10, 4) are adjacent and connected left and right, the extended areas of the coordinates (9, 2), (10, 2) are adjacent and connected left and right, and at this time, the extended areas of the coordinates (9, 4), (10, 4) and the extended areas of the coordinates (9, 2), (10, 2) are not connected, at this time, the two areas need to be connected by the shortest distance, and the connection distance from the coordinates (10, 2) to the coordinates (10, 4) through the coordinates (11, 2), (11, 3), (11, 4) is calculated to be 3 shortest, so that the line is selected, and the binary operation code of the road area of the coordinates (11, 2), (11, 3), (11, 4) is reassigned b00, as shown in fig. 9. Similarly, the coordinates (3, 2) are communicated with the extended area of the coordinates (3, 0) through the areas of the coordinates (2, 2), (1, 2), (0, 1), (0, 0), (1, 0) and (2, 0), the shortest distance is 7, the binary operation codes of the extended areas of the coordinates (2, 2), (1, 0) and (2, 0) are reassigned to b00, and the binary operation codes of the road areas of the coordinates (0, 2) and (0, 1) are reassigned to b00. Similarly, the binary operation codes of the extended areas of the coordinates (1, -2) and (1, -4) are reassigned to b00, and the binary operation codes of the road areas of the coordinates (0, -2) and (0, -3) and (0-4) are reassigned to b00. As shown in fig. 9, a total of 3 working active areas are formed at this time.
And step seven, communicating the main lines. In the last step, three working activity areas are formed, and the working activity areas are communicated with the entrances and exits to form a complete working route. The coordinates in the three working activity areas with the shortest distance from the entrance and exit coordinate origin (0, 0) are (9, 2), (0, 0) and (0, -2) areas respectively, the sum of the absolute values of the horizontal and vertical coordinates of the coordinates (9, 2) can be judged to be 11, the sum of the absolute values of the horizontal and vertical coordinates of the coordinates (9, 2) is larger than the sum of the absolute values of the horizontal and vertical coordinates of the other two coordinates, the working activity area in which the coordinates (9, 2) is located is judged to be farthest away from the coordinate origin (0, 0), the shortest path between the coordinates (9, 2) and the origin (0, 0) is connected in a mode that all coordinate areas (including the coordinates (8, 2), (7, 2), (6, 2), (5, 2), (4, 2), (3, 2), (2, 2), (1, 2), (0, 2) areas) with the vertical coordinate of which is 2 and the horizontal coordinate of which is smaller than 9 are activated, a binary operation code b00 is assigned, and the coordinate point (0, 1) is connected to the coordinate origin (0, 0) area and the binary operation code b00 is activated. This route is the main route, as shown in fig. 10.
And step eight, communicating branch lines. The communication of the main route is completed in the last step, and the work activity area farthest from the entrance is communicated with the entrance. The communication between the rest of the work activity areas and the branch lines of the entrances and the exits is completed in the step, and the entrance coordinate (0, 0) area is contained in the work activity area where the coordinate (3, 1) activation unit is located according to the step, so that the work activity area is communicated with the coordinate origin (0, 0) without calculating and communicating the branch lines. The shortest route from the working activity area where the coordinates (0, -2) are located to the origin of coordinates (0, 0) is the route passing through the coordinates (0, -1) road area to connect the two, so that the coordinates (0, -1) area is activated and the binary operation code b00 is assigned again, as shown in fig. 11, and after the step is completed, all the working activity areas are connected with the entrance and exit.
And ninthly, setting an optimized path for the safety measure layout. After the previous step is completed, all coordinate areas are assigned with binary operation codes b00 or b01, and the coordinate area with the binary operation code b00 is used for arranging an optimized path for the safety measures of the relay protection room. The coordinate area with the binary operation code b01 is a non-working active area, the non-working active coordinate area of the binary operation code b01 is managed in a closed mode, as shown in fig. 12, after the step is completed, the relay protection indoor safety measure arrangement optimization path is distinguished from the non-working active area, and the final relay protection indoor safety measure arrangement optimization path is achieved.
Example 2
With reference to fig. 13, a method for optimizing a safety measure layout path of a relay protection room of a transformer substation is further described, which specifically includes the following steps:
in the first step, the substation relay protection room area is divided into coordinates as shown in fig. 13, wherein coordinates of a certain entrance and exit are set to be (0, 0), a binary operation code of the coordinate (0, 0) area is set to be b00, the entrance and exit is in the vertical direction, the vertical direction of the entrance and exit is an axis of abscissa 0, the ordinate sequentially extends from 0 to 8, the abscissa sequentially extends rightward from the coordinates of the entrance and exit, 12 total columns (0 column to 11 column) in fig. 13, the 0 th column and the 11 th column are vertical roads, and binary operation codes of other coordinate areas of the area related to the roads except for an origin of coordinates (0, 0) are set to be b01. And dividing the rest horizontal coordinates (1 to 10 columns) according to the width of the screen cabinet.
And secondly, setting an activation unit, namely setting the screen cabinet which needs to be worked by the maintainer as the activation unit, and setting the rest normal operation screen cabinets as the freezing units. As shown in fig. 13, the cabinet having coordinates (3, 7), (9, 3) is set as an activation unit.
And thirdly, assigning a binary operation code to the primary independent unit, assigning b00 to the binary operation code of the activation unit, assigning b01 to the binary operation code of the freezing unit, and assigning b11 to the binary operation code of the virtual unit. The active cells of coordinates (3, 7), (9, 3) are assigned to binary opcode b00, the virtual cells of coordinates (2, 7), (10, 7), (5, 5), (6, 5), (2, 3), (6, 3), (8, 3), (2, 1), (4, 1), (5, 1) are assigned to binary opcode b11, and the remaining frozen cells are assigned to binary opcode b01.
Fourthly, binary operation codes of the activated unit, the frozen unit and the adjacent virtual unit are operated, the activated unit coordinates (3, 7) and the frozen units of the adjacent coordinates (4, 7) are not operated according to the binary operation code operation rule, calculation between the activated unit and the virtual unit has high priority, the binary operation codes of the activated unit coordinates (3, 7) and the virtual units of the adjacent coordinates (2, 7) are operated according to bits, b00& b11= b00, the binary operation codes of the virtual units of the coordinates (2, 7) are assigned as b00 again, and the virtual unit is changed into a virtual activated unit. The left side of a coordinate (8, 3) virtual unit is a coordinate (7, 3) freezing unit, the right side is a coordinate (9, 3) activating unit, according to a priority rule, the coordinate (8, 3) virtual unit preferentially performs binary bitwise AND operation with the coordinate (9, 3) activating unit, b11& b00= b00, the binary operation code of the virtual unit of the coordinate (8, 3) is assigned to b00 again, the virtual unit is changed into a virtual activating unit, the virtual activating unit can be processed by being equal to the activating unit, according to the operation rule, the activating unit does not perform operation with the freezing unit, and then the final binary operation code of the virtual unit of the coordinate (8, 3) is b00. The calculation between the frozen unit and the virtual unit has a medium priority, the left side of the virtual unit of coordinates (10, 7) is the frozen unit of coordinates (9, 7) which needs bitwise and operation, b11& b01= b01, the binary opcode of the virtual unit of coordinates (10, 7) is assigned to b01 again, and the virtual unit is changed to the virtual frozen unit. The left side of the coordinate (5, 5) virtual unit is a coordinate (4, 5) freezing unit, the right side is a coordinate (6, 5) virtual unit, according to the operation rule, the coordinate (5, 5) virtual unit preferentially performs binary operation code operation with the coordinate (4, 5) freezing unit, b11& b01= b01, the binary operation code of the virtual unit of the coordinate (5, 5) is assigned to b01 again, and the virtual unit is changed into a virtual freezing unit. The virtual freezing unit can be processed by being equivalent to a freezing unit, when the freezing units with the coordinates (6, 5) at the left side of the virtual freezing unit are processed by the freezing unit, the freezing units with the coordinates (5, 5) at the right side are processed by the freezing unit, and the final results of the binary operation codes of the virtual freezing units with the coordinates (5, 5) at the left side and the freezing units with the coordinates (7, 5) at the right side are b01. Similarly, the final binary operation code of the virtual unit at coordinates (2, 3), (6, 3), (2, 1), (4, 1), (5, 1) is b01, and all the binary operation codes are changed to be virtual frozen units. After this step is completed, the binary opcodes of the active cells and the virtual active cells are b00, the binary opcodes of the frozen cells and the virtual frozen cells are b01, and the virtual cells with the binary opcodes b11 do not exist, as shown in fig. 14.
And fifthly, assigning and operating binary operation codes to the extension areas of all the units, assigning the extension areas of the units according to the final assignment of the binary operation codes of the units in the previous step, wherein the calculation among the extension areas has low priority, and as shown in fig. 15, due to the existence of an overlapping part, for example, coordinates (9, 4) of an upper extension area of an activation unit of coordinates (9, 3) also belong to a lower extension area of a freezing unit of coordinates (9, 5), the extension areas of the coordinates (9, 4) are simultaneously assigned with two values of b00 and b01. Similarly, the extended regions of the coordinates (2, 6), (8, 4), (8, 2), (9, 2) are each assigned two values, b00 and b01. At this time, it is necessary to perform bitwise and operation on the region having two different binary operation codes, and b00& b01= b00, the final binary operation code of the extended region of coordinates (2, 6), (3, 6), (8, 4), (9, 4), (8, 2), and (9, 2) is b00, and the final result is as shown in fig. 16, and the operation of the extended region is completed in this step.
And sixthly, the upper area and the lower area of the activation unit are expanded to be communicated with each other by the shortest route, and a working activity area is established. As shown in fig. 16, the units of the coordinates (2, 7), (3, 7) belong to the active unit, the extended areas of the coordinates (2, 8), (3, 8) are adjacent and connected left and right, the extended areas of the coordinates (2, 6), (3, 6) are adjacent and connected left and right, and at this time, the extended areas of the coordinates (2, 8), (3, 8) and the extended areas of the coordinates (2, 6), (3, 6) are not connected, at this time, the two areas need to be connected by the shortest distance, and the shortest connection distance is calculated from the coordinates (2, 8) through the coordinates (1, 8), (0, 7), (0, 6), (1, 6) and the coordinates (2, 6) to be 5, so that the link is selected, and the binary operation code of the extended areas of the coordinates (1, 8), (1, 6) is reassigned to b00, and the binary operation code of the road areas of the coordinates (0, 8), (0, 7), (0, 6) is reassigned to b00. Similarly, the coordinates (9, 4) are communicated with the extended area of the coordinates (9, 2) through the areas of the coordinates (10, 4), (11, 3), (11, 2) and (10, 2), the shortest distance is 5, the binary operation codes of the extended areas of the coordinates (10, 4) and (10, 2) are reassigned to b00, and the binary operation codes of the road areas of the coordinates (11, 4), (11, 3) and (11, 2) are reassigned to b00. In this case, a total of 2 active areas of operation are formed.
And step seven, communicating the main lines. In the last step, 2 working activity areas are formed, and the working activity areas are communicated with the entrances and exits to form a complete working route. In the 2 working activity areas, the coordinates with the shortest distance from the origin (0, 0) of the coordinates of the entrance and exit are (8, 2) and (0, 6) areas respectively, the sum of the absolute values of the horizontal and vertical coordinates of the coordinates (8, 2) can be judged to be 10, and is larger than the sum of the absolute values of the horizontal and vertical coordinates of the coordinates (0, 6), the working activity area where the coordinates (8, 2) is located is judged to be farthest from the origin (0, 0), the shortest path between the coordinates (8, 2) and the origin (0, 0) is connected in a mode that all coordinate areas (including the coordinates (7, 2), (6, 2), (5, 2), (4, 2), (3, 2), (2, 2), (1, 2) and (0, 2)) with the vertical coordinate being 2 and the horizontal coordinate being smaller than 8 are activated, and are assigned with a binary operation code b00, and coordinate points (0, 1) are connected to the area of the origin (0, 0) and are activated to be assigned with the binary operation code b00. This route is the main route.
And step eight, communicating branch lines. The communication of the main route is completed in the last step, and the work activity area farthest from the entrance is communicated with the entrance. This step completes the communication between the rest of the work activity areas and the branch lines of the entrance and the exit. The shortest route of the working activity area where the coordinates (0 and 6) are located and the main route is communicated through the coordinate (0, 5), (0, 4) and (0, 3) areas, so that the coordinate (0, 5), (0, 4) and (0, 3) areas are activated and the binary operation code b00 is assigned again, and after the step is completed, all the working activity areas are communicated with the entrance and the exit.
And ninthly, setting an optimized path for the safety measure layout. After the previous step is finished, all coordinate areas are assigned with binary operation codes b00 or b01, and the coordinate area with the binary operation code b00 is used for arranging an optimized path for safety measures of the relay protection room. The coordinate area with the binary operation code b01 is a non-working active area, the non-working active coordinate area of the binary operation code b01 is managed in a closed mode, as shown in fig. 17, after the step is completed, the relay protection indoor safety measure arrangement optimization path is distinguished from the non-working active area, and the final relay protection indoor safety measure arrangement optimization path is achieved.
Example 3
A method for optimizing a safety measure layout path of a relay protection room of a transformer substation specifically comprises the following steps: further description with reference to FIGS. 18-22
In the first step, a substation relay protection room area is divided into coordinates, as shown in fig. 18, coordinates of a certain entrance and exit are set to be (0, 0), a binary operation code of the coordinate (0, 0) area is set to be b00, the entrance and exit is vertical, so the longitudinal direction of the entrance and exit is an axis of 0 abscissa, the ordinate sequentially extends from 0 to 12, the abscissa sequentially extends rightward from the coordinates of the entrance and exit, 30 rows (0 row to 29 rows) are included in fig. 18, the 0 th row and the 29 th row are vertical roads, and the rest of abscissas (1 row to 28 rows) are divided into areas according to the width of a screen cabinet.
And secondly, setting an activation unit, namely setting the screen cabinet which needs to be worked by the maintainer as the activation unit, and setting the rest normal operation screen cabinets as the freezing units. As shown in fig. 18, the cabinet having coordinates (19, 3), (10, 7), (24, 7), (26, 9), (17, 11) is set as an activation unit.
And thirdly, assigning binary operation codes to the primary independent units, assigning the binary operation codes of the activated units to b00, assigning the binary operation codes of the frozen units to b01, setting the binary operation codes of other coordinate areas except the coordinate origin (0, 0) of the area related to the 0 th row and the 29 th row of roads to b01, and assigning the binary operation codes of the virtual units to b11.
Fourthly, binary operation codes of the active units, the frozen units and the adjacent virtual units are operated, the virtual units of coordinates (18, 11) are preferentially subjected to binary operation codes bitwise AND operation with the active unit coordinates (17, 11) according to a binary operation code operation rule, if b00& b11= b00, the binary operation codes of the virtual units of the coordinates (18, 11) are assigned to b00 again, and the virtual units are changed into virtual active units. The binary opcode of the virtual cell at the coordinate (25, 7) is bitwise and-operated with the active cell coordinate (24, 7) first, and b00& b11= b00, then the binary opcode of the virtual cell at the coordinate (25, 7) is assigned again to b00, and the virtual cell is changed to a virtual active cell. The binary and operation is performed on the virtual cell of the coordinates (26, 7) and the virtual active cell coordinates (25, 7), and b00& b11= b00, the binary opcode of the virtual cell of the coordinates (26, 7) is assigned to b00 again, and the virtual cell is changed to a virtual active cell, as shown in fig. 19. The remaining virtual units are finally assigned b01 by binary opcode operations.
Fifthly, binary operation code assignment and operation are carried out on the extension areas of all the units, operation assignment is carried out on the extension areas according to the final assignment of the binary operation codes of the units in the previous step, and the operation results of the extension areas of the coordinates (19, 3), (10, 7), (24, 7), (26, 9), (17, 11), (18, 11), (25, 7) and (26, 7) are b00, as shown in fig. 19. Except for the origin of coordinates (0, 0), the binary operation code is b01.
And sixthly, the upper area of the activation unit extension is communicated with the lower area through the shortest distance line, and a working activity area is established. The minimum path communication is performed on the extended areas of the coordinates (17, 11), (18, 11), (26, 9), (24, 7), (25, 7), (26, 7), (10, 7), (19, 3), respectively, to form 5 working active areas, wherein the working active areas formed by the coordinates (17, 11), (18, 11), (26, 9), (24, 7), (25, 7), (26, 7) are communicated with each other to form 1 common working active area, as shown in fig. 20, and finally 3 working active areas are formed.
And step seven, communicating the main lines. In the last step, 3 working activity areas are formed, and the working activity areas are communicated with the entrances and exits to form a complete working route. In the 3 working activity areas, the coordinates with the shortest distance from the coordinate origin (0, 0) of the entrance and the exit are (17, 10), (0, 6) and (19, 2) areas respectively, the sum of the absolute values of the horizontal and vertical coordinates of the coordinates (17, 10) can be judged to be 27 and is larger than the sum of the absolute values of the horizontal and vertical coordinates of the coordinates (0, 6) and the sum of the absolute values of the horizontal and vertical coordinates of the coordinates (19, 2) 21, if the working activity area in which the coordinates (17, 10) are located is farthest away from the coordinate origin (0, 0), the shortest path between the coordinates (17, 10) and the origin (0, 0) is connected in a mode that all coordinate areas with the vertical coordinate of 10 and the horizontal coordinate of less than 17 are activated, a binary operation code b00 is assigned, then the coordinate points (0, 10) are connected to the coordinate (0, 0) area, and the binary operation code b00 is activated. This route is the main route, as shown in fig. 21.
And step eight, communicating branch lines. The communication of the main route is completed in the last step, and the work activity area farthest from the entrance is communicated with the entrance. The step is to complete the communication between the rest of the work activity areas and the branch lines of the entrance and the exit. The shortest route between the working activity area where the coordinates (19 and 3) are located and the main route is communicated through the coordinate (29 and 5) area, so that the coordinate (29 and 5) area is activated and reassigned to the binary operation code b00, the working activity area where the coordinates (10 and 7) are located and the main route have a part of coordinate overlapping area, and the working activity area is communicated with the main route, as shown in fig. 22, and after the step is completed, all the working activity areas and the access and exit are communicated.
And ninthly, setting an optimized path for the safety measure layout. After the previous step is completed, all coordinate areas are assigned with binary operation codes b00 or b01, and the coordinate area with the binary operation code b00 is used for arranging an optimized path for the safety measures of the relay protection room, as shown in fig. 22. And the coordinate area with the binary operation code b01 is a non-working active area, and after the step is finished, the relay protection indoor safety measure arrangement optimization path is distinguished from the non-working active area, so that the final relay protection indoor safety measure arrangement optimization path is realized.
Those skilled in the art will appreciate that the invention may be practiced without these specific details. The present invention is not limited in scope to the specific embodiments, and various modifications thereof will be apparent to those skilled in the art as long as they are within the spirit and scope of the present invention as defined and defined in the appended claims, and all the inventions utilizing the inventive concept are protected.
Claims (7)
1. A method for optimizing safety measure arrangement paths of a relay protection room of a transformer substation is characterized by comprising the following steps:
the relay protection chamber comprises an indoor screen cabinet, a road and an entrance and an exit of the relay protection chamber;
dividing horizontal and vertical coordinates by taking an entrance as a coordinate origin, and dividing indoor screen cabinets, roads and the entrance of the relay protection room into screen cabinet areas, screen cabinet front and rear areas, road areas and entrance and exit areas; each divided area is a grid area and carries out coordinate marking; giving a corresponding binary operation code initial value to each coordinate area;
dividing the relay protection chamber indoor screen cabinet into three primary independent units, including an activation unit, a freezing unit and a virtual unit;
setting an activation unit of an indoor screen cabinet of a relay protection chamber and a shortest route communicated between an expansion area of the activation unit and an upper and lower expansion areas of the activation unit as a working activity area;
setting a nearest route calculated by coordinates between an entrance and an exit and a working activity area as a safety measure layout path optimization route; when a plurality of working activity areas are involved, the main route of the working activity area farthest from the entrance is calculated preferentially, the branch route closest to the working activity area next farthest from the entrance and the main route in coordinates is calculated again until all the working activity areas are connected to the main route, and then the non-working activity areas are subjected to closed management.
2. The substation relay protection room safety measure arrangement path optimizing method according to claim 1, wherein the method comprises the following steps: the regular operation method of the binary operation code comprises the following steps: in the primary independent unit, no operation is performed between the transversely adjacent activation unit and activation unit, between the transversely adjacent freezing unit and freezing unit, between the transversely adjacent virtual unit and virtual unit, and between the transversely adjacent activation unit and freezing unit; and the activating unit, the freezing unit and the horizontally adjacent virtual units are operated according to the bitwise sum of the binary system, and the binary operation codes of the virtual units are assigned again.
3. The substation relay protection room safety measure arrangement path optimizing method according to claim 2, wherein the method comprises the following steps: the specific method for reassigning the binary operation code of the virtual unit comprises the following steps: the binary operation code b00 of the activation unit and the binary operation code b11 of the adjacent virtual unit are subjected to bitwise AND operation to obtain the binary operation code b00, the result b00 is reassigned to the virtual unit, the virtual unit with the binary operation code b00 can be treated as the same as the activation unit and is called a virtual activation unit, the binary operation code b01 of the freezing unit and the binary operation code b11 of the adjacent virtual unit are subjected to bitwise AND operation to obtain the binary operation code b01, the result b01 is reassigned to the virtual unit, and the virtual unit with the binary operation code b01 can be treated as the same as the freezing unit and is called a virtual freezing unit.
4. The substation relay protection room safety measure arrangement path optimizing method according to claim 1, wherein the method comprises the following steps: the activation unit is a screen cabinet which needs to work in the maintenance work; the freezing unit is a non-overhaul screen cabinet which needs to be subjected to closed management; the virtual unit is a reserved screen cabinet position.
5. The substation relay protection room safety measure arrangement path optimizing method according to claim 1, wherein the method comprises the following steps: the specific method for assigning the initial value of the binary operation code corresponding to each coordinate area is as follows: the binary operation code of the activation unit and the expansion area of the activation unit is b00; the binary operation code of the freezing unit and the freezing unit expansion area is b01; the binary operation code of the virtual unit and the virtual unit extension area is b11; the binary operation code of the entrance and exit area is b00; the binary operation code of the road area is b01;
the final binary operation code of the working active area, the entrance area and the path area communicated with the entrance is b00, and the final binary operation code of the non-working active area is b01.
6. The substation relay protection room safety measure arrangement path optimization method according to claim 1, characterized in that: the coordinates of the entrance and exit areas are origin coordinates (0, 0); the row of the minimum value and the maximum value of the abscissa of the relay protection room is a road area; the screen cabinet area is divided by taking the independent screen cabinet as a unit, one screen cabinet corresponds to one screen cabinet coordinate area, and the front area and the rear area of the screen cabinet are vertically extended coordinate areas by taking the screen cabinet as a center.
7. The substation relay protection room safety measure arrangement path optimizing method according to claim 1, wherein the method comprises the following steps: and finally, arranging an optimized path for the safety measures in the relay protection room in a coordinate area with the binary operation code of b00.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211079662.3A CN115146879B (en) | 2022-09-05 | 2022-09-05 | Optimization method for safety measure arrangement path of relay protection room of transformer substation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211079662.3A CN115146879B (en) | 2022-09-05 | 2022-09-05 | Optimization method for safety measure arrangement path of relay protection room of transformer substation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115146879A true CN115146879A (en) | 2022-10-04 |
| CN115146879B CN115146879B (en) | 2022-12-06 |
Family
ID=83415806
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211079662.3A Active CN115146879B (en) | 2022-09-05 | 2022-09-05 | Optimization method for safety measure arrangement path of relay protection room of transformer substation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115146879B (en) |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104200044A (en) * | 2014-09-18 | 2014-12-10 | 国家电网公司 | GIS (geographic information system)-based three-dimensional power transmission line path selection method |
| WO2015188626A1 (en) * | 2014-06-10 | 2015-12-17 | 国家电网公司 | Method for viewing single line diagram of electric power system on mobile terminal in real time |
| CN105956692A (en) * | 2016-04-26 | 2016-09-21 | 武汉供电设计院有限公司 | Cable automatic laying design method based on coordinate identification |
| CN106710023A (en) * | 2015-11-13 | 2017-05-24 | 山东建筑大学 | Intelligent substation enclosing method based on RFID |
| CN106934484A (en) * | 2016-12-08 | 2017-07-07 | 国网浙江省电力公司 | A kind of live O＆M based on PDA day work planing method |
| CN107452057A (en) * | 2017-08-23 | 2017-12-08 | 国网浙江省电力公司检修分公司 | Three-dimensional live intelligent integral security application system |
| CN109359789A (en) * | 2018-12-19 | 2019-02-19 | 中国电建集团贵州电力设计研究院有限公司 | Substation's O&M path planning navigation system and air navigation aid based on Beidou positioning |
| CN109711567A (en) * | 2018-12-14 | 2019-05-03 | 珠海优特电力科技股份有限公司 | Service work safety measure Automatic generation of information method and system |
| CN111239768A (en) * | 2020-01-13 | 2020-06-05 | 南京七宝机器人技术有限公司 | Method for automatically constructing map and searching inspection target by electric power inspection robot |
| CN111915106A (en) * | 2020-10-09 | 2020-11-10 | 上海高仙自动化科技发展有限公司 | Path generation method and device, crystal face machine and storage medium |
| CN112033428A (en) * | 2020-09-02 | 2020-12-04 | 国网河北省电力有限公司保定供电分公司 | Path planning method for power distribution first-aid repair |
| CN112488677A (en) * | 2021-02-07 | 2021-03-12 | 国能信控互联技术有限公司 | Work ticket management system based on UWB personnel location |
-
2022
- 2022-09-05 CN CN202211079662.3A patent/CN115146879B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2015188626A1 (en) * | 2014-06-10 | 2015-12-17 | 国家电网公司 | Method for viewing single line diagram of electric power system on mobile terminal in real time |
| CN104200044A (en) * | 2014-09-18 | 2014-12-10 | 国家电网公司 | GIS (geographic information system)-based three-dimensional power transmission line path selection method |
| CN106710023A (en) * | 2015-11-13 | 2017-05-24 | 山东建筑大学 | Intelligent substation enclosing method based on RFID |
| CN105956692A (en) * | 2016-04-26 | 2016-09-21 | 武汉供电设计院有限公司 | Cable automatic laying design method based on coordinate identification |
| CN106934484A (en) * | 2016-12-08 | 2017-07-07 | 国网浙江省电力公司 | A kind of live O＆M based on PDA day work planing method |
| CN107452057A (en) * | 2017-08-23 | 2017-12-08 | 国网浙江省电力公司检修分公司 | Three-dimensional live intelligent integral security application system |
| CN109711567A (en) * | 2018-12-14 | 2019-05-03 | 珠海优特电力科技股份有限公司 | Service work safety measure Automatic generation of information method and system |
| CN109359789A (en) * | 2018-12-19 | 2019-02-19 | 中国电建集团贵州电力设计研究院有限公司 | Substation's O&M path planning navigation system and air navigation aid based on Beidou positioning |
| CN111239768A (en) * | 2020-01-13 | 2020-06-05 | 南京七宝机器人技术有限公司 | Method for automatically constructing map and searching inspection target by electric power inspection robot |
| CN112033428A (en) * | 2020-09-02 | 2020-12-04 | 国网河北省电力有限公司保定供电分公司 | Path planning method for power distribution first-aid repair |
| CN111915106A (en) * | 2020-10-09 | 2020-11-10 | 上海高仙自动化科技发展有限公司 | Path generation method and device, crystal face machine and storage medium |
| CN112488677A (en) * | 2021-02-07 | 2021-03-12 | 国能信控互联技术有限公司 | Work ticket management system based on UWB personnel location |
Non-Patent Citations (5)
| Title |
|---|
| XUE-CHENG LAI等: "Hierarchical Incremental Path Planning and Situation-Dependent Optimized Dynamic Motion Planning Considering Accelerations", 《IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS, PART B (CYBERNETICS)》 * |
| 冯俊杰 等: "基于双星多频技术的人员安全定位装置研发", 《山西电力》 * |
| 孙小磊 等: "变电站室内二次屏柜无人机巡检系统研究", 《湖北电力》 * |
| 陈明等: "变电站实体安全措施电子化替代研究", 《山东电力技术》 * |
| 陈超强 等: "计及设备信息的配电设备多组巡检路径优化策略", 《中国电力》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115146879B (en) | 2022-12-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9088160B2 (en) | Load restoration for feeder automation in electric power distribution systems | |
| CN108695846B (en) | Unit distribution power grid operation risk assessment method | |
| CN103488873B (en) | A kind of multi-mode hidden fault risk analysis method of relay protection system | |
| CN112329376A (en) | Monte Carlo simulation-based substation system shock resistance toughness quantitative evaluation algorithm | |
| CN101871988A (en) | System and method for positioning medium voltage distribution network using power line carrier communication | |
| CN106953319B (en) | Optimal segmentation method and device for power distribution network line | |
| CN106067658B (en) | Parameterize Separation control equipment and/or the method and apparatus for protecting equipment | |
| CN107991902B (en) | Modeling and simulation method of power supply system of spacecraft | |
| CN109494728B (en) | Power distribution terminal site selection and type selection method | |
| CN115146879A (en) | Optimization method for safety measure arrangement path of transformer substation relay protection room | |
| Moradi et al. | A reliability cost/worth approach to determine optimum switching placement in distribution systems | |
| CN113297727A (en) | Nuclear power plant cable fire protection selection design method based on probability safety analysis | |
| CN114091885B (en) | Power protection method and system for important power utilization clients | |
| CN110009240B (en) | Power system reliability assessment method | |
| CN111738525A (en) | Power distribution automation terminal optimization layout method based on importance ranking | |
| CN207765959U (en) | A kind of intelligent grid scheduling controlling comprehensive training system | |
| CN102545138B (en) | Modeling power supply recovering method | |
| CN114977185A (en) | Power grid partition and power grid key section identification method based on AP clustering algorithm | |
| CN109450090A (en) | One kind lacking place's operation safety and protects system | |
| CN112395715A (en) | Assessment method and system for wiring bus electric network maintenance plan | |
| CN110309992B (en) | Distribution network reliability-based measurement equipment point distribution method and system | |
| CN210804100U (en) | Nuclear power plant reactor protection system response time test signal selection device | |
| CN105655880A (en) | Voltage load balanced distribution configuration mode of 110 kV system buses in intelligent substation double-bus wiring mode | |
| Acevedo-Iles et al. | Distributed protection coordination algorithm applied to overcurrent-based schemes | |
| Ezzat | Reliability Enhancement in Distribution Systems Through Distributed Generator and Capacitor Allocation Using Flower Pollination Algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |