A multi-constraint hierarchical verification method for power line channel intelligent planning calculation

Abstract

The application provides a multi-constraint hierarchical verification power line channel intelligent planning calculation method, and relates to the field of circuit planning. The method comprises the following steps: forming a forbidden set and a restricted set according to the crossing authority of point-line-surface channel restriction elements, and combining the obtained anchor nodes and locked segments to form planning input data; generating a candidate path coordinate sequence avoiding the forbidden set according to the path length, the tortuosity coefficient and the compliance score; smoothing the un-locked segments of the candidate path coordinate sequence according to the editing operation to obtain a modified path coordinate sequence; comparing the modified path coordinate sequence with the global channel constraint, the forbidden set and the restricted set to obtain a compliance state; writing the modified path coordinate sequence without serious violation items into a compliance path set, comparing the spatial indicators of the compliance path set and selecting the optimal one as a target power line channel path coordinate sequence.

Description

Technical Field

[0001] This invention relates to the field of circuit planning technology, and specifically to an intelligent planning and calculation method for power line channels with multi-constraint hierarchical verification. Background Technology

[0002] The preliminary route selection for high-voltage and ultra-high-voltage transmission lines is an important part of the power grid engineering survey and design. The route of the line is related to the scope of the project construction, ecological protection requirements, relocation coordination scope and subsequent operation and maintenance conditions.

[0003] Existing route planning methods mainly include two categories: manual route selection and automatic route planning. In the manual route selection method, designers draw routes based on Geographic Information System (GIS) maps and record constraints such as route length, tortuosity coefficient, administrative regions, ecological protection zones, villages and towns, mineral resource areas, and military influence zones through design manuals, spreadsheets, and other media. The route is then manually verified after completion. In the automatic route planning method, some tools employ a single shortest path algorithm and avoid certain areas by overlaying a restricted zone layer.

[0004] Existing tools typically store global constraints such as route length, tortuosity coefficient, administrative region, and engineering standards in a scattered manner. These constraints require repeated configuration when creating new planning tasks, easily leading to missing or inconsistent constraint fields. For point, line, and area constraints such as demolition zones, urban planning zones, ecological protection zones, military influence zones, and mineral resource zones, existing tools usually only use a binary approach of "allowed" or "prohibited," failing to configure crossing permissions based on constraint type (allowed, restricted, or prohibited).

[0005] Existing tools have limited anchoring methods for start points, end points, and waypoints, lacking mechanisms for waypoint sorting and fixed segment locking; path generation typically outputs only a single path, failing to simultaneously generate candidate paths with varying lengths, tortuosity coefficients, and compliance scores. After designers edit path inflection points, existing tools often cannot immediately verify path length, tortuosity coefficients, and constraint traversal; some tools still allow path storage even with serious violations, and spatial metrics between multiple paths require manual comparison. Summary of the Invention

[0006] This invention addresses the problems existing in the prior art by providing a smart planning and calculation method for power line corridors with multi-constraint hierarchical verification. It solves the problem that in existing power line corridor planning, multiple types of spatial constraints are not applied to path generation, path correction, and compliance verification, making it difficult to determine the compliance of corridor paths in a timely manner. This invention achieves the effect of automatically outputting the target power line corridor path coordinate sequence based on hierarchical constraints.

[0007] To achieve the above objectives, the technical solution adopted by the present invention is as follows:

[0008] Read global channel constraints and point-line-area channel constraints, form prohibited sets and restricted sets according to the crossing permissions of point-line-area channel constraints, and combine them with the obtained anchor nodes and locked segments to form planning input data; Based on the planning input data, a sequence of candidate path coordinates for avoiding the prohibited entry set is generated using path length, tortuosity coefficient, and compliance score; The candidate path coordinate sequence is smoothed by editing operations to obtain the corrected path coordinate sequence. The corrected path coordinate sequence is then compared with the global channel constraint, the forbidden set, and the restriction set to obtain the compliance status. The final compliance status is reviewed, and the corrected path coordinate sequence without serious violations is written into the compliant path set. The spatial indicators of the compliant path set are compared, and the optimal one is selected as the target power line channel path coordinate sequence.

[0009] In some embodiments, the process of reading global channel constraints includes: Read the preset limit values ​​corresponding to the total channel length, segment length, and tortuosity coefficient; Read the permitted, restricted, or prohibited crossing conditions for administrative regions; Write the preset limit values ​​and the conditions corresponding to the administrative regions into the global channel constraint field according to the field names; Write the global channel constraint field into the planning input data.

[0010] In some embodiments, the process of forming a forbidden set and a restricted set based on the traversal permissions of the point, line, and surface channel constraints includes: Import point constraint layer, line constraint layer, and polygon constraint layer; The channel constraint elements in the point constraint layer, the line constraint layer, and the area constraint layer are classified according to their geometric type and constraint type. Write passage permissions (allow passage, restrict passage, or prohibit passage) for each type of passage constraint element; The channel constraint elements with prohibited traversal permissions are written into the prohibited set, and the channel constraint elements with restricted traversal permissions are written into the restricted set.

[0011] In some embodiments, the process of generating a sequence of candidate path coordinates to avoid the forbidden set includes: Generate a path coordinate sequence with the minimum path length based on the anchor nodes and the locked segments; Generate a path coordinate sequence with the minimum tortuosity coefficient based on the anchor nodes and the locked segments; The compliance score of each path coordinate sequence is calculated based on the global channel constraints, the forbidden set, and the restriction set, and the path coordinate sequence with the highest compliance score is generated. Delete the path coordinate sequence that traverses the forbidden set, and use the remaining path coordinate sequence as the candidate path coordinate sequence.

[0012] In some embodiments, the process of obtaining anchor nodes and locking segments includes: Obtain the starting point and ending point coordinates by selecting points on the map, entering coordinates, or querying the substation database. Receive add, delete, or sort operations on waypoints and obtain the sorted coordinates of waypoints; The channel path is divided into segments based on the starting point coordinates, the ending point coordinates, and the sorted waypoint coordinates. The selected channel path is segmented and written into the locked segment field, and the starting point coordinates, the ending point coordinates, the sorted waypoint coordinates, and the locked segment are used as the anchor node and the locked segment.

[0013] In some embodiments, the process of smoothing the unlocked segments of the candidate path coordinate sequence according to the editing operation and obtaining a compliance status includes: Receive operations for moving, adding, or deleting path inflection points in the candidate path coordinate sequence. Retain the coordinates of the path inflection points of the locked segments, and perform the operation on the path inflection points of the unlocked segments; The modified path coordinate sequence is obtained by smoothly fitting the unlocked segments based on the adjusted path inflection point coordinates. The corrected path coordinate sequence is compared with the global channel constraints, the forbidden set, and the restriction set, and the compliance status is written in green, yellow, or red according to the comparison result.

[0014] In some embodiments, the process of finalizing the compliance status and outputting the target power line corridor path coordinate sequence includes: A full verification is performed on the path length, tortuosity coefficient, administrative region, and crossing permission of the modified path coordinate sequence, generating a verification report including qualified items, warning items, and violation items; When the verification report includes a violation item corresponding to a red compliance status, the storage operation of the correction path coordinate sequence is intercepted; When the verification report does not include any violations corresponding to the red compliance status, the corrected path coordinate sequence is written into the compliance path set; By comparing the path length, tortuosity coefficient, number of crossing channel constraints, and compliance status of each path coordinate sequence in the compliant path set, the target power line channel path coordinate sequence is selected.

[0015] This invention proposes a multi-constraint hierarchical verification intelligent planning and calculation system for power line corridors, comprising: The constraint anchoring module is configured to read global channel constraints and point-line-plane channel constraint elements, form a prohibited set and a restricted set according to the crossing permissions of the point-line-plane channel constraint elements, and form planning input data with the obtained anchoring nodes and locked segments; The candidate path generation module is configured to generate a sequence of candidate path coordinates that avoid the prohibited entry set based on the planning input data, with path length, tortuosity coefficient and compliance score as optimization objectives; The editing and verification module is configured to smooth the unlocked segments of the candidate path coordinate sequence according to the editing operation to obtain the corrected path coordinate sequence, and compare the corrected path coordinate sequence with the global channel constraint, the forbidden set and the restriction set to obtain the compliance status. The final review and selection module is configured to review the compliance status, write the corrected path coordinate sequence without serious violations into the compliant path set, and output the target power line channel path coordinate sequence based on the compliant path set.

[0016] This invention proposes a computer device, comprising: At least one processor; and a memory storing a computer program executable on the processor, wherein the processor executes the steps of the intelligent planning and calculation method for power line corridors with multi-constraint hierarchical verification when executing the program.

[0017] This invention proposes a computer-readable storage medium storing a computer program, which, when executed by a processor, performs the steps of the intelligent planning and calculation method for power line channels with multi-constraint hierarchical verification.

[0018] Compared with the prior art, the present invention has the following beneficial effects: This invention proposes a multi-constraint hierarchical verification method for intelligent planning and calculation of power line corridors. The method includes: reading global corridor constraints and point-line-surface corridor constraint elements; forming a prohibited set and a restricted set according to the crossing permissions of the point-line-surface corridor constraint elements; and constructing planning input data with the obtained anchor nodes and locked segments; generating a candidate path coordinate sequence that avoids the prohibited set based on the planning input data, using path length, tortuosity coefficient, and compliance score; smoothing the unlocked segments of the candidate path coordinate sequence using editing operations to obtain a corrected path coordinate sequence; comparing the corrected path coordinate sequence with the global corridor constraints, the prohibited set, and the restricted set to obtain a compliance status; finalizing the compliance status; writing the corrected path coordinate sequence without serious violations into the compliant path set; comparing the spatial indicators of the compliant path set and selecting the optimal one as the target power line corridor path coordinate sequence.

[0019] This application ensures that the same channel constraint factors maintain consistent constraint effects throughout the path generation, path correction, and final review processes, resulting in multiple candidate channel paths with different spatial indicators. During the candidate path generation stage, the prohibited entry set is avoided, allowing paths entering prohibited crossing areas to be excluded before subsequent editing and final review. Locked segments are excluded from editing, maintaining fixed channel segments between anchor nodes during path correction and preventing path adjustments from altering the preset channel positions. By comparing the path length, tortuosity coefficient, number of crossing channel constraint factors, and compliance status of each path coordinate sequence in the compliant path set, the target power line channel path coordinate sequence can be output from multiple paths meeting the final review criteria. Attached Figure Description

[0020] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other embodiments can be obtained based on these drawings without creative effort.

[0021] Figure 1 The flowchart of a power line corridor intelligent planning and calculation method with multi-constraint hierarchical verification provided by the present invention is shown.

[0022] Figure 2 This invention provides a module diagram of an intelligent planning and calculation system for power line channels with multi-constraint hierarchical verification.

[0023] Figure 3 A schematic diagram of the structure of an embodiment of the computer device provided by the present invention.

[0024] Figure 4A schematic diagram of an embodiment of the computer-readable storage medium provided by the present invention. Detailed Implementation

[0025] The present invention will be further described below with reference to the accompanying drawings. The following embodiments are only used to more clearly illustrate the technical solutions of the present invention and should not be construed as limiting the scope of protection of the present invention. It should be noted that the following detailed descriptions are exemplary and intended to provide further explanation of this application.

[0026] It should be noted that all uses of "first" and "second" in the embodiments of the present invention are for the purpose of distinguishing two entities or parameters with the same name but different names. It is clear that "first" and "second" are only for the convenience of expression and should not be construed as limiting the embodiments of the present invention. Subsequent embodiments will not explain this in detail.

[0027] This invention proposes a multi-constraint hierarchical verification intelligent planning and calculation method for power line corridors. Please refer to [link / reference]. Figure 1 ,include: Read global channel constraints and point-line-area channel constraints, form prohibited sets and restricted sets according to the crossing permissions of point-line-area channel constraints, and combine them with the obtained anchor nodes and locked segments to form planning input data; Based on the planning input data, a sequence of candidate path coordinates for avoiding the prohibited entry set is generated using path length, tortuosity coefficient, and compliance score; The candidate path coordinate sequence is smoothed by editing operations to obtain the corrected path coordinate sequence. The corrected path coordinate sequence is then compared with the global channel constraint, the forbidden set, and the restriction set to obtain the compliance status. The final compliance status is reviewed, and the corrected path coordinate sequence without serious violations is written into the compliant path set. The spatial indicators of the compliant path set are compared, and the optimal one is selected as the target power line channel path coordinate sequence.

[0028] Traditional line planning tools only support simple overlay of prohibited layers and single-objective pathfinding, resulting in fragmented constraint management, coarse control of constraint elements, poor adaptability to multi-dimensional complex constraint scenarios of large-scale inter-provincial transmission lines, and an enormous workload for manual verification. This invention establishes a three-layer hierarchical constraint management architecture, unifies and standardizes global engineering constraint templates, and provides refined hierarchical management of all types of constraint elements (points, lines, and surfaces). It achieves path point locking through multi-source anchoring nodes, generates multiple line schemes in batches through multi-objective intelligent pathfinding, and combines drag-and-drop real-time three-color verification and a final review strong interception compliance engine. It also completes line selection by combining full-element version archiving and quantitative comparison of multiple schemes. Compared to the traditional planning mode of manual drawing and post-event unified verification, this invention significantly reduces the workload of repeated manual adjustments and compliance verification, significantly reduces line design compliance risks and scheme comparison cycles, and greatly improves the overall work efficiency of surveying and designing megavolt-level long-distance transmission lines while ensuring the compliance and accuracy of transmission line planning indicators.

[0029] This application enables the reuse of global constraint templates, hierarchical and refined control of constraint points, flexible anchoring of path nodes, batch generation of multiple compliant paths for multiple objectives, real-time three-color verification by manual drag-and-drop, strong constraint interception of non-compliant schemes in the final review, and quantitative comparison of all elements of multiple schemes, thereby comprehensively improving the efficiency of transmission line planning and design, scheme compliance, and the convenience of engineering selection.

[0030] The specific implementation steps of this invention include: S1, global public constraint configuration, entering the basic public condition management module, inputting all hard constraints such as line length, tortuosity coefficient, administrative region, cost, and engineering standards, and saving them as a dedicated constraint template, which can be reused with one click in subsequent projects; S2. Hierarchical configuration of constraint elements: Import geospatial point, line or area constraint layers into the constraint point fine management module, configure traversal permissions independently for each type of constraint point, and mark major restricted areas such as military zones and core ecological zones. S3. Path anchoring node settings: Select the starting point and ending point through the start and waypoint management module, add necessary waypoints and drag and adjust their sorting, and perform locking operations on fixed corridor segments. S4. Multi-objective automatic generation of multiple paths: The intelligent path planning engine reads hierarchical constraint parameters and generates three candidate paths with one click based on three types of optimization objectives. The generation process automatically avoids all restricted areas and controls basic indicators. S5. Manual interactive path correction: drag and drop to adjust path inflection points, add or remove inflection points, and the system will automatically and smoothly fit the route. Locked segments will not participate in the adjustment. S6. Real-time dynamic compliance verification: The system immediately triggers the verification engine after each path adjustment, displaying the compliance status with green, yellow or red indicators, and pop-up prompts for risks of exceeding limits or going out of bounds. S7. Full-dimensional compliance final review: After the route is edited, the real-time verification engine is launched for a full-scale final review, automatically generating a complete compliance verification report; if there are any red serious violations, the system will prevent the current plan from being saved. S8. Scheme storage and multi-scheme comparison: compliant schemes are fully archived; multiple planning schemes can be retrieved and displayed on the same screen; the system automatically compares quantitative indicators such as route length, tortuosity coefficient, number of crossing constraint points, and compliance level; designers select the best scheme based on the comparison results.

[0031] It should be noted that, in this embodiment of the invention, the power line corridor refers to the spatial corridor used for laying transmission lines; the corridor path coordinate sequence refers to multiple spatial coordinate points arranged in the order of path extension; global corridor constraints include total corridor length, segment length, tortuosity coefficient, and administrative region conditions; point-line-area corridor constraint elements refer to spatial constraint objects expressed by point geometric objects, line geometric objects, and area geometric objects, respectively; crossing permissions include allowing crossing, restricting crossing, and prohibiting crossing. By uniformly processing global corridor constraints and point-line-area corridor constraint elements, planning input data that can be used for subsequent path generation and path verification can be formed.

[0032] For example, in one specific implementation, the power line corridor planning device reads the pre-stored upper limit of the total corridor length, upper limit of the segment length, and allowable range of the tortuosity coefficient, and reads the allowed crossing, restricted crossing, or prohibited crossing conditions corresponding to the administrative region, and writes each field into the global corridor constraint field.

[0033] In some embodiments, the process of reading global channel constraints includes: Read the preset limit values ​​corresponding to the total channel length, segment length, and tortuosity coefficient; Read the permitted, restricted, or prohibited crossing conditions for administrative regions; Write the preset limit values ​​and the conditions corresponding to the administrative regions into the global channel constraint field according to the field names; Write the global channel constraint field into the planning input data.

[0034] In one possible implementation, global channel constraints also include engineering conditions corresponding to voltage level, conductor type, tower type, icing area, and wind speed area. These engineering conditions, along with the total channel length, segment length, and tortuosity coefficient, can be written into the planning input data to participate in subsequent compliance scoring calculations and final verification.

[0035] For example, in one specific implementation, the power line corridor planning equipment reads the upper limit of the total corridor length, the upper limit of the segment length, the allowable range of the tortuosity coefficient, and the prohibited administrative regions from a constraint template, and writes the reading results into the planning input data.

[0036] In some embodiments, the process of forming a forbidden set and a restricted set based on the traversal permissions of the point, line, and surface channel constraints includes: Import point constraint layer, line constraint layer, and polygon constraint layer; The channel constraint elements in the point constraint layer, the line constraint layer, and the area constraint layer are classified according to their geometric type and constraint type. Write passage permissions (allow passage, restrict passage, or prohibit passage) for each type of passage constraint element; The channel constraint elements with prohibited traversal permissions are written into the prohibited set, and the channel constraint elements with restricted traversal permissions are written into the restricted set.

[0037] It should be noted that, in this embodiment of the invention, the point constraint layer includes channel constraint elements represented by coordinate points, the line constraint layer includes channel constraint elements represented by connecting lines, and the area constraint layer includes channel constraint elements represented by closed boundaries. After importing the point constraint layer, the line constraint layer, and the area constraint layer, the power line channel planning equipment classifies the channel constraint elements according to their geometric type and constraint type.

[0038] The constraint types for corridor constraints can include demolition zones, urban planning zones, ecological protection zones, forest parks, military impact zones, mineral resource zones, and areas with operational difficulties. Power line corridor planning equipment assigns crossing permissions to each type of corridor constraint, adding corridor constraint elements with prohibited crossing permissions to the prohibited set and corridor constraint elements with restricted crossing permissions to the restricted set.

[0039] Additionally, it should be noted that channel constraints in the prohibited set do not participate in the traversal calculation of candidate paths, and the candidate path coordinate sequence is deleted when it traverses the prohibited set; channel constraints in the restricted set participate in the compliance score calculation and compliance status generation, and the corresponding traversal record is retained when the candidate path coordinate sequence traverses the restricted set.

[0040] For example, in one specific implementation, the power line corridor planning equipment writes the core ecological protection zone and the military influence zone into the prohibited set, and writes the housing demolition area that needs to be coordinated into the restricted set; when the path coordinate sequence crosses the core ecological protection zone, it is deleted, and when the path coordinate sequence crosses the housing demolition area, a restricted crossing record is generated.

[0041] In some embodiments, the process of generating a sequence of candidate path coordinates to avoid the forbidden set includes: Generate a path coordinate sequence with the minimum path length based on the anchor nodes and the locked segments; Generate a path coordinate sequence with the minimum tortuosity coefficient based on the anchor nodes and the locked segments; The compliance score of each path coordinate sequence is calculated based on the global channel constraints, the forbidden set, and the restriction set, and the path coordinate sequence with the highest compliance score is generated. Delete the path coordinate sequence that traverses the forbidden set, and use the remaining path coordinate sequence as the candidate path coordinate sequence.

[0042] It should be noted that, in this embodiment of the invention, the candidate path coordinate sequence refers to a channel path consisting of multiple path inflection point coordinates, with anchor nodes as the starting and ending points or intermediate locations. The power line channel planning equipment generates the path coordinate sequence with the shortest path length, the path coordinate sequence with the smallest tortuosity coefficient, and the path coordinate sequence with the highest compliance score based on the anchor nodes and locked segments, respectively.

[0043] Path length refers to the sum of the distances between adjacent path inflection points in a path coordinate sequence. The tortuosity coefficient is the ratio of path length to the straight-line distance between the starting and ending points. The compliance score is the evaluation value calculated based on global channel constraints, prohibited sets, and restricted sets for the path coordinate sequence. Power line corridor planning equipment deletes path coordinate sequences that cross prohibited sets and adds the remaining path coordinate sequences to the candidate path coordinate sequence.

[0044] In some embodiments, the process of obtaining anchor nodes and locking segments includes: Obtain the starting point and ending point coordinates by selecting points on the map, entering coordinates, or querying the substation database. Receive add, delete, or sort operations on waypoints and obtain the sorted coordinates of waypoints; The channel path is divided into segments based on the starting point coordinates, the ending point coordinates, and the sorted waypoint coordinates. The selected channel path is segmented and written into the locked segment field, and the starting point coordinates, the ending point coordinates, the sorted waypoint coordinates, and the locked segment are used as the anchor node and the locked segment.

[0045] It should be noted that, in this embodiment of the invention, the anchoring node includes the starting point coordinates, the ending point coordinates, and the sorted coordinates of the waypoints. The starting point coordinates and the ending point coordinates can be obtained through map point selection, coordinate input, or substation database query. The waypoint coordinates can be adjusted through adding, deleting, and sorting operations. The sorted waypoint coordinates are used to define the spatial positions traversed sequentially by the channel path coordinate sequence.

[0046] Locked segments refer to channel path segments divided by adjacent anchor nodes that do not participate in path inflection point editing. The power line channel planning equipment divides the channel path into segments based on the starting point coordinates, ending point coordinates, and sorted waypoint coordinates. The selected channel path segments are written into the locked segment field, and the anchor nodes and locked segments are written into the planning input data.

[0047] For example, in one specific implementation, the power line corridor planning equipment reads the starting point coordinates and ending point coordinates from the substation database, adds multiple waypoint coordinates between them, and arranges them according to the order in which the line passes; and writes the corridor path located in the fixed corridor into the locked segment field.

[0048] In some embodiments, the process of smoothing the unlocked segments of the candidate path coordinate sequence according to the editing operation and obtaining a compliance status includes: Receive operations for moving, adding, or deleting path inflection points in the candidate path coordinate sequence. Retain the coordinates of the path inflection points of the locked segments, and perform the operation on the path inflection points of the unlocked segments; The modified path coordinate sequence is obtained by smoothly fitting the unlocked segments based on the adjusted path inflection point coordinates. The corrected path coordinate sequence is compared with the global channel constraints, the forbidden set, and the restriction set, and the compliance status is written in green, yellow, or red according to the comparison result.

[0049] It should be noted that, in this embodiment of the invention, the editing operation includes moving path inflection points, adding path inflection points, and deleting path inflection points. After receiving the editing operation, the power line corridor planning equipment retains the coordinates of path inflection points in the locked segments and only performs the editing operation on path inflection points in the unlocked segments.

[0050] Smoothing fitting refers to the process of generating continuous channel paths based on the adjusted path inflection point coordinates. The power line channel planning equipment performs smooth fitting on the unlocked segments based on the adjusted path inflection point coordinates to obtain a corrected path coordinate sequence. This corrected path coordinate sequence retains the path inflection point coordinates of the locked segments.

[0051] The power line corridor planning equipment compares the corrected path coordinate sequence with the global corridor constraints, the prohibited set, and the restricted set to obtain the compliance status. A green compliance status indicates that the corrected path coordinate sequence satisfies the global corridor constraints and does not cross the restricted set or the prohibited set; a yellow compliance status indicates that the corrected path coordinate sequence satisfies the global corridor constraints but crosses the restricted set; and a red compliance status indicates that the corrected path coordinate sequence violates the global corridor constraints or crosses the prohibited set.

[0052] In some embodiments, the process of finalizing the compliance status and outputting the target power line corridor path coordinate sequence includes: A full verification is performed on the path length, tortuosity coefficient, administrative region, and crossing permission of the modified path coordinate sequence, generating a verification report including qualified items, warning items, and violation items; When the verification report includes a violation item corresponding to a red compliance status, the storage operation of the correction path coordinate sequence is intercepted; When the verification report does not include any violations corresponding to the red compliance status, the corrected path coordinate sequence is written into the compliance path set; By comparing the path length, tortuosity coefficient, number of crossing channel constraints, and compliance status of each path coordinate sequence in the compliant path set, the target power line channel path coordinate sequence is selected.

[0053] It should be noted that, in this embodiment of the invention, the final review refers to the process of performing a full verification of the corrected path coordinate sequence. The power line corridor planning equipment verifies the path length, tortuosity coefficient, administrative region, and crossing permissions of the corrected path coordinate sequence, and generates a verification report including qualified items, warning items, and violation items.

[0054] When the verification report includes violations corresponding to a red compliance status, the power line corridor planning equipment intercepts the storage operation of the corrected path coordinate sequence; when the verification report does not include violations corresponding to a red compliance status, the corrected path coordinate sequence is written into the compliant path set. The compliant path set refers to the set of multiple corridor path coordinate sequences that do not contain serious violations after final review.

[0055] The power line corridor planning equipment compares the path length, tortuosity coefficient, number of crossing constraints, and compliance status of each path coordinate sequence in the compliant path set, and selects the target power line corridor path coordinate sequence based on the comparison results. The target power line corridor path coordinate sequence serves as the spatial path data for subsequent transmission line corridor design.

[0056] For example, in one specific implementation, the power line corridor planning device writes multiple corrected path coordinate sequences that do not contain violations corresponding to red compliance status into a compliant path set, compares the path length, tortuosity coefficient and number of corridor crossing constraints of each path coordinate sequence, and selects the path coordinate sequence that meets the preset comparison conditions as the target power line corridor path coordinate sequence.

[0057] This invention proposes a multi-constraint hierarchical verification intelligent planning and calculation system for power line corridors. Please refer to [link / reference]. Figure 2 ,include: The constraint anchoring module is configured to read global channel constraints and point-line-plane channel constraint elements, form a prohibited set and a restricted set according to the crossing permissions of the point-line-plane channel constraint elements, and form planning input data with the obtained anchoring nodes and locked segments; The candidate path generation module is configured to generate a sequence of candidate path coordinates that avoid the prohibited entry set based on the planning input data, with path length, tortuosity coefficient and compliance score as optimization objectives; The editing and verification module is configured to smooth the unlocked segments of the candidate path coordinate sequence according to the editing operation to obtain the corrected path coordinate sequence, and compare the corrected path coordinate sequence with the global channel constraint, the forbidden set and the restriction set to obtain the compliance status. The final review and selection module is configured to review the compliance status, write the corrected path coordinate sequence without serious violations into the compliant path set, and output the target power line channel path coordinate sequence based on the compliant path set. Detailed implementation method: The system adopts a B / S architecture, with a backend containing a GIS spatial database, a substation database, and a land spatial constraint layer library, and a frontend featuring a visual interactive interface. It is divided into six decoupled functional modules: The basic public conditions management module supports configuring engineering standards such as the upper limit of the total line length or segment length, the allowable range of tortuosity coefficient, prohibited, priority, or restricted administrative areas, total investment or cost per kilometer or terrain adjustment coefficient, voltage, conductor, tower type, icing, and wind speed. All configuration parameters can be saved as a custom template, which can be loaded with one click for new projects. Implementation example: Create a template for a new 220kV mountain transmission line with a total length limit of 80km, a tortuosity coefficient of 1.0~1.4, prohibition of crossing national nature reserves, and a mountain terrain cost coefficient of 1.3. After saving the template, subsequent similar projects can directly use it.

[0059] The constraint point refined management module supports importing point, line, and surface vector constraint layers, and has built-in expandable constraint types: dense housing demolition areas, urban planning areas, areas with difficulties in three-level coordination, areas with difficulties in operation and maintenance, mineral resources, ecological protection areas at all levels, forest parks, and military impact areas; each type of constraint point can be configured independently to allow or disallow crossing, and military and core ecological areas are prohibited from crossing by default.

[0060] The Start and Waypoint Management module supports three point selection methods for the start and end points: manual selection on the map, latitude and longitude coordinate input, and direct selection from the substation database. Multiple mandatory waypoints can be added, and the order of waypoints can be adjusted by dragging, deleting, and adding. It also supports locking any segment of the line, and locked segments will not change when dragged and edited.

[0061] The intelligent path planning engine module includes three types of algorithms that run in parallel: shortest path, path with minimum tortuosity coefficient, and optimal path based on comprehensive compliance score. The automatic generation unit generates three sets of differentiated paths with one click. During the generation process, it automatically avoids all restricted areas and automatically controls the length and tortuosity coefficient to meet global constraints. The manual interactive editing unit supports dragging and moving any inflection point, adding or deleting inflection points, and automatically smoothing and fitting the line after moving them. The real-time verification unit immediately verifies each edit operation, using a three-color status indicator: green for complete compliance, yellow for potential warning risks, and red for serious violations, with a pop-up window displaying the specific violations.

[0062] The real-time verification engine module is an independent, multi-dimensional verification unit. After planning is completed, it triggers final verification. The verification scope includes global length, tortuosity coefficient, administrative region, and restriction point crossing permissions. After verification, a standardized report is output, listing qualified items, warning items, violations, and modification suggestions. When there is a red serious violation, the system intercepts and saves the plan.

[0063] The solution lifecycle management module's solution storage unit fully retains all constraint parameters, constraint rules, start and end point coordinates, complete path inflection points, and all verification records for each solution. It supports custom naming, adding notes, recording the creator and timestamp, and storing multiple solutions in parallel. The multi-solution comparison unit overlays and visualizes multiple paths on the same screen, automatically calculating and comparing indicators such as total route length, average tortuosity coefficient, number of constraint points crossed, and overall compliance level.

[0064] Based on the same inventive concept, according to another aspect of the present invention, such as Figure 3 As shown, an embodiment of the present invention also provides a computer device 30, which includes a processor 310 and a memory 320. The memory 320 stores a computer program 321 that can be run on the processor. When the processor 310 executes the program, it performs the steps of the method described above.

[0065] Based on the same inventive concept, according to another aspect of the present invention, such as Figure 4 As shown, embodiments of the present invention also provide a computer-readable storage medium 40, which stores a computer program 410 that, when executed by a processor, performs the methods described above.

[0066] Embodiments of the present invention may also include a corresponding computer device. The computer device includes a memory, at least one processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes any of the methods described above when executing the program.

[0067] The memory, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs, non-volatile computer-executable programs, and modules, such as program instructions or modules in the embodiments of this application. The processor executes various functional applications and data processing of the device by running the non-volatile software programs, instructions, and modules stored in the memory, thereby implementing the above-described method.

[0068] The memory may include a program storage area and a data storage area. The program storage area may store the operating system and applications required for at least one function; the data storage area may store data created based on the use of the device. Furthermore, the memory may include high-speed random access memory and non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In embodiments, the memory may optionally include memory remotely located relative to the processor, which can be connected to the local module via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0069] Finally, it should be noted that those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The program can be stored in a computer-readable storage medium, and when executed, it can include the processes of the embodiments of the methods described above. The storage medium for the program can be a magnetic disk, optical disk, read-only memory (ROM), or random access memory (RAM), etc. The above computer program embodiments can achieve the same or similar effects as any of the corresponding foregoing method embodiments.

[0070] Those skilled in the art will also understand that the various exemplary logic blocks, modules, circuits, and algorithm steps described in conjunction with the disclosure herein can be implemented as electronic hardware, computer software, or a combination of both. To clearly illustrate this interchangeability between hardware and software, the functionality of various illustrative components, blocks, modules, circuits, and steps has been generally described. Whether this functionality is implemented as software or as hardware depends on the specific application and the design constraints imposed on the system as a whole. Those skilled in the art can implement the functionality in various ways for each specific application, but such implementation decisions should not be construed as departing from the scope of the embodiments disclosed herein.

[0071] The above are exemplary embodiments disclosed in this invention. However, it should be noted that various changes and modifications can be made without departing from the scope of the embodiments of this invention as defined by the claims. The functions, steps, and / or actions of the methods according to the disclosed embodiments described herein do not need to be performed in any particular order. The sequence numbers of the disclosed embodiments of this invention are for descriptive purposes only and do not represent the superiority or inferiority of the embodiments. Furthermore, although the elements disclosed in the embodiments of this invention may be described or claimed individually, they may be understood as multiple unless explicitly limited to a singular number.

[0072] It should be understood that, as used herein, the singular form “a” is intended to include the plural form as well, unless the context clearly supports an exception. It should also be understood that, as used herein, “and or or” refers to any and all possible combinations of one or more of the associated listed items.

[0073] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of the invention (including the claims) is limited to these examples. Within the framework of the invention, technical features of the above embodiments or different embodiments can be combined, and many other variations of different aspects of the invention exist, which are not provided in the details for the sake of brevity. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the invention should be included within the protection scope of the invention.

Claims

1. A method for intelligent planning and calculation of power line corridors with multi-constraint hierarchical verification, characterized in that, The method includes: Read global channel constraints and point-line-area channel constraints, form prohibited sets and restricted sets according to the crossing permissions of point-line-area channel constraints, and combine them with the obtained anchor nodes and locked segments to form planning input data; Based on the planning input data, a sequence of candidate path coordinates for avoiding the prohibited entry set is generated using path length, tortuosity coefficient, and compliance score; The candidate path coordinate sequence is smoothed by editing operations to obtain the corrected path coordinate sequence. The corrected path coordinate sequence is then compared with the global channel constraint, the forbidden set, and the restriction set to obtain the compliance status. The final compliance status is reviewed, and the corrected path coordinate sequence without serious violations is written into the compliant path set. The spatial indicators of the compliant path set are compared, and the optimal one is selected as the target power line channel path coordinate sequence.

2. The intelligent planning and calculation method for power line corridors with multi-constraint hierarchical verification according to claim 1, characterized in that, The process of reading global channel constraints includes: Read the preset limit values ​​corresponding to the total channel length, segment length, and tortuosity coefficient; Read the permitted, restricted, or prohibited crossing conditions for administrative regions; Write the preset limit values ​​and the conditions corresponding to the administrative regions into the global channel constraint field according to the field names; Write the global channel constraint field into the planning input data.

3. The intelligent planning and calculation method for power line corridors with multi-constraint hierarchical verification according to claim 1, characterized in that, The process of forming a forbidden set and a restricted set based on the traversal permissions of the point, line, and surface channel constraints includes: Import point constraint layer, line constraint layer, and polygon constraint layer; The channel constraint elements in the point constraint layer, the line constraint layer, and the area constraint layer are classified according to their geometric type and constraint type. Write passage permissions (allow passage, restrict passage, or prohibit passage) for each type of passage constraint element; The channel constraint elements with prohibited traversal permissions are written into the prohibited set, and the channel constraint elements with restricted traversal permissions are written into the restricted set.

4. The intelligent planning and calculation method for power line corridors with multi-constraint hierarchical verification according to claim 3, characterized in that, The process of generating a sequence of candidate path coordinates to avoid the forbidden set includes: Generate a path coordinate sequence with the minimum path length based on the anchor nodes and the locked segments; Generate a path coordinate sequence with the minimum tortuosity coefficient based on the anchor nodes and the locked segments; The compliance score of each path coordinate sequence is calculated based on the global channel constraints, the forbidden set, and the restriction set, and the path coordinate sequence with the highest compliance score is generated. Delete the path coordinate sequence that traverses the forbidden set, and use the remaining path coordinate sequence as the candidate path coordinate sequence.

5. The intelligent planning and calculation method for power line corridors with multi-constraint hierarchical verification according to claim 1, characterized in that, The process of obtaining anchor nodes and locking segments includes: Obtain the starting point and ending point coordinates by selecting points on the map, entering coordinates, or querying the substation database. Receive add, delete, or sort operations on waypoints and obtain the sorted coordinates of waypoints; The channel path is divided into segments based on the starting point coordinates, the ending point coordinates, and the sorted waypoint coordinates. The selected channel path is segmented and written into the locked segment field, and the starting point coordinates, the ending point coordinates, the sorted waypoint coordinates, and the locked segment are used as the anchor node and the locked segment.

6. The intelligent planning and calculation method for power line corridors with multi-constraint hierarchical verification according to claim 5, characterized in that, The process of smoothing the unlocked segments of the candidate path coordinate sequence based on the editing operation and obtaining a compliance status includes: Receive operations for moving, adding, or deleting path inflection points in the candidate path coordinate sequence. Retain the coordinates of the path inflection points of the locked segments, and perform the operation on the path inflection points of the unlocked segments; The modified path coordinate sequence is obtained by smoothly fitting the unlocked segments based on the adjusted path inflection point coordinates. The corrected path coordinate sequence is compared with the global channel constraints, the forbidden set, and the restriction set, and the compliance status is written in green, yellow, or red according to the comparison result.

7. The intelligent planning and calculation method for power line corridors with multi-constraint hierarchical verification according to claim 6, characterized in that, The process of finalizing the compliance status and outputting the target power line corridor path coordinate sequence includes: A full verification is performed on the path length, tortuosity coefficient, administrative region, and crossing permission of the modified path coordinate sequence, generating a verification report including qualified items, warning items, and violation items; When the verification report includes a violation item corresponding to a red compliance status, the storage operation of the correction path coordinate sequence is intercepted; When the verification report does not include any violations corresponding to the red compliance status, the corrected path coordinate sequence is written into the compliance path set; By comparing the path length, tortuosity coefficient, number of crossing channel constraints, and compliance status of each path coordinate sequence in the compliant path set, the target power line channel path coordinate sequence is selected.

8. A power line corridor intelligent planning and calculation system with multi-constraint hierarchical verification, characterized in that, include: The constraint anchoring module is configured to read global channel constraints and point-line-plane channel constraint elements, form a prohibited set and a restricted set according to the crossing permissions of the point-line-plane channel constraint elements, and form planning input data with the obtained anchoring nodes and locked segments; The candidate path generation module is configured to generate a sequence of candidate path coordinates that avoid the prohibited entry set based on the planning input data, with path length, tortuosity coefficient and compliance score as optimization objectives; The editing and verification module is configured to smooth the unlocked segments of the candidate path coordinate sequence according to the editing operation to obtain the corrected path coordinate sequence, and compare the corrected path coordinate sequence with the global channel constraint, the forbidden set and the restriction set to obtain the compliance status. The final review and selection module is configured to review the compliance status, write the corrected path coordinate sequence without serious violations into the compliant path set, and output the target power line channel path coordinate sequence based on the compliant path set.

9. A computer device, comprising: At least one processor; The processor also includes a memory storing a computer program that can run on the processor, characterized in that the processor executes the program by performing the steps of the intelligent planning and calculation method for power line channels with multi-constraint hierarchical verification as described in any one of claims 1 to 7.

10. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, it performs the steps of the intelligent planning and calculation method for power line channels with multi-constraint hierarchical verification as described in any one of claims 1 to 7.

Images