Methods, devices, and electronic equipment for generating work paths in substations

By generating the optimal work path in the substation and linking it with access control and equipment locks, the safety hazards of relying on manual experience and incomplete path planning in substation maintenance operations are solved, achieving precise physical restrictions on workers and improving safety.

CN123117490APending Publication Date: 2026-11-17广西电网有限责任公司来宾供电局
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202611228361.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-08-13
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

The route planning for substation maintenance work relies on manual experience or static drawings, which poses safety hazards, such as accidentally entering live equipment and problems with ineffective route control.

Method used

By generating the optimal work path and linking it with access control and equipment locks, precise physical restrictions on the range of access for workers can be achieved. The generation method includes obtaining the work task, the three-dimensional spatial model of the substation and safety constraint information, determining restricted and non-restricted areas, generating the optimal path, and issuing authorization commands to unlock access control and equipment locks in the space it passes through.

Benefits of technology

It improves the safety of substation operation and maintenance, ensures that operators travel along the optimal path, avoids accidentally entering non-operational areas, and realizes the effective constraint of path planning results on personnel travel routes.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123117490A_ABST
    Figure CN123117490A_ABST
Patent Text Reader

Abstract

This disclosure provides a method, apparatus, and electronic device for generating work paths in a substation. The method involves acquiring work task information, a three-dimensional spatial model of the substation, and safety constraint information. Based on the safety constraint information, restricted and non-restricted areas are determined in the three-dimensional spatial model. Based on the work task information, an optimal work path is generated in the non-restricted areas. An authorization instruction is generated based on the optimal work path to issue unlocking permissions for access control and / or equipment locks within the traversed space to the workers, enabling them to reach the target work equipment according to the optimal work path. This method, by linking the optimal work path with access control and equipment lock settings, achieves precise physical restrictions on the accessible range of workers, solving the safety problem in existing technologies where path planning results cannot effectively constrain the actual travel routes of personnel and lead to accidental entry into non-work areas, thereby improving the safety of substation operation and maintenance operations.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This disclosure relates to the field of computer technology, and in particular to a method, apparatus and electronic device for generating work paths in a substation. Background Technology

[0002] Currently, substation maintenance route planning mainly relies on manual experience or static drawings, which carries the risk of incomplete verification. This can lead to the inclusion of potentially hazardous equipment along the planned route, such as live equipment that should not be accessed. Furthermore, the lack of control over work routes in current maintenance operations means that workers' tasks are not linked to access control and / or equipment lock permissions along the route, resulting in safety hazards such as workers accidentally entering live areas or deviating from the planned route. Summary of the Invention

[0003] In view of this, the purpose of this disclosure is to provide a method, device and electronic equipment for generating work paths in substations. By linking the optimal work path with access control and equipment lock settings, precise physical restrictions on the range of personnel's access are achieved. This solves the safety problem in the prior art where path planning results cannot effectively constrain the actual travel route of personnel and may lead to accidental entry into non-work areas, thereby improving the safety of substation operation and maintenance operations.

[0004] In a first aspect, embodiments of this disclosure provide a method for generating work paths in a substation. The method includes: acquiring work task information, a three-dimensional spatial model of the substation, and safety constraint information; determining restricted and non-restricted areas in the three-dimensional spatial model based on the safety constraint information; generating an optimal work path in the non-restricted areas, starting from the substation entrance and ending at the target work equipment, based on the work task information; determining the path space corresponding to the optimal work path from the physical space of the substation based on the three-dimensional spatial model and the optimal work path; and generating an authorization instruction based on the optimal work path. The authorization instruction is used to: grant unlocking permissions for access control and / or equipment locks within the path space to the workers, enabling them to reach the target work equipment according to the optimal work path.

[0005] The steps described above for generating the optimal work path in a non-restricted area based on the work task information, starting from the substation entrance and ending at the target work equipment, include: determining the target work equipment based on the work task information, using the substation entrance as the starting point of the path search, and the position of the target work equipment in the three-dimensional spatial model as the ending point of the path search; using a path search algorithm to search for the optimal path from the starting point to the ending point in the non-restricted area, and determining the optimal path as the best work path; wherein, the path search algorithm aims to minimize the total path cost, which includes the sum of the actual travel cost from the starting point to the current node and the estimated travel cost from the current node to the ending point.

[0006] The actual passage costs mentioned above include: a first passage cost, a second passage cost, and a third passage cost; the first passage cost is determined based on the preset passage cost of the spatial area corresponding to the current node; wherein, the preset passage cost is determined based on the area identifier of the spatial area, and different area identifiers correspond to different preset passage costs, and the area identifiers include at least non-restricted signs and restricted signs; the preset passage cost corresponding to the restricted sign is greater than the preset passage cost corresponding to the non-restricted sign; the second passage cost is determined based on the distance from the current node to the nearest restricted area; the third passage cost is determined based on whether the current node overlaps with other operation paths; the estimated passage cost is determined based on the distance from the current node to the destination and the safe distance from the current node to the nearest restricted area.

[0007] The steps described above for searching the optimal path from the starting point to the destination in a non-restricted area using a path search algorithm include: dividing the 3D spatial model into multiple nodes, each node corresponding to a spatial region; taking the starting point as the current node, and determining multiple candidate nodes adjacent to the current node from among the multiple nodes; for each candidate node, calculating the actual travel cost from the current node to the candidate node and the expected travel cost from the candidate node to the destination, and determining the sum of the actual travel cost and the expected travel cost as the target travel cost of the candidate node; taking the candidate node with the minimum target travel cost as the path node; determining the path node as the current node, and continuing to execute the step of determining multiple candidate nodes adjacent to the current node from among the multiple nodes until the current node is the destination, and determining the obtained path node as the optimal operation path.

[0008] The steps described above for calculating the actual travel cost from the current node to the candidate node include: ; ; ; ; in, As a candidate node, For the actual cost of passage; The first general cost is determined by the candidate nodes. The corresponding spatial area's area identifier corresponds to the preset passage cost. Sure; As a second passage cost, Candidate nodes With the nearest target area The first distance between them For target area The corresponding area coefficients; where the target area includes: the second non-restricted area, the third non-restricted area, and the fourth non-restricted area in the restricted area and the non-restricted area, and different target areas correspond to different area coefficients; As a third passage cost, The preset passage cost.

[0009] The steps described above for calculating the estimated travel cost from a candidate node to the destination include: ; , ; in, As a candidate node, To anticipate the cost of passage, For the cost of the fourth passage, The weighting coefficient for the fourth passage cost. For the cost of the fifth passage, The weighting coefficient for the fifth passage cost is greater than the weighting coefficient for the fourth passage cost. Candidate nodes To the finish line distance, This is the first preset coefficient; Candidate nodes With the nearest restricted area distance, This is the second preset coefficient.

[0010] After determining multiple candidate nodes adjacent to the current node from multiple nodes, the method further includes: if the spatial region corresponding to the first candidate node among the multiple candidate nodes is in a restricted area, the first candidate node is deleted from the multiple candidate nodes.

[0011] Before the step of selecting the candidate node with the lowest target travel cost as the path node, the method further includes: determining whether a path node exists in a preset list; the preset list is used to store the starting point, candidate nodes, and the target travel cost of the candidate nodes; if it does not exist, the candidate node and its target travel cost are saved to the preset list; if it exists, the first total cost from the starting point through the current node to the candidate node is calculated, and the second total cost of the path candidate node is determined from the preset list; if the first total cost is less than the second total cost, the parent node of the candidate node saved in the preset list is updated to the current node, and the second total cost of the candidate node is updated to the first total cost; otherwise, the candidate node saved in the preset list is retained.

[0012] The aforementioned safety constraint information includes at least one of the following: the energized state of primary equipment and the isolation boundary of secondary equipment; the step of determining prohibited and non-prohibited areas in a three-dimensional spatial model based on the safety constraint information includes: based on the energized state of primary equipment, determining the spatial area where the energized equipment is located and the spatial area at a predetermined distance from the energized equipment from the target as prohibited areas in the three-dimensional spatial model, and setting the area identifier of the prohibited areas as prohibited identifiers; determining the spatial areas in the three-dimensional spatial model other than the prohibited areas as non-prohibited areas, and setting the area identifier of the non-prohibited areas as non-prohibited identifiers.

[0013] The above method further includes: defining the maintenance passage area in the non-restricted area as the first non-restricted area, and setting the area identifier of the first non-restricted area as the first identifier; defining the auxiliary passage area in the non-restricted area as the second non-restricted area, and setting the area identifier of the third non-restricted area as the second identifier; defining the passage area near the cabinet equipment in the non-restricted area as the third non-restricted area based on the cabinet equipment in the three-dimensional spatial model, and setting the area identifier of the third non-restricted area as the third identifier; defining the space area enclosed by the isolation boundary in the non-restricted area as the fourth non-restricted area based on the secondary equipment isolation boundary, and setting the area identifier of the fourth non-restricted area as the fourth identifier; the preset passage cost corresponding to the first identifier is less than the preset passage cost corresponding to the second identifier, the preset passage cost corresponding to the second identifier is less than the preset passage cost corresponding to the third identifier, and the preset passage cost corresponding to the third identifier is less than the preset passage cost corresponding to the fourth identifier.

[0014] The above method further includes: obtaining the real-time location coordinates of the operator in the substation, and determining whether the real-time location coordinates deviate from the optimal work path; if so, performing the following steps: if the deviation distance is greater than or equal to a first distance threshold and less than a second distance threshold, generating a first warning signal, which is used to control the positioning device worn by the operator to issue a warning reminder; if the deviation distance is greater than or equal to a second distance threshold and less than a third distance threshold, generating a second warning signal, which is used to control the substation's broadcasting equipment to play a voice warning; if the deviation distance is greater than or equal to a third distance threshold, generating a third warning signal, which is used to send an access freeze signal to the substation's interlocking system to control the target equipment within the substation to be frozen; wherein, the target equipment is the equipment closest to the operator.

[0015] The above method also includes: generating guide light control instructions based on the optimal work path. The guide light control instructions are used to control the guide lights in the space through which the path passes to light up sequentially in the direction of the optimal work path, so as to guide the workers to move along the optimal work path.

[0016] The above method also includes: after the operator completes the task based on the optimal work path, the operator's movement trajectory, warning records, substation equipment status, task information, and optimal work path are saved to a preset storage space.

[0017] Secondly, this disclosure provides a device for generating work paths in a substation. The device includes: an information acquisition module for acquiring work task information, a three-dimensional spatial model of the substation, and safety constraint information; an area determination module for determining restricted and non-restricted areas in the three-dimensional spatial model based on the safety constraint information; a path generation module for generating an optimal work path in the non-restricted areas, starting from the substation entrance and ending at the target work equipment, based on the work task information; and an instruction generation module for determining the path space corresponding to the optimal work path from the physical space of the substation based on the three-dimensional spatial model and the optimal work path; and generating an authorization instruction based on the optimal work path. The authorization instruction is used to: issue unlocking permissions for access control and / or equipment locks within the path space to the workers, so that the workers can reach the target work equipment according to the optimal work path.

[0018] Thirdly, embodiments of this disclosure provide an electronic device, including a processor and a memory, the memory storing computer-executable instructions that can be executed by the processor, the processor executing the computer-executable instructions to implement the method for generating work paths in a substation according to any one of the first aspects.

[0019] Fourthly, embodiments of this disclosure provide a computer-readable storage medium storing computer-executable instructions. When the computer-executable instructions are invoked and executed by a processor, the computer-executable instructions cause the processor to implement the method for generating work paths in a substation according to any one of the first aspects.

[0020] The embodiments disclosed herein bring the following beneficial effects: This disclosure provides a method, apparatus, and electronic device for generating work paths in a substation. The method involves acquiring work task information, a three-dimensional spatial model of the substation, and safety constraint information. Based on the safety constraint information, restricted and non-restricted areas are determined in the three-dimensional spatial model. Based on the work task information, an optimal work path is generated in the non-restricted areas, starting from the substation entrance and ending at the target work equipment. Based on the three-dimensional spatial model and the optimal work path, the corresponding passage space of the optimal work path is determined from the physical space of the substation. An authorization instruction is generated based on the optimal work path. This authorization instruction is used to grant unlocking permissions for access control and / or equipment locks within the passage space to the workers, enabling them to reach the target work equipment according to the optimal work path. This method, by linking the optimal work path with access control and equipment locks, achieves precise physical restrictions on the accessible range of workers, solving the safety problem in existing technologies where path planning results cannot effectively constrain the actual travel route of personnel and lead to accidental entry into non-work areas, thereby improving the safety of substation operation and maintenance operations.

[0021] Other features and advantages of this disclosure will be set forth in the following description and will be apparent in part from the description or may be learned by practicing the disclosure. The objects and other advantages of this disclosure are realized and obtained through the structures particularly pointed out in the description, claims and drawings.

[0022] To make the above-mentioned objects, features and advantages of this disclosure more apparent and understandable, preferred embodiments are described below in detail with reference to the accompanying drawings. Attached Figure Description

[0023] To more clearly illustrate the technical solutions in the specific embodiments of this disclosure or the prior art, the drawings used in the description of the specific embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of this disclosure. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.

[0024] Figure 1 A flowchart illustrating a method for generating work paths in a substation, as provided in this embodiment of the disclosure; Figure 2A flowchart illustrating a method for generating work paths in a substation, provided in an embodiment of this disclosure; Figure 3 A flowchart illustrating another method for generating work paths in a substation, provided in an embodiment of this disclosure; Figure 4 A schematic diagram of the structure of a work path generation device in a substation provided in an embodiment of this disclosure; Figure 5 This is a schematic diagram of the structure of an electronic device provided in an embodiment of the present disclosure. Detailed Implementation

[0025] To make the objectives, technical solutions, and advantages of the embodiments of this disclosure clearer, the technical solutions of this disclosure will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this disclosure, and not all embodiments. Based on the embodiments of this disclosure, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this disclosure.

[0026] Currently, substation maintenance route planning mainly relies on manual experience or static drawings, which carries the risk of incomplete verification. This can lead to the inclusion of potentially hazardous equipment along the planned route, such as live equipment that should not be accessed. Furthermore, existing maintenance operations lack control over work routes, and the work tasks of personnel are not linked to access control and / or equipment lock permissions along the work route. This results in safety hazards such as personnel accidentally entering live areas or exceeding the planned route. Therefore, this disclosure provides a method, apparatus, and electronic equipment for generating work routes in substations.

[0027] To facilitate understanding of this embodiment, a method for generating work paths in a substation, as disclosed in this disclosure, will first be described in detail, such as... Figure 1 As shown, the method includes the following steps: Step S102: Obtain the work task information, the three-dimensional spatial model of the substation, and the safety constraint information; Optionally, the system can interface with the power grid management platform via a data interface to automatically obtain work orders and / or operation tickets to be executed. These work orders and / or operation tickets are then input into a large language model, which analyzes and extracts the core information of the work orders and operation tickets based on pre-set prompts to obtain the aforementioned task information. This task information includes at least: a list of personnel, start and end times of the operation, target equipment, safety measures (grounding, fencing, isolation interlocking, secondary pressure plate withdrawal range), and monitoring configuration relationships.

[0028] The aforementioned 3D spatial model of the substation is a 3D real-scene digital model. Optionally, the power grid management platform typically utilizes actual substation scene data and employs a 3D GIS (Geographic Information System) visualization platform to construct an initial 3D scene model. The 3D model replicates the substation space at a 1:1 scale, including the substation's planar coordinates, floor and equipment height information, and can distinguish different spatial layers such as outdoor structures, indoor protection rooms, and cable trays. The aforementioned safety constraint information includes the energized state of primary equipment and the isolation boundaries of secondary equipment. Optionally, the 3D spatial model and safety constraint information of the substation can be obtained from the power grid management platform.

[0029] Step S104: Based on the safety constraint information, determine the restricted and non-restricted areas in the three-dimensional space model; Optionally, based on the energized state of the primary equipment, the spatial area where the energized equipment is located and the spatial area within a preset target range from the energized equipment are designated as restricted zones in the 3D spatial model, and the zone markers are set as restricted zones. The preset target range can be determined according to the voltage level of the equipment; for example, it can be set to 5 meters for 220kV equipment and 3 meters for 110kV equipment. For spatial areas marked as restricted zones, the passage cost is set to infinity, making them impassable in subsequent path searches.

[0030] In the 3D spatial model, areas other than restricted zones are designated as non-restricted zones, and their area identifiers are set to non-restricted zone identifiers. For non-restricted zones, different types of non-restricted zones can be set based on their access type (e.g., main maintenance road, auxiliary maintenance road, narrow passage behind cabinets) and secondary equipment isolation boundaries, with different preset access costs to differentiate access priorities. For example, the preset access cost for the main maintenance road is 1, while the preset access cost for the area enclosed by the secondary equipment isolation boundary is 20.

[0031] In addition, the above method also includes: acquiring updated safety constraint information in real time, and updating the division results of restricted and non-restricted areas based on the updated safety constraint information, so that the map data always remains consistent with the actual situation on site.

[0032] Step S106: Based on the task information, generate the optimal work path in the non-restricted area, starting from the entrance of the substation and ending at the target work equipment. Based on the task information, the target equipment is determined, and the substation entrance is used as the starting point for path searching, with the location of the target equipment in the 3D spatial model as the ending point. A path search algorithm is used to search for the optimal path from the starting point to the ending point within the non-restricted area, and this optimal path is determined as the best operational path. The path search algorithm aims to minimize the total path cost, which includes the sum of the actual travel cost from the starting point to the current node and the estimated travel cost from the current node to the ending point. The formula for calculating the total path cost is: ; in, From the starting point to the current node The actual cost of passage, To start from the current node The estimated cost of travel to the destination.

[0033] Specifically, the actual cost of passage The estimated passage cost consists of the following: the basic passage cost of the spatial area where the current node is located (i.e., the first passage cost below); different basic passage costs (preset passage costs) corresponding to different area types (such as main maintenance roads, auxiliary maintenance roads, sensitive areas for secondary equipment, etc.); the hazard penalty cost resulting from the distance of the current node to the nearest restricted area (i.e., the second passage cost below); and the intersection conflict penalty cost resulting from whether the current node overlaps with other work paths (i.e., the third passage cost below). The distance is determined by combining the spatial distance from the current node to the destination and the safe distance from the current node to the nearest restricted area.

[0034] The specific search process involves discretizing the 3D spatial model into multiple 3D grid nodes, each corresponding to a spatial region. At the start of the search, the system initializes an open list and a closed list, placing the starting point into the open list. Then, the following steps are executed iteratively: The node with the lowest total cost is selected from the open list as the current node (usually the starting point is used as the current node at the beginning of the search, and the total cost of the starting point is usually 0). This node is then moved into the closed list. The current node's neighboring candidate nodes (including three-dimensional neighbors such as those above, below, left, right, and floors above and below) are obtained. Each candidate node is evaluated: if it is located in a restricted area, it is skipped; if it is already in the closed list, it is also skipped. For candidate nodes that pass the screening, the actual cost of traveling from the starting point to the current node and the estimated cost of traveling from the candidate node to the destination are calculated. The sum of these two costs is taken as the total cost of the candidate node.

[0035] If a candidate node is not in the open list, add it to the open list and record its parent node as the current node; if a candidate node is already in the open list, compare the newly calculated total cost with the original total cost. If the new cost is smaller, update the node's parent node and total cost.

[0036] When the current node retrieved from the open list is the endpoint, the search terminates. The system then backtracks from the endpoint to the starting point based on the parent node relationships of each node to generate a complete initial job path.

[0037] Optionally, after the search is complete, the system smooths the generated initial work path, removing redundant inflection points to generate a smooth, optimal 3D workflow. Simultaneously, the system segments the path based on the intervals between devices it passes through, providing a basis for generating subsequent authorization instructions. Finally, the system renders the generated optimal work path visually in a 3D panoramic model for preview and review by the production command center.

[0038] Step S108: Based on the three-dimensional spatial model and the optimal work path, determine the path space corresponding to the optimal work path from the physical space of the substation; generate an authorization instruction based on the optimal work path. The authorization instruction is used to: issue unlocking permissions for access control and / or equipment locks in the path space to the operator, so that the operator can reach the target work equipment according to the optimal work path.

[0039] Optionally, the generated optimal work path is mapped from the 3D spatial model to the physical space of the substation, determining the actual traversable spaces that the workers need to pass through in the physical space. Typically, untraversed spaces are also identified. Traversed spaces refer to the physical space areas corresponding to the grid nodes traversed by the optimal work path in the 3D spatial model, including passageways, corridors, access control locations, equipment bay entrances, etc. Untraversed spaces refer to all areas in the substation's physical space other than the aforementioned traversed spaces.

[0040] Specifically, each access control device, equipment lock, cabinet lock, and other locking device within the space to be passed through is marked as "unlocked," while all locking devices within the space not passed through are marked as "locked."

[0041] Based on the aforementioned marking results, an authorization command is generated and sent to the corresponding access control controller and equipment lock controller via the substation's intelligent lock control system. After the authorization command is executed, access control and / or equipment locks within the traversed space are unlocked, allowing personnel to pass normally by swiping their cards or using facial recognition when reaching the corresponding location; access control and / or equipment locks in areas not traversed remain locked, preventing personnel from entering these areas. In this way, the accessible range of personnel is precisely limited to the space traversed along the path, achieving "path as access" security control.

[0042] Optionally, the system also segments the optimal work path into restricted paths, and unlocks access control and / or equipment locks corresponding to different path segments in a time-based manner based on the path segmentation results. Specifically, the system divides the optimal work path into multiple path segments according to equipment intervals, and each path segment is bound to corresponding access control permissions and / or equipment lock permissions. When an operator moves to a certain path segment, the access control and / or equipment lock corresponding to that segment is unlocked; when the operator leaves the segment and enters the next segment, the access control and / or equipment lock corresponding to the previous segment automatically returns to the locked state to prevent the operator from accidentally entering a previously traversed area or an unauthorized area after completing the work.

[0043] This disclosure provides a method for generating work paths in a substation. The method involves acquiring work task information, a three-dimensional spatial model of the substation, and safety constraint information. Based on the safety constraint information, restricted and non-restricted areas are determined in the three-dimensional spatial model. Based on the work task information, an optimal work path is generated in the non-restricted areas, starting from the substation entrance and ending at the target work equipment. The path space corresponding to the optimal work path is determined from the physical space of the substation. An authorization instruction is generated based on the optimal work path. This authorization instruction is used to grant unlocking permissions for access control and / or equipment locks within the path space to the workers, enabling them to reach the target work equipment according to the optimal work path. This method, by linking the optimal work path with access control and equipment locks, achieves precise physical restrictions on the accessible range of workers, solving the safety problem in existing technologies where path planning results cannot effectively constrain the actual travel route of personnel and lead to accidental entry into non-work areas, thereby improving the safety of substation operation and maintenance operations.

[0044] Furthermore, when the optimal work path is updated due to unforeseen circumstances (such as changes in equipment status or temporary obstruction ahead), the system re-determines the new path's traversal and non-traversal spaces based on the updated optimal path, generates new authorization instructions, and sends them to the locking system. The locking system first restores the previously unlocked access control and / or equipment locks to the locked state, and then unlocks the access control and / or equipment locks within the new path's traversal spaces, completing a smooth transition of the locking status and ensuring that personnel are always confined to the newly planned safe passage area.

[0045] This disclosure provides a method for generating work paths in a substation. The method involves acquiring work task information, a three-dimensional spatial model of the substation, and safety constraint information. Based on the safety constraint information, restricted and non-restricted areas are determined in the three-dimensional spatial model. Based on the work task information, an optimal work path is generated in the non-restricted areas, starting from the substation entrance and ending at the target work equipment. Based on the three-dimensional spatial model and the optimal work path, the corresponding passage space of the optimal work path is determined from the physical space of the substation. An authorization instruction is generated based on the optimal work path. This authorization instruction is used to grant unlocking permissions for access control and / or equipment locks within the passage space to the workers, enabling them to reach the target work equipment according to the optimal work path. This method, by linking the optimal work path with access control and equipment locks, achieves precise physical restrictions on the accessible range of workers, solving the safety problem in existing technologies where path planning results cannot effectively constrain the actual travel route of personnel and lead to accidental entry into non-work areas, thereby improving the safety of substation operation and maintenance operations.

[0046] The actual passage costs mentioned above include: a first passage cost, a second passage cost, and a third passage cost; the first passage cost is determined based on the preset passage cost of the spatial area corresponding to the current node; wherein, the preset passage cost is determined based on the area identifier of the spatial area, and different area identifiers correspond to different preset passage costs, and the area identifiers include at least non-restricted signs and restricted signs; the preset passage cost corresponding to the restricted sign is greater than the preset passage cost corresponding to the non-restricted sign; the second passage cost is determined based on the distance from the current node to the nearest restricted area; the third passage cost is determined based on whether the current node overlaps with other operation paths; the estimated passage cost is determined based on the distance from the current node to the destination and the safe distance from the current node to the nearest restricted area.

[0047] The estimated travel cost is determined by a weighted sum of a first estimated travel cost and a second estimated travel cost. The first estimated travel cost is determined based on the distance from the current node to the destination and the corresponding coefficient, while the second estimated travel cost is determined based on the safe distance from the current node to the nearest restricted area and the corresponding coefficient. This method balances distance and safety redundancy.

[0048] The aforementioned non-prohibited signs include: the first sign, the second sign, the third sign, and the fourth sign; the preset passage cost corresponding to the first sign is less than the preset passage cost corresponding to the second sign, the preset passage cost corresponding to the second sign is less than the preset passage cost corresponding to the third sign, and the preset passage cost corresponding to the third sign is less than the preset passage cost corresponding to the fourth sign.

[0049] For the first passage cost, let's take an example: the preset passage cost corresponding to the "no passage" sign is infinite (impossible to pass). The main maintenance road in the non-restricted area is configured as the first sign, with a preset passage cost of 1; the auxiliary maintenance passage in the non-restricted area is configured as the second sign, with a preset passage cost of 3; the narrow passage behind the cabinet in the non-restricted area is configured as the third sign, with a preset passage cost of 8; and the sensitive area for secondary equipment in the non-restricted area is configured as the fourth sign, with a preset passage cost of 20. The system, based on the current node's position in the 3D spatial model, queries the area sign corresponding to that node and determines the corresponding preset passage cost as the first passage cost.

[0050] Regarding the second passage cost, the shortest distance from the current node to the nearest restricted area boundary is calculated in real time. The closer the distance, the higher the penalty value. For example, when the current node is more than 5 meters away from the nearest restricted area, the second passage cost is 0; when the distance is between 3 and 5 meters, the second passage cost is 5; when the distance is between 1 and 3 meters, the second passage cost is 15; and when the distance is less than 1 meter, the second passage cost is 30. This penalty value increases linearly as the distance decreases to guide the path to maintain a sufficient safe distance from the restricted area.

[0051] Regarding the third passage cost, in scenarios where multiple shifts are working simultaneously, the system has already generated planned paths for other shifts and stored them as corresponding node sets. If the current node falls into a node set included in another shift's path, the system applies a third passage cost. For example, the third passage cost can be set to a high penalty value such as 50 or 100. When multiple shift paths overlap, the high third passage cost will force the algorithm to choose a detour, thereby avoiding personnel from different shifts crossing the same area and effectively reducing the safety risks of overlapping operations.

[0052] The system adds up the first, second, and third travel costs to obtain the actual travel cost from the starting point to the current node.

[0053] Regarding the estimated travel cost, specifically, the system calculates the three-dimensional Euclidean distance from the current node to the destination. The product of this distance and a first preset coefficient (e.g., 0.7) is determined as the fourth travel cost, which represents "how far is still to go" and has a relatively large weight. The system calculates the third distance from the current node to the nearest restricted area, and the product of the reciprocal or inverse proportional value of this distance and a second preset coefficient (e.g., 0.3) is determined as the fifth travel cost. This part represents "whether there is a danger zone ahead" and has a smaller weight. For example, when the third distance from the current node to the nearest restricted area is 5 meters, the fifth travel cost is 0.3 × (1 / 5) = 0.06; when the third distance is 0.5 meters, the fifth travel cost is 0.3 × (1 / 0.5) = 0.6, with the penalty value increasing sharply.

[0054] The system calculates the estimated travel cost by weighting and summing the fourth and fifth travel costs. The weighting coefficient of the fourth travel cost (0.7) is greater than that of the fifth travel cost (0.3). This ensures that the algorithm will not take a detour of tens of kilometers for absolute safety, and also ensures that, between two paths that are close in distance, the algorithm will prioritize the path that is farther away from the restricted area and has higher safety.

[0055] The system will and Add them together to get the total cost of each candidate node. Select in each iteration The smallest node is expanded. Through the above cost calculation method, the optimal work path finally output by the path search algorithm has the following characteristics under the premise of satisfying physical reachability: it prioritizes passing through the main maintenance road and auxiliary maintenance road, maintains a sufficient safe distance from the live restricted area, and actively avoids intersections and overlaps with the paths of other work groups.

[0056] One possible implementation of the above steps, which use a path search algorithm to search for the optimal path from the starting point to the destination in a non-restricted area, is as follows: The 3D spatial model is divided into multiple nodes, each corresponding to a spatial region. The starting point is taken as the current node, and multiple candidate nodes adjacent to the current node are determined from the multiple nodes. For each candidate node, the actual travel cost from the current node to the candidate node and the expected travel cost from the candidate node to the destination are calculated. The sum of the actual travel cost and the expected travel cost is determined as the target travel cost of the candidate node. The candidate node with the minimum target travel cost is taken as the path node. The path node is determined as the current node, and the step of determining multiple candidate nodes adjacent to the current node is continued until the current node is the destination. The obtained path node is determined as the optimal operation path.

[0057] Optionally, the steps for calculating the actual travel cost from the current node to the candidate node include: determining the region identifier of the spatial region corresponding to the candidate node, and determining the preset travel cost corresponding to the region identifier as the first travel cost; determining the first distance between the candidate node and the nearest target region, and determining the product of the first distance and the region coefficient corresponding to the target region as the second travel cost; wherein, the target region includes: a second non-restricted region, a third non-restricted region, and a fourth non-restricted region among the restricted and non-restricted regions; determining whether other operation paths contain the candidate node, and if so, determining the specified travel cost as the third travel cost; and determining the sum of the first travel cost, the second travel cost, and the third travel cost as the actual travel cost from the current node to the candidate node.

[0058] Specifically, the actual travel cost from the current node to the candidate node is calculated as follows: ; ; ; ; in, As a candidate node, For the actual cost of passage; The first general cost is determined by the candidate nodes. The corresponding spatial area's area identifier corresponds to the preset passage cost. Sure; As a second passage cost, Candidate nodes With the nearest target area The first distance between them For target area The corresponding area coefficients; where the target area includes: the second non-restricted area, the third non-restricted area, and the fourth non-restricted area in the restricted area and the non-restricted area, and different target areas correspond to different area coefficients; As a third passage cost, The preset passage cost.

[0059] Optionally, the above steps for calculating the expected passage cost from the candidate node to the destination include: determining a second distance from the candidate node to the destination, and determining the product of the second distance and a first preset coefficient as the fourth passage cost; determining a third distance between the candidate node and the nearest restricted area, and determining the product of the third distance and the second preset coefficient as the fifth passage cost; and determining the sum of the weighted products of the fourth and fifth passage costs as the expected passage cost from the candidate node to the destination; wherein the weight coefficient of the fourth passage cost is greater than the weight coefficient of the fifth passage cost.

[0060] Specifically, the estimated travel cost from the candidate node to the destination is calculated as follows: ; , ; in, As a candidate node, To anticipate the cost of passage, For the cost of the fourth passage, The weighting coefficient for the fourth passage cost. For the cost of the fifth passage, The weighting coefficient for the fifth passage cost is greater than the weighting coefficient for the fourth passage cost. Candidate nodes To the finish line distance, This is the first preset coefficient; Candidate nodes With the nearest restricted area distance, This is the second preset coefficient.

[0061] After determining multiple candidate nodes adjacent to the current node from multiple nodes, the above method further includes: if the spatial region corresponding to the first candidate node among the multiple candidate nodes is in a restricted area, delete the first candidate node from the multiple candidate nodes.

[0062] Before the step of selecting the candidate node with the lowest target travel cost as the path node, the method further includes: determining whether a candidate node exists in a preset list; the preset list is used to store the starting point, candidate nodes, and the target travel cost of the candidate nodes; if it does not exist, the candidate node and its target travel cost are saved to the preset list; if it exists, the first total cost from the starting point through the current node to the candidate node is calculated, and the second total cost of the candidate node is determined from the preset list; if the first total cost is less than the second total cost, the parent node of the path node saved in the candidate list is updated to the current node, and the second total cost of the candidate node is updated to the first total cost; otherwise, the candidate node saved in the preset list is retained.

[0063] The aforementioned path search algorithm usually refers to A Heuristic search algorithm. The specific search strategy is as follows: The system discretizes the 3D spatial model into multiple 3D grid nodes, each node A unit area within the physical space of a substation is defined, containing its coordinates and an identifier. The system uses the grid node corresponding to the substation entrance as the starting point for the search. The grid node corresponding to the location of the target equipment is used as the search endpoint. .

[0064] The system initializes an open list (i.e., the preset list mentioned above) and a closed list. The open list stores nodes to be expanded, based on the target passage cost of each node. Sort by size from smallest to largest; closed lists are used to store nodes that have been expanded. The system will start from... Add it to the room booking list and set the actual travel cost at the starting point. Initialize to 0.

[0065] The system selects the target passage cost from the open list. The smallest node is used as the current node. Remove the node from the open list and add it to the closed list. The system retrieves the current node. In three-dimensional space, adjacent nodes include all adjacent grid nodes within the three-dimensional neighborhood, such as up and down, left and right, front and back, and upper and lower floors, forming a candidate node set.

[0066] For each candidate node Perform the following filtering and judgment: If candidate nodes If a node is located within a restricted area (i.e., the area identifier of the node is a restricted area), the candidate node will be deleted directly and will not participate in subsequent calculations.

[0067] If candidate nodes If a node is already in a closed list, indicating that it has been expanded and the optimal path has been obtained, then skip that candidate node directly.

[0068] After the above screening, the remaining candidate nodes are all valid nodes located in non-restricted areas and have not been expanded.

[0069] Then, for each candidate node that passed the screening... The system calculates the actual travel cost from the starting point to the candidate node via the current node. And the estimated travel cost from the candidate node to the destination. The sum of the two is taken as the target passage code for the candidate node. .

[0070] Actual toll cost The calculation method is as follows: First, the system determines candidate nodes. The corresponding spatial area is identified by its area identifier, and the preset passage cost corresponding to that area identifier is determined as the first passage cost. For example, if the node is located on the main maintenance road, its area identifier is the first identifier, and the corresponding preset passage cost is 1; if it is located in a sensitive area of ​​secondary equipment, its area identifier is the fourth identifier, and the corresponding preset passage cost is 20.

[0071] Secondly, the system calculates candidate nodes. The distance to the nearest target area (including restricted areas and the second, third, and fourth non-restricted areas within the non-restricted areas) is multiplied by the corresponding area coefficient to determine the second passage cost (danger penalty cost). For example, when a candidate node approaches a sensitive area of ​​secondary equipment, this penalty value increases as the distance decreases to guide the path away from these high-cost areas.

[0072] Finally, the system determines whether other generated optimal job paths contain candidate nodes. If there is overlap, the specified passage cost (e.g., 50) is determined as the third passage cost (conflict penalty cost); if there is no overlap, the third passage cost is 0.

[0073] The system sums the first, second, and third travel costs to obtain the actual travel cost from the starting point to the candidate node via the current node. .

[0074] Estimated toll costs The calculation method is as follows: The system calculates candidate nodes. The three-dimensional Euclidean distance to the destination is multiplied by a first preset coefficient to determine the fourth passage cost. Simultaneously, the system calculates candidate nodes. The third distance to the nearest restricted area is used as the product of this distance and a second preset coefficient to determine the fifth passage cost. The system then weights and sums the fourth and fifth passage costs to obtain the estimated passage cost. The weight coefficient of the fourth passage cost (0.7) is greater than that of the fifth passage cost (0.3), reflecting the strategy of taking reaching the destination as the main goal while also considering safety in path search.

[0075] After calculating the target passage cost of a candidate node, determine whether the candidate node is already in the open list. If not, add the candidate node directly to the open list and record its parent node as the current node. It also stores the target passage cost, actual passage cost, and estimated passage cost of the node.

[0076] If candidate nodes If the node is already in the open list, compare the newly calculated target passage cost with the original target passage cost of that node. If the new cost is smaller, update the parent node of that node to the current node. Update the target passage cost, actual passage cost, and estimated passage cost of the node. If the new cost is not less than the original cost, retain the original parent node, target passage cost, actual passage cost, and estimated passage cost of the node.

[0077] After calculating and updating the cost of all candidate nodes for the current node, the open list is re-sorted in ascending order of target passage cost. Then, the node with the smallest target passage cost is selected from the open list as the new current node, and the process of node expansion, candidate node screening, passage cost calculation and open list update is repeated.

[0078] The search terminates when the current node retrieved from the open list is the endpoint. Based on the parent-child relationships of each node, the system backtracks from the endpoint back to the starting point along the parent pointers, connecting all nodes along the backtracking path to generate the optimal job path from the starting point to the endpoint.

[0079] The aforementioned safety constraint information includes at least one of the following: the energized state of primary equipment and the isolation boundary of secondary equipment; based on the safety constraint information, the step of determining prohibited and non-prohibited areas in a three-dimensional spatial model is as follows: based on the energized state of primary equipment, the spatial area where the energized equipment is located and the spatial area at a predetermined distance from the energized equipment from the target in the three-dimensional spatial model are determined as prohibited areas, and the area identifier of the prohibited areas is set as a prohibited identifier; the spatial areas in the three-dimensional spatial model other than the prohibited areas are determined as non-prohibited areas, and the area identifier of the non-prohibited areas is set as a non-prohibited identifier.

[0080] The above method further includes: defining the maintenance passage area in the non-restricted area as the first non-restricted area, and setting the area identifier of the first non-restricted area as the first identifier; defining the auxiliary passage area in the non-restricted area as the second non-restricted area, and setting the area identifier of the third non-restricted area as the second identifier; defining the passage area near the cabinet equipment in the non-restricted area as the third non-restricted area based on the cabinet equipment in the three-dimensional spatial model, and setting the area identifier of the third non-restricted area as the third identifier; defining the space area enclosed by the isolation boundary in the non-restricted area as the fourth non-restricted area based on the secondary equipment isolation boundary, and setting the area identifier of the fourth non-restricted area as the fourth identifier; the preset passage cost corresponding to the first identifier is less than the preset passage cost corresponding to the second identifier, the preset passage cost corresponding to the second identifier is less than the preset passage cost corresponding to the third identifier, and the preset passage cost corresponding to the third identifier is less than the preset passage cost corresponding to the fourth identifier.

[0081] Specifically, based on the channel type information in the 3D spatial model, the main maintenance road in the non-restricted area is designated as the first non-restricted area, with its area identifier set as the first identifier and a preset passage cost of 1, representing the highest passage priority. The maintenance auxiliary road in the non-restricted area is designated as the second non-restricted area, with its area identifier set as the second identifier and a preset passage cost of 3, representing the second highest passage priority. Based on the layout of the cabinet equipment in the 3D spatial model, the narrow passages near the cabinet equipment are designated as the third non-restricted area, with its area identifier set as the third identifier and a preset passage cost of 8, representing a lower passage priority. Based on the secondary equipment isolation boundary, the sensitive area of ​​the secondary equipment enclosed by the isolation boundary is designated as the fourth non-restricted area, with its area identifier set as the fourth identifier and a preset passage cost of 20, representing the lowest passage priority, allowing personnel to pass through only briefly when necessary.

[0082] The preset passage costs for the four types of non-restricted areas meet the following condition: the first sign is less than the second sign, which is less than the third sign, which is less than the fourth sign, which is less than the restricted sign (infinity). Through this hierarchical configuration, the path search algorithm will automatically prioritize the main maintenance roads and auxiliary maintenance passages with lower preset passage costs during subsequent pathfinding, avoiding narrow passages behind cabinets and sensitive areas of secondary equipment as much as possible. This ensures that the planned optimal work path meets safety constraints while also considering passage efficiency and personnel comfort.

[0083] The above method also includes: obtaining the real-time location coordinates of the operator in the substation, determining whether the real-time location coordinates deviate from the optimal work path; if so, generating a warning signal based on the deviation distance.

[0084] When workers enter the substation, they wear UWB positioning tags (such as positioning badges or safety helmet modules). Pre-deployed positioning base stations within the substation receive the pulse signals emitted by the tags in real time, calculate the real-time position coordinates of the workers in three-dimensional space using a time difference of arrival algorithm, and transmit the data back to the backend system via the substation network at a frequency of several to dozens of times per second.

[0085] The real-time location coordinates of the operator are compared with the set of path nodes included in the optimal operation path generated in step S106, and the shortest distance from the real-time location coordinates to the optimal operation path is calculated as the deviation distance.

[0086] If the deviation distance is greater than or equal to the first distance threshold and less than the second distance threshold, a first warning signal is generated. The first warning signal is used to control the positioning device worn by the operator to issue a warning reminder. If the deviation distance is greater than or equal to the second distance threshold and less than the third distance threshold, a second warning signal is generated. The second warning signal is used to control the substation's broadcasting equipment to play a voice warning. If the deviation distance is greater than or equal to the third distance threshold, a third warning signal is generated. The third warning signal is used to send an access freeze signal to the substation's interlocking system to control the target equipment within the substation to be frozen. The target equipment is the equipment closest to the operator.

[0087] Once the operator returns to the optimal work path and the deviation distance is reduced to below the first distance threshold, the system automatically cancels the warning signal and resumes normal monitoring. If the operator needs to continue moving while deviating from the path, the command center can manually release the lock after remotely confirming safety, and the system will replan the path from the operator's current location to the target equipment.

[0088] Through the aforementioned real-time location monitoring and tiered warning mechanism, the system can intervene in a timely manner when operators deviate from the planned path, and strengthen the control layer by layer from reminders and alarms to physical lockouts in a tiered and progressive manner, effectively preventing personnel from accidentally entering live or unauthorized areas.

[0089] The above method also includes: generating guide light control instructions based on the optimal work path. The guide light control instructions are used to control the guide lights in the space through which the path passes to light up sequentially in the direction of the optimal work path, so as to guide the workers to move along the optimal work path.

[0090] Guide lights (such as LED indicator lights) are pre-installed in the substation's corridors, corners, access control points, and entrances to each equipment bay. In the three-dimensional spatial model, each guide light is associated with a corresponding spatial coordinate and its location identifier, and a mapping relationship is established with the locations that the optimal work path may pass through. After the optimal work path is generated in step S106, the system maps the nodes traversed by the optimal work path to physical spatial coordinates and matches the corresponding guide light devices.

[0091] With the aforementioned guide light control method, operators do not need to frequently check their handheld terminals while moving; they can simply follow the guide lights that illuminate sequentially ahead of them to proceed in the correct direction to the target equipment. This is especially effective in environments with low visibility (such as at night or in underground cable tunnels) or when operators need to use both hands to operate tools and cannot operate the terminal, effectively reducing navigation time and minimizing deviations due to misreading the path.

[0092] The above method also includes: after the operator completes the task based on the optimal work path, the operator's movement trajectory, warning records, substation equipment status, task information, and optimal work path are saved to a preset storage space.

[0093] The system triggers the archiving process when any of the following conditions are met: the work end time recorded in the work ticket has arrived and the operator has left the work area; the operator manually confirms the completion of the work and submits it on a handheld terminal; or the production command center remotely confirms the completion of the work and issues an archiving instruction.

[0094] In response to the archiving process being triggered, the system saves the operator's movement trajectory, warning records, substation equipment status, work task information, and optimal work path to a preset storage space. The movement trajectory records every spatial location and time point traversed by the operator from entering to leaving the substation, stored as a three-dimensional coordinate sequence. Warning records include the trigger time, warning level (Level 1 / 2 / 3), trigger reason (deviation distance, approaching a restricted area, etc.), operator's location at the time the warning was issued, and alarm cancellation time and method (automatic recovery / manual confirmation) for each warning. Substation equipment status records include changes in the energized status of primary equipment, changes in the connection / removal status of grounding wires, changes in the on / off status of secondary equipment pressure plates, and unlocking / locking operation records of access control and locks. Work task information includes: work order details, operator list, and planned work time. The optimal work path includes: the node coordinate sequence of the optimal work path, and the final path version after any changes during the work process.

[0095] Through the above archiving methods, the system will completely retain the planning data, execution data, alarm data and equipment status data of the entire operation cycle, forming a digital operation archive that can be used for post-event traceability, review, analysis and training, providing a data foundation for risk prediction, path optimization and continuous improvement of safety management in subsequent operations.

[0096] See also Figure 2 and Figure 3 The flowchart shown below illustrates the implementation process of the "routine inspection of main transformer protection cabinets" at a 220kV substation as an example: Through the upper-level "Operation Control (Maintenance)" application, work orders are obtained by connecting to the power grid management platform. The data platform retrieves the 3D real-world model of the substation and the energized status of the primary equipment topology in real time; the "3D Basic Services" of the public service platform discretizes the physical space into computing nodes. At the same time, the artificial intelligence platform automatically parses the work orders through natural language processing (NLP) to extract core information such as the operators, target equipment, and safety isolation range.

[0097] Based on the constraint information provided by the data platform, the "behavioral analysis" and "image recognition" modules of the artificial intelligence platform collaboratively plan the optimal path. The algorithm uses the entrance access control as the starting point and the target cabinet as the endpoint, automatically bypassing restricted areas generated by the powered-on status of the equipment. Through the "3D panoramic monitoring" module at the business application layer, the system renders the safe path in the 3D model with solid green lines and fills the restricted areas with red, enabling a visual preview and verification of the path.

[0098] After the path is confirmed, the system transforms the planning results into a locking policy through the "Policy Issuance" link shown in the diagram. The "Permission Service" module of the public service platform generates authorization instructions, which are then issued to the station-side physical devices via the basic platform (WAPI, NB-IoT, Ethernet). The system implements the following: unlocking operations are performed on access control (smart locks) and device locks within the spaces traversed by the path; locking operations are performed on access control and device locks within spaces not traversed, physically restricting the actual accessible range of personnel to the optimal work path. Simultaneously, LED indicator lights in the spaces traversed by the path illuminate sequentially along the direction of travel, guiding personnel to the target equipment along the correct path.

[0099] Workers carrying UWB positioning tags enter the station, and the "personnel positioning" terminal under the basic platform transmits the coordinates back in real time. The "operation monitoring" and "intelligent inspection" modules at the business application layer continuously compare the personnel coordinates with the planned path.

[0100] If a deviation occurs, the system triggers a tiered early warning mechanism: a slight deviation triggers a buzzer reminder on the wearable device; a moderate deviation triggers a voice reminder via the station's video surveillance and broadcast equipment; and when personnel deviate significantly (such as accidentally entering a live area), the AI ​​platform confirms the emergency status through video analysis combined with location data, immediately issues an access freeze signal to the basic platform, locks the nearest equipment, and simultaneously aggregates the on-site footage and warning information to the production command center, achieving proactive safety protection.

[0101] After the operation is completed, the system triggers the archiving process. The "information aggregation" link in the diagram uploads data from the entire operation cycle, including the operator's movement trajectory, warning records, equipment status changes, and optimal operation paths. This data is saved to the data platform and public service platform, forming a digital operation archive. This archive is not only traceable but also serves as a historical sample to optimize the subsequent path planning algorithms and risk prediction logic of the artificial intelligence platform. Ultimately, through applications such as "dispatch management (dispatch)" and "remote operation (control)," it assists in the closed-loop remote safety operation of unmanned substations.

[0102] Corresponding to the above method embodiments, this disclosure provides a device for generating work paths in a substation, such as... Figure 4 As shown, the device includes: The information acquisition module 401 is used to acquire work task information, the three-dimensional spatial model of the substation, and safety constraint information; The region determination module 402 is used to determine restricted and non-restricted regions in the three-dimensional spatial model based on safety constraint information; The path generation module 403 is used to generate the best operation path in the non-restricted area based on the operation task information, starting from the entrance of the substation and ending at the target operation equipment. The instruction generation module 404 is used to determine the path space corresponding to the optimal operation path from the physical space of the substation based on the three-dimensional spatial model and the optimal operation path; and to generate an authorization instruction based on the optimal operation path. The authorization instruction is used to issue unlocking permissions for access control and / or equipment locks in the path space to the operator, so that the operator can reach the target operation equipment according to the optimal operation path.

[0103] This disclosure provides a device for generating work paths in a substation. The device acquires work task information, a three-dimensional spatial model of the substation, and safety constraint information. Based on the safety constraint information, it determines restricted and non-restricted areas in the three-dimensional spatial model. Based on the work task information, it generates an optimal work path in the non-restricted areas, starting from the substation entrance and ending at the target work equipment. Based on the three-dimensional spatial model and the optimal work path, it determines the passage space corresponding to the optimal work path from the physical space of the substation. An authorization instruction is generated based on the optimal work path. This authorization instruction is used to grant unlocking permissions for access control and / or equipment locks within the passage space to the workers, enabling them to reach the target work equipment according to the optimal work path. This method, by linking the optimal work path with access control and equipment locks, achieves precise physical restrictions on the accessible range of workers, solving the safety problem in existing technologies where path planning results cannot effectively constrain the actual travel route of personnel and lead to accidental entry into non-work areas, thereby improving the safety of substation operation and maintenance operations.

[0104] The aforementioned path generation module is also used to: determine the target work equipment based on the work task information, and take the entrance of the substation as the starting point of the path search, and the position of the target work equipment in the three-dimensional spatial model as the ending point of the path search; through the path search algorithm, search for the optimal path from the starting point to the ending point in the non-restricted area, and determine the optimal path as the best work path; wherein, the path search algorithm takes minimizing the total path cost as the optimization objective, and the total path cost includes: the sum of the actual passage cost from the starting point to the current node and the estimated passage cost from the current node to the ending point.

[0105] The actual passage costs mentioned above include: a first passage cost, a second passage cost, and a third passage cost; the first passage cost is determined based on the preset passage cost of the spatial area corresponding to the current node; wherein, the preset passage cost is determined based on the area identifier of the spatial area, and different area identifiers correspond to different preset passage costs, and the area identifiers include at least non-restricted signs and restricted signs; the preset passage cost corresponding to the restricted sign is greater than the preset passage cost corresponding to the non-restricted sign; the second passage cost is determined based on the distance from the current node to the nearest restricted area; the third passage cost is determined based on whether the current node overlaps with other operation paths; the estimated passage cost is determined based on the distance from the current node to the destination and the safe distance from the current node to the nearest restricted area.

[0106] The path generation module described above is also used to: divide the three-dimensional spatial model into multiple nodes, each node corresponding to a spatial region; take the starting point as the current node, and determine multiple candidate nodes adjacent to the current node from the multiple nodes; for each candidate node, calculate the actual travel cost from the current node to the candidate node, and the expected travel cost from the candidate node to the destination, and determine the sum of the actual travel cost and the expected travel cost as the target travel cost of the candidate node; take the candidate node with the minimum target travel cost as the path node; determine the path node as the current node, and continue to execute the step of determining multiple candidate nodes adjacent to the current node from the multiple nodes until the current node is the destination, and determine the obtained path node as the optimal operation path.

[0107] The path generation module mentioned above is also used for: ; ; ; ; in, As a candidate node, For the actual cost of passage; The first general cost is determined by the candidate nodes. The corresponding spatial area's area identifier corresponds to the preset passage cost. Sure; As a second passage cost, Candidate nodes With the nearest target area The first distance between them For target area The corresponding area coefficients; where the target area includes: the second non-restricted area, the third non-restricted area, and the fourth non-restricted area in the restricted area and the non-restricted area, and different target areas correspond to different area coefficients; As a third passage cost, The preset passage cost.

[0108] The path generation module mentioned above is also used for: ; , ; in, As a candidate node, To anticipate the cost of passage, For the cost of the fourth passage, The weighting coefficient for the fourth passage cost. For the cost of the fifth passage, The weighting coefficient for the fifth passage cost is greater than the weighting coefficient for the fourth passage cost. Candidate nodes To the finish line distance, This is the first preset coefficient; Candidate nodes With the nearest restricted area distance, This is the second preset coefficient.

[0109] The above-mentioned device also includes a deletion module, used to: delete the first candidate node from the multiple candidate nodes if the spatial region corresponding to the first candidate node among the multiple candidate nodes is in a restricted area.

[0110] The aforementioned device further includes a node update module, configured to: determine whether a candidate node exists in a preset list; the preset list stores the starting point, candidate nodes, and the target passage cost of the candidate nodes; if the candidate node does not exist, save the candidate node and its target passage cost to the preset list; if the candidate node exists, calculate the first total cost from the starting point through the current node to the candidate node, and determine the second total cost of the candidate node from the preset list; if the first total cost is less than the second total cost, update the parent node of the candidate node saved in the preset list to the current node, and update the second total cost of the candidate node to the first total cost; otherwise, retain the candidate node saved in the preset list.

[0111] The aforementioned safety constraint information includes at least one of the following: the energized state of the primary equipment and the isolation boundary of the secondary equipment; the aforementioned area determination module is further configured to: determine the spatial area where the energized equipment is located and the spatial area at a preset distance from the energized equipment in the three-dimensional spatial model as prohibited areas based on the energized state of the primary equipment, and set the area identifier of the prohibited area as a prohibited identifier; determine the spatial area in the three-dimensional spatial model other than the prohibited area as a non-prohibited area, and set the area identifier of the non-prohibited area as a non-prohibited identifier.

[0112] The aforementioned area determination module is further configured to: determine the maintenance passage area within the non-restricted area as the first non-restricted area, and set the area identifier of the first non-restricted area as the first identifier; determine the auxiliary passage area within the non-restricted area as the second non-restricted area, and set the area identifier of the third non-restricted area as the second identifier; based on the cabinet equipment in the three-dimensional spatial model, determine the passage area near the cabinet equipment within the non-restricted area as the third non-restricted area, and set the area identifier of the third non-restricted area as the third identifier; based on the secondary equipment isolation boundary, determine the space area enclosed by the isolation boundary within the non-restricted area as the fourth non-restricted area, and set the area identifier of the fourth non-restricted area as the fourth identifier; the aforementioned non-restricted identifiers include: the first identifier, the second identifier, the third identifier, and the fourth identifier; the preset passage cost corresponding to the first identifier is less than the preset passage cost corresponding to the second identifier, the preset passage cost corresponding to the second identifier is less than the preset passage cost corresponding to the third identifier, and the preset passage cost corresponding to the third identifier is less than the preset passage cost corresponding to the fourth identifier.

[0113] The aforementioned device also includes a signal generation module, used to: acquire the real-time location coordinates of the operator in the substation, determine whether the real-time location coordinates deviate from the optimal work path; if so, generate a warning signal based on the deviation distance.

[0114] The aforementioned signal generation module is also used to: generate a first warning signal if the deviation distance is greater than or equal to a first distance threshold and less than a second distance threshold, the first warning signal being used to control the positioning device worn by the operator to issue a warning reminder; generate a second warning signal if the deviation distance is greater than or equal to a second distance threshold and less than a third distance threshold, the second warning signal being used to control the substation's broadcasting equipment to play a voice warning; and generate a third warning signal if the deviation distance is greater than or equal to a third distance threshold, the third warning signal being used to send an access freeze signal to the substation's interlocking system to control the target equipment within the substation to be frozen; wherein, the target equipment is the equipment closest to the operator.

[0115] The aforementioned device also includes an instruction generation module, used to: generate guide light control instructions based on the optimal work path, the guide light control instructions being used to control the guide lights in the space traversed by the path to light up sequentially along the direction of the optimal work path, so as to guide the workers to move along the optimal work path.

[0116] The aforementioned device also includes a storage module for saving the operator's movement trajectory, warning records, substation equipment status, task information, and optimal work path to a preset storage space after the operator completes the task based on the optimal work path.

[0117] The substation work path generation device provided in this embodiment has the same technical features as the substation work path generation method provided in the above embodiment, so it can also solve the same technical problems and achieve the same technical effects.

[0118] This embodiment also provides an electronic device, including a processor and a memory. The memory stores machine-executable instructions that can be executed by the processor. The processor executes the machine-executable instructions to implement the method for generating work paths in the substation described above. This electronic device can be a server or a terminal device.

[0119] See Figure 5 As shown, the electronic device includes a processor 100 and a memory 101. The memory 101 stores machine-executable instructions that can be executed by the processor 100. The processor 100 executes the machine-executable instructions to implement the above-mentioned method for generating work paths in the substation.

[0120] Furthermore, Figure 5 The electronic device shown also includes a bus 102 and a communication interface 103, with the processor 100, the communication interface 103 and the memory 101 connected via the bus 102.

[0121] The memory 101 may include high-speed random access memory (RAM) and may also include non-volatile memory, such as at least one disk storage device. Communication between this system network element and at least one other network element is achieved through at least one communication interface 103 (which can be wired or wireless), such as the Internet, wide area network, local area network, metropolitan area network, etc. The bus 102 may be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus, or an EISA (Extended Industry Standard Architecture) bus, etc. The bus can be divided into address bus, data bus, control bus, etc. For ease of representation, Figure 5 The symbol is represented by a single double-headed arrow, but this does not mean that there is only one bus or one type of bus.

[0122] The processor 100 may be an integrated circuit chip with signal processing capabilities. In implementation, each step of the above method can be completed by the integrated logic circuitry in the hardware of the processor 100 or by instructions in software form. The processor 100 may be a general-purpose processor, including a Central Processing Unit (CPU), a Network Processor (NP), etc.; it may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field-Programmable Gate Array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. It can implement or execute the methods, steps, and logic block diagrams disclosed in the embodiments of this disclosure. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this disclosure can be directly manifested as execution by a hardware decoding processor, or execution by a combination of hardware and software modules in the decoding processor. The software module can reside in a readily available storage medium in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, or registers. This storage medium is located in memory 101, and the processor 100 reads the information from memory 101 and, in conjunction with its hardware, completes the steps of the method described in the foregoing embodiments.

[0123] This embodiment also provides a machine-readable storage medium that stores machine-executable instructions. When the machine-executable instructions are called and executed by a processor, the machine-executable instructions cause the processor to implement the above-mentioned method for generating work paths in the substation.

[0124] The computer program product for the method, apparatus and system for generating work paths in substations provided in this disclosure includes a computer-readable storage medium storing program code. The instructions included in the program code can be used to execute the methods described in the preceding method embodiments. For specific implementation details, please refer to the method embodiments, which will not be repeated here.

[0125] Those skilled in the art will clearly understand that, for the sake of convenience and brevity, the specific working process of the system and apparatus described above can be referred to the corresponding process in the foregoing method embodiments, and will not be repeated here.

[0126] Furthermore, in the description of the embodiments of this disclosure, unless otherwise expressly specified and limited, the terms "installation," "connection," and "linking" should be interpreted broadly. For example, they can refer to a fixed connection, a detachable connection, or an integral connection; they can refer to a mechanical connection or an electrical connection; they can refer to a direct connection or an indirect connection through an intermediate medium; and they can refer to the internal connection of two components. Those skilled in the art can understand the specific meaning of the above terms in this disclosure based on the specific circumstances.

[0127] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this disclosure, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this disclosure. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0128] In the description of this disclosure, it should be noted that the terms "center," "upper," "lower," "left," "right," "vertical," "horizontal," "inner," and "outer," etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings, and are only for the convenience of describing this disclosure and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of this disclosure. Furthermore, the terms "first," "second," and "third" are used for descriptive purposes only and should not be construed as indicating or implying relative importance.

[0129] Finally, it should be noted that the above embodiments are merely specific implementations of this disclosure, used to illustrate the technical solutions of this disclosure, and not to limit it. The protection scope of this disclosure is not limited thereto. Although this disclosure has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that any person skilled in the art can still modify or easily conceive of changes to the technical solutions described in the foregoing embodiments, or make equivalent substitutions for some of the technical features, within the scope of the technology disclosed in this disclosure. Such modifications, changes, or substitutions do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of this disclosure, and should all be covered within the protection scope of this disclosure. Therefore, the protection scope of this disclosure should be determined by the protection scope of the claims.

Claims

1. A method for generating work paths in a substation, characterized in that, The method includes: Obtain task information, the three-dimensional spatial model of the substation, and safety constraint information; Based on the security constraint information, restricted and non-restricted areas are determined in the three-dimensional spatial model; Based on the task information, an optimal work path is generated in the non-restricted area, starting from the entrance of the substation and ending at the target work equipment. Based on the three-dimensional spatial model and the optimal work path, the path space corresponding to the optimal work path is determined from the physical space of the substation; an authorization instruction is generated based on the optimal work path, the authorization instruction being used to: issue unlocking permissions for access control and / or equipment locks within the path space to the operator, so that the operator can reach the target work equipment according to the optimal work path.

2. The method according to claim 1, characterized in that, Based on the task information, the step of generating the optimal work path in the non-restricted area, starting from the entrance of the substation and ending at the target work equipment, includes: The target work equipment is determined based on the work task information, and the entrance of the substation is used as the starting point of the path search, while the position of the target work equipment in the three-dimensional space model is used as the ending point of the path search. The optimal path from the starting point to the ending point is searched in the non-restricted area using a path search algorithm, and the optimal path is determined as the best operation path. The path search algorithm aims to minimize the total path cost, which includes the sum of the actual travel cost from the starting point to the current node and the estimated travel cost from the current node to the ending point.

3. The method according to claim 2, characterized in that, The actual passage cost includes: a first passage cost, a second passage cost, and a third passage cost; The first passage cost is determined based on the preset passage cost of the spatial region corresponding to the current node; wherein, the preset passage cost is determined based on the region identifier of the spatial region, different region identifiers correspond to different preset passage costs, and the region identifier includes at least a non-restricted identifier and a restricted identifier; the preset passage cost corresponding to the restricted identifier is greater than the preset passage cost corresponding to the non-restricted identifier; The second passage cost is determined based on the distance from the current node to the nearest restricted area; The third passage cost is determined based on whether the current node overlaps with other operation paths; The estimated passage cost is determined based on the distance from the current node to the destination and the safe distance from the current node to the nearest restricted area.

4. The method according to claim 2, characterized in that, The step of searching for the optimal path from the starting point to the ending point in the non-restricted area using a path search algorithm includes: The three-dimensional spatial model is divided into multiple nodes, each node corresponding to a spatial region; Using the starting point as the current node, determine multiple candidate nodes adjacent to the current node from the plurality of nodes; For each candidate node, calculate the actual travel cost from the current node to the candidate node and the expected travel cost from the candidate node to the destination, and determine the sum of the actual travel cost and the expected travel cost as the target travel cost of the candidate node; The candidate node with the lowest target passage cost is selected as the path node; The path node is determined as the current node, and the step of determining multiple candidate nodes adjacent to the current node from the multiple nodes is continued until the current node is the destination. The obtained path node is then determined as the optimal job path.

5. The method according to claim 4, characterized in that, The step of calculating the actual travel cost from the current node to the candidate node includes: ; ; ; ; in, These are the candidate nodes. This refers to the actual passage cost; The first general cost is the passage cost based on the candidate nodes. The corresponding spatial area's area identifier corresponds to the preset passage cost. Sure; As a second passage cost, For the candidate node With the nearest target area The first distance between them For the target area The corresponding area coefficient; wherein, the target area includes: the second non-restricted area, the third non-restricted area, and the fourth non-restricted area among the restricted area and the non-restricted area, and different target areas correspond to different area coefficients; As a third passage cost, The preset passage cost.

6. The method according to claim 4, characterized in that, The step of calculating the expected travel cost from the candidate node to the destination includes: ; , ; in, These are the candidate nodes. The estimated passage cost, For the cost of the fourth passage, The weighting coefficient for the fourth passage cost. For the cost of the fifth passage, The weighting coefficient for the fifth passage cost is greater than the weighting coefficient for the fourth passage cost. For the candidate node To the endpoint distance, This is the first preset coefficient; For the candidate node With the nearest restricted area distance, This is the second preset coefficient.

7. The method according to claim 4, characterized in that, After determining multiple candidate nodes adjacent to the current node from the plurality of nodes, the method further includes: If the spatial region corresponding to the first candidate node among the plurality of candidate nodes is in the restricted area, delete the first candidate node from the plurality of candidate nodes.

8. The method according to claim 4, characterized in that, Before the step of selecting the candidate node with the lowest target passage cost as the path node, the method further includes: Determine whether the candidate node exists in the preset list; the preset list is used to store the starting point, the candidate node, and the target passage cost of the candidate node; If it does not exist, save the candidate node and the target passage cost of the candidate node to the preset list; If it exists, calculate the first total cost from the starting point through the current node to the candidate node, and determine the second total cost of the candidate node from the preset list; If the first total cost is less than the second total cost, the parent node of the candidate node stored in the preset list is updated to the current node, and the second total cost of the candidate node is updated to the first total cost; otherwise, the candidate node stored in the preset list is retained.

9. The method according to claim 1, characterized in that, The safety constraint information includes at least one of the following: the energized state of primary equipment and the isolation boundary of secondary equipment; The step of determining restricted and non-restricted areas in the three-dimensional spatial model based on the security constraint information includes: Based on the energized state of the primary equipment, the spatial area where the energized equipment is located and the spatial area at a preset distance from the energized equipment in the three-dimensional spatial model are determined as the restricted area, and the area identifier of the restricted area is set as a restricted area identifier; The spatial regions in the three-dimensional spatial model other than the restricted areas are defined as the non-restricted areas, and the region identifiers of the non-restricted areas are set as non-restricted identifiers.

10. The method according to claim 9, characterized in that, The method further includes: The maintenance channel area within the non-restricted area is designated as the first non-restricted area, and the area identifier of the first non-restricted area is set as the first identifier. The auxiliary passage area within the non-restricted area is designated as the second non-restricted area, and the area identifier of the third non-restricted area is set as the second identifier; Based on the cabinet equipment in the three-dimensional spatial model, the passage area near the cabinet equipment in the non-restricted area is determined as the third non-restricted area, and the area identifier of the third non-restricted area is set as the third identifier; Based on the secondary equipment isolation boundary, the space enclosed by the isolation boundary in the non-restricted area is defined as the fourth non-restricted area, and the area identifier of the fourth non-restricted area is set as the fourth identifier; The preset passage cost corresponding to the first identifier is less than the preset passage cost corresponding to the second identifier, the preset passage cost corresponding to the second identifier is less than the preset passage cost corresponding to the third identifier, and the preset passage cost corresponding to the third identifier is less than the preset passage cost corresponding to the fourth identifier.

11. The method according to claim 1, characterized in that, The method further includes: Obtain the real-time location coordinates of the workers at the substation, and determine whether the real-time location coordinates deviate from the optimal work path; If so, follow these steps: If the deviation distance is greater than or equal to a first distance threshold and less than a second distance threshold, a first warning signal is generated. The first warning signal is used to control the positioning device worn by the operator to issue a warning reminder. If the deviation distance is greater than or equal to the second distance threshold and less than the third distance threshold, a second warning signal is generated. The second warning signal is used to control the broadcasting equipment of the substation to play a voice warning. If the deviation distance is greater than or equal to the third distance threshold, a third warning signal is generated. The third warning signal is used to send an access freeze signal to the interlocking system of the substation to control the target equipment in the substation to be frozen. The target equipment is the equipment closest to the operator.

12. The method according to claim 11, characterized in that, The method further includes: Based on the optimal work path, a guide light control command is generated. The guide light control command is used to control the guide lights in the space through which the path passes to light up sequentially along the direction of the optimal work path, so as to guide the workers to move along the optimal work path.

13. The method according to claim 11, characterized in that, The method further includes: After the operator completes the task based on the optimal work path, the operator's movement trajectory, warning records, equipment status of the substation, task information, and optimal work path are saved to a preset storage space.

14. A device for generating work paths in a substation, characterized in that, The device includes: The information acquisition module is used to acquire work task information, the three-dimensional spatial model of the substation, and safety constraint information; The region determination module is used to determine prohibited and non-restricted regions in the three-dimensional spatial model based on the security constraint information. The path generation module is used to generate the optimal operation path in the non-restricted area based on the operation task information, starting from the entrance of the substation and ending at the target operation equipment. The instruction generation module is used to determine the path space corresponding to the optimal operation path from the physical space of the substation based on the three-dimensional spatial model and the optimal operation path; and to generate an authorization instruction based on the optimal operation path. The authorization instruction is used to issue unlocking permissions for access control and / or equipment locks in the path space to the operator, so that the operator can reach the target operation equipment according to the optimal operation path.

15. An electronic device, characterized in that, The device includes a processor and a memory, the memory storing computer-executable instructions that can be executed by the processor, the processor executing the computer-executable instructions to implement the method for generating work paths in a substation as described in any one of claims 1-13.

16. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when invoked and executed by a processor, cause the processor to implement the method for generating work paths in a substation as described in any one of claims 1-13.