CN-121980836-A - Method, system, device, medium and program product for generating route in hillside area

CN121980836ACN 121980836 ACN121980836 ACN 121980836ACN-121980836-A

Abstract

The invention relates to the technical field of railway construction, in particular to a method, a system, equipment, a medium and a program product for generating a route in a hillside area. The method for generating the route in the compact slope area comprises the following steps of obtaining road route selection design standards and DEM grid elevation files of a research area, determining intelligent search parameters according to the road route selection design standards, generating a global feasible path tree from a starting point to an ending point, sequentially tracing back path nodes from the ending point to the starting point, carding out a feasible three-dimensional path set, and generating a corresponding plane-longitudinal plane route scheme by utilizing three-dimensional node coordinates of a single path. According to the invention, the multi-way tree line searching algorithm is used for constructing the global feasible path tree from the starting point to the end point, so that a research area is not required to be traversed, the data processing amount is reduced, the scheme generating efficiency is improved, and the generation of a feasible scheme can be ensured by restraining the road line selection design standard.

Inventors

XIE YI
GOU ZHIPING
YE JUNJIE
LIU WEI
DENG JUNQIAO
WANG JINYONG
TANG YI
TANG WENJIAN
ZHANG KEJUN
REN CHONG
Jiang Dengwei

Assignees

中铁二院工程集团有限责任公司

Dates

Publication Date: 20260505
Application Date: 20260409

Claims (10)

1. The generation method of the route in the tight slope area is characterized by comprising the following steps: s1, obtaining a road route selection design standard and a DEM grid elevation file of a research area; s2, determining intelligent search parameters according to the road route selection design standard, wherein the intelligent search parameters comprise search step length and search height difference; S3, selecting a route starting point grid on the DEM grid elevation file, setting the starting point grid as a first node layer of a multi-way tree, and generating a global feasible path tree from a starting point to a terminal point by utilizing the intelligent search parameters and a multi-way tree route search algorithm; s4, sequentially backtracking path nodes from the end point to the start point, carding out a feasible three-dimensional path set, and outputting a result file; S5, generating a corresponding plane-longitudinal plane route scheme by utilizing the three-dimensional node coordinates of the single path.
2. The method for generating a route in a hillside area according to claim 1, wherein the road route selection design criteria include road class, design speed, road plane design specification, and road longitudinal plane design specification; the road plane design specification comprises a plane circle curve minimum radius, a plane curve minimum length, a relaxation curve minimum length and a clamp straight line minimum length; the road longitudinal surface design specification comprises a maximum gradient, a maximum and minimum gradient section length, a minimum radius of a vertical curve, a minimum length of the vertical curve and a minimum clearance height of a road and a railway.
3. The method for generating a route in a tight slope region according to claim 2, wherein said S2 comprises: calculating a fixed line gradient according to the maximum gradient, the maximum gradient length and the minimum gradient length; determining a search step length; and calculating the searching height difference according to the routing gradient and the searching step length.
4. A method for generating a route in a hillside area according to claim 3, wherein in S3, using the intelligent search parameter and a multi-tree route search algorithm, generating a globally feasible path tree from a start point to an end point includes: s31, taking all nodes in the node layer as circle centers, taking the searching step length as a radius to make a circle, and obtaining the effective range of each node; S32, acquiring a target elevation contour corresponding to the current node layer by combining the search elevation difference with the DEM grid elevation file; S33, acquiring intersection points of the effective ranges of the nodes of the current node layer and the elevation contour lines of the corresponding targets of the current node layer, and generating a next node layer; S34, judging whether the difference value between the elevation line of the current node layer corresponding to the target elevation and the elevation of the end point is smaller than the searching elevation difference, if not, returning to S31 to process the next node layer, and if so, executing S35; And S35, summarizing the node layers, and connecting each node in the finally generated node layer with the end point to form the multi-path tree from the start point to the end point.
5. The method of claim 4, wherein in S33, the generating the next node layer includes: Acquiring intersection points of the effective ranges of the nodes of the current node layer and the elevation contour lines of the corresponding targets of the current node layer, and generating a sub-path node set; Detecting whether the connecting line of each sub path node and the father node in the sub path node set has an intersection point with the existing railway line or not, if so, interpolating the elevation of the intersection point with the railway by utilizing the elevation linearity of the sub path node and the father node, and obtaining the design elevation of the existing railway line at the intersection point, and detecting whether the difference value meets the clearance requirement or not by the difference between the interpolation elevation of the road and the design Gao Cheng of the railway; and aggregating the points in the same grid in the sub-path node set into one point.
6. The method for generating a route in a hillside area according to claim 5, wherein said S5 includes: s51, carrying out constraint detection on vertexes in an initial path, extracting characteristic points capable of reflecting initial line positions, and fitting a planar line scheme; S52, projecting the top point of the original path onto the plane line generated in S51 on the horizontal plane, taking the projection point as a slope changing point of the longitudinal plane scheme of the line, taking the mileage of the projection point as the mileage of the slope changing point, taking the elevation of the top point of the original path as the elevation of the projection point to the slope changing point, and fitting the longitudinal plane scheme.
7. A tight slope route generation system, comprising: the input unit is used for inputting the road route selection design standard and the three-dimensional information of the research area; a processing unit for generating a route plan according to a route generation method in a hillside area as defined in any one of claims 1 to 6; And the output unit is used for outputting the route scheme.
8. An electronic device comprising at least one processor and a memory communicatively coupled to the at least one processor, wherein the memory stores a computer program executable by the at least one processor to enable the at least one processor to perform a method of generating a compact slope zone route as claimed in any one of claims 1 to 6.
9. A computer readable storage medium, wherein the computer readable storage medium stores computer instructions for causing a processor to implement a method for generating a route in a hillside area according to any one of claims 1 to 6 when executed.
10. A computer program product, characterized in that the computer program product comprises a computer program which, when executed by a processor, implements a method of generating a route in a hillside region as claimed in any of claims 1-6.

Description

Method, system, device, medium and program product for generating route in hillside area Technical Field The invention relates to the technical field of railway construction, in particular to a method, a system, equipment, a medium and a program product for generating a route in a hillside area. Background Railway engineering is a linear engineering characteristic, and the design process involves intersecting with various structures along the line, so that the design of one line often has tens or even hundreds of cross engineering. In complex, tight slope terrain environments, crossover projects become exceedingly complex due to the extremely tight gallery. A tight slope region may refer to a region where the average natural longitudinal slope of the ground along the line direction is greater than or equal to the maximum limit slope employed by the railway line design. In the space linear design work of railways in tight slope areas, not only the strong restriction of steep terrains in mountain areas on design specifications, but also the clearance constraint at intersections with surrounding existing and planned and under-construction roads are considered. Therefore, how to quickly adjust the road engineering under the condition of meeting the related requirements of the railway engineering in the limited corridor is a difficult problem. The existing railway transfer road design is generally to manually read drawing information, then to apply interactive design software such as latitude software to carry out plane design and longitudinal section design, and has the defects of high calculation complexity, high labor intensity, long design period and the like. Disclosure of Invention The invention aims to solve the problems of complex calculation, time consumption, no consideration of railway clearance constraint and the like in the prior art, and provides a route generation method in a tight slope region. Firstly, the invention provides a method for generating a route in a tight slope region, which comprises the following steps: s1, obtaining a road route selection design standard and a DEM grid elevation file of a research area; s2, determining intelligent search parameters according to the road route selection design standard, wherein the intelligent search parameters comprise search step length and search height difference; S3, selecting a route starting point grid on the DEM grid elevation file, setting the starting point grid as a first node layer of a multi-way tree, and generating a global feasible path tree from a starting point to a terminal point by utilizing the intelligent search parameters and a multi-way tree route search algorithm; s4, sequentially backtracking path nodes from the end point to the start point, carding out a feasible three-dimensional path set, and outputting a result file; S5, generating a corresponding plane-longitudinal plane route scheme by utilizing the three-dimensional node coordinates of the single path. According to a preferred embodiment, the road route selection design criteria include road grade, design speed, road plane design specification and road longitudinal plane design specification. The road plane design specification comprises a plane circle curve minimum radius, a plane curve minimum length, a relaxation curve minimum length and a clamp straight line minimum length. The road longitudinal surface design specification comprises a maximum gradient, a maximum and minimum gradient section length, a minimum radius of a vertical curve, a minimum length of the vertical curve and a minimum clearance height of a road and a railway. According to a preferred embodiment the step S2 comprises calculating a routing gradient from the maximum gradient, the maximum gradient length and the minimum gradient length, determining a search step length, and calculating the search height difference from the routing gradient and the search step length. According to a preferred embodiment, in the step S3, using the smart search parameter and the multi-tree line search algorithm, a globally feasible path tree from a start point to an end point is generated, including: s31, taking all nodes in the node layer as circle centers, taking the searching step length as a radius to make a circle, and obtaining the effective range of each node. S32, acquiring a target elevation contour corresponding to the current node layer by combining the search elevation difference with the DEM grid elevation file. S33, acquiring the intersection point of the effective range of each node of the current node layer and the elevation contour line corresponding to the current node layer, and generating the next node layer. S34, judging whether the difference value between the elevation line of the current node layer corresponding to the target elevation and the elevation of the end point is smaller than the searching elevation difference, if not, returning to S31 to process the next node layer, and if so, exec