A method and system for planning and designing drainage routes in airport flight areas
By defining the basic attributes of drainage line segments and collecting custom information, using the longest path route planning algorithm to plan and design the drainage route in the airport flight area, the problem of low design efficiency and accuracy in the existing technology is solved, and efficient and accurate drainage route design and system optimization are achieved.
Patent Information
- Application Number
- CN202411167954.1
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-23
- Publication Date
- 2025-04-11
- Estimated Expiration
- 2044-08-23
AI Technical Summary
The lack of effective tools and methods for airport drainage route planning in the prior art has led to low efficiency and accuracy in the design of drainage routes in the airport flight area, which mainly relies on manual design.
It provides a method and system for planning and design of drainage routes in the airport flight area. By defining the basic properties of drainage route segments, building a basic database of drainage routes, collecting custom information of inlets and outlets, using the longest path and route planning algorithm to plan routes and performing hierarchical numbers, supporting modification and adjustment of drainage route planning and design results.
It improves the efficiency and accuracy of the drainage route design in the airport flight area, optimizes the resource allocation of drainage system, reduces costs, reduces water flow resistance, improves drainage speed, reduces flooding risks, and improves the overall efficiency of the system.
Smart Images

Figure CN119066748B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of drainage route planning, and in particular to a method and system for planning and designing drainage routes in an airport flight area. Background Art
[0002] The infrastructure within the airport airfield is greatly affected by atmospheric precipitation (rain or snow), surface water (hillside or river floods, sea water) and groundwater. The airport airfield drainage system can eliminate or reduce the threat of intrusion of surface runoff inside and outside the airfield, and can quickly discharge the runoff inside the field to avoid erosion of soil areas and keep the roadbed dry. The airport airfield drainage system is composed of different types of pipes and other linear structures.
[0003] However, there is no related technology for airport drainage route planning and supporting analysis and design tools, and airport drainage route planning still mainly relies on manual design by professionals. Summary of the invention
[0004] In order to improve the design efficiency and accuracy of airport flight zone drainage routes and assist professionals to automatically complete drainage route planning and numbering definition, the present application provides an airport flight zone drainage route planning and design method, system, computer equipment and storage medium.
[0005] In the first aspect, the above-mentioned invention objective of the present application is achieved through the following technical solutions:
[0006] A method for planning and designing drainage routes in an airport flight area, the method comprising:
[0007] Define basic attributes of drainage line segments, and build a basic database of drainage routes based on the basic attributes of drainage line segments;
[0008] Collect the customized information of the water inlet / outlet, input the customized information of the water inlet / outlet into the drainage route basic database, and build a route planning and design base database;
[0009] Design a base database according to the route planning, and obtain a set of planning points;
[0010] Retrieving the route planning algorithm of the longest path, performing route planning based on the set of planning points and performing route level numbering, and obtaining a drainage route planning and design result;
[0011] When the drainage route planning and design result needs to be modified, in response to the modification instruction, the user-specified path information is obtained and the route planning algorithm of the specified path is called;
[0012] The route planning algorithm of the designated path is utilized to modify and adjust the drainage route planning and design result based on the user designated path information to obtain a final drainage route planning and design result.
[0013] By adopting the above technical solution, the basic attributes of the drainage line segment, such as length, diameter, material, slope, etc., are defined, and data standardization is achieved, providing a unified basis for subsequent data processing and analysis. At the same time, a basic database for drainage routes is built, so that the information of the entire drainage system can be systematically stored and managed, which is convenient for query, analysis and maintenance; custom information of inlets and outlets is collected, for example, custom information can include location, flow, importance level, etc., and it is input into the basic database of drainage routes, which increases the flexibility of the system and provides rich data support for subsequent route planning. The database makes the system have good scalability, and new data fields can be easily added or existing data can be updated in the future; the route planning algorithm of the longest path is used to plan the route for the set of planning points, and The hierarchical numbering can ensure that the design of the drainage route not only meets the requirements of drainage efficiency, but also facilitates subsequent maintenance and management. The hierarchical numbering helps to quickly locate the problem area and improve the emergency response speed. Through scientific route planning, the resource allocation of the drainage system can be optimized, such as the location and number of pump stations, inspection wells, pipelines, etc., thereby reducing costs and improving the overall efficiency of the system. Reasonable route planning can also reduce water flow resistance, increase drainage speed, and reduce the risk of waterlogging. In addition, when the drainage route planning and design results need to be modified, the system can respond to the modification instructions and call the corresponding route planning algorithm based on the path information specified by the user for modification and adjustment, making the system highly flexible and adaptable, able to cope with the changing needs in actual projects, and ensure that the drainage system is always in the optimal state. Based on this, by building a route planning and design base database and conducting scientific route planning, the system can provide decision makers with comprehensive and accurate data support. Designers can make more reasonable and scientific decisions based on these data. The construction of the drainage route basic database and the digital management of route planning and design can help promote information sharing and collaborative work between different departments, thereby improving the design efficiency and accuracy of the airport flight area drainage route.
[0014] In a preferred example, the present application can be further configured as follows: the basic attributes of the drainage line segment are defined, and a basic database of drainage routes is built according to the basic attributes of the drainage line segment, including:
[0015] Defining basic attributes of drainage line segments, wherein the basic attributes of drainage line segments include line segment type and geometric attributes;
[0016] The optional drainage line segment information is obtained, and based on the attribute framework represented by the basic attributes of the drainage line segment, the drainage line segment is drawn using the optional drainage line segment information to build a basic drainage route database.
[0017] By adopting the above technical solution, by defining the basic attributes of drainage segments, such as segment type and geometric attributes, such as length, width, height, slope, curvature, and start and end point coordinates, a unified standard is established for the description and recording of drainage segments, which helps to reduce data confusion and misunderstanding caused by different standards. The standardized attribute framework makes the management of drainage segments more standardized and facilitates subsequent data processing, analysis and maintenance. The detailed definition of geometric attributes enables each drainage segment to be accurately described, including key information such as its shape, size and position. Therefore, by building a basic database for drainage routes, the information of all drainage segments can be fully recorded, including their basic attributes, positional relationships and connection status, etc., to provide comprehensive data support for subsequent route planning, design, construction and maintenance; in addition, optional drainage Segment information refers to route information in the form of segments where drainage lines can be set up, which is determined by analyzing the road surface and subgrade conditions of the airport flight zone. For example, drainage ditches or culverts are usually set up on both sides of the taxiway, around the apron, on both sides of the runway, and at the end of the runway. In other words, the optional drainage segment information is all the drainage segments that may be set up for analysis. Therefore, among the drainage segments represented by the optional drainage segment information, only some of the drainage segments may appear in the final design results. In this way, based on the defined attribute framework, the drainage segments can be quickly drawn using the coordinate length and other information of the drainage segments represented by the optional drainage segment information, and a basic database for drainage routes can be established. Subsequently, the data in the established basic database for drainage routes can be used for route planning and design to ensure the uniformity, integrity and traceability of the data.
[0018] In a preferred example, the present application can be further configured as follows: the collecting of the customized information of the water inlet / outlet, inputting the customized information of the water inlet / outlet into the drainage route basic database, and building a route planning and design base database include:
[0019] Collecting customized information of water inlet / outlet, wherein the customized information of water inlet / outlet includes customized information of water outlet and customized information of water inlet, one customized information of water outlet corresponds to several customized information of water inlet, and one customized information of water outlet corresponds to one drainage route planning and design result;
[0020] The outlet / inlet custom information is input into the drainage route basic database, the endpoints of the drainage line segment are correspondingly set as the outlet / inlet, and the route number of the current drainage route is defined, and the outlet definition information, the inlet definition information, the confluence point information and the route number are obtained, and the route number corresponds to the name of the outlet definition information;
[0021] Based on the outlet definition information, inlet definition information, confluence point information and route number, a route planning and design base database is established.
[0022] By adopting the above technical solution, users can customize the inlet / outlet information, which greatly improves the flexibility and customization of drainage route planning and design. Because the drainage needs of different airports or different areas of the same airport may be different, these specific needs can be met more accurately through customized information; one outlet customized information corresponds to multiple inlet customized information, and one outlet customized information corresponds to a drainage route planning and design result, which corresponds to the subsequent longest path route planning algorithm, so that the drainage route composed of one outlet is planned and designed at a time, avoiding the chaos and conflict caused by planning multiple outlets at the same time, and making the planning of drainage routes more efficient. By centrally managing this information, multiple drainage route plans can be quickly generated, compared and optimized to determine the most preferred one; by defining the endpoints of the drainage line segment as the inlet / outlet and assigning route numbers, the planning and design results of the drainage route are more intuitive and visual, the planning and design of the drainage route is more standardized, and it helps designers to understand the layout and operation of the drainage system more clearly.
[0023] In a preferred example, the present application can be further configured as follows: the planning point set includes confluence point information and water inlet definition information.
[0024] By adopting the above technical solution, the planning point set includes confluence point information and inlet definition information, that is, the inlet definition information and the outlet definition information are separated. Because when planning and designing the drainage route, one outlet custom information corresponds to multiple inlet custom information, and one outlet custom information corresponds to one drainage route planning and design result. Therefore, the longest path route planning algorithm in the subsequent drainage route planning algorithm is to separate the outlet and the inlet in the longest path between a fixed point and several uncertain points. When planning and designing the drainage route, multiple possible drainage routes with several different inlets and outlets can be planned with a fixed outlet, making the planning and design process intuitive and concise, and the probability of error in the planning and design results is reduced, and the best option can be selected.
[0025] In a preferred example, the present application can be further configured as follows: the route planning algorithm of the longest path includes:
[0026] Using the drainage route definition in the route planning and design base database as a mapping basis, creating a main layer base map based on the planning point set on the basis of the mapping basis, and calculating the main layer longest path function based on the outlet definition information on the main layer base map through a depth-first search algorithm to complete the main layer route planning;
[0027] Based on the planned point set, the confluence points on the main drainage route are used as branch confluence points of the second-level drainage route in order from near to far, the branch confluence point farthest from the outlet is used as the current confluence point, and the other confluence points in the planned point set except the confluence points on the main route planning are used as the planned point set corresponding to the current branch confluence point;
[0028] Based on the current branch confluence point, using the depth-first search algorithm and the longest path function algorithm, under the constraints, the second-layer longest path function is calculated to complete the second-layer route planning corresponding to the current branch confluence point, and this cycle is repeated until the planning point set corresponding to the current branch confluence point is an empty set;
[0029] Return to the next confluence point of the main layer drainage route, and repeat the above operation until the route planning of all confluence points is completed, and number them based on the preset numbering rules to obtain the drainage route planning and design results.
[0030] By adopting the above technical solution, the drainage route planning is divided into the main layer and multiple layers, ensuring that the entire drainage system can be systematically planned and designed. The main layer route is the core, and the branch routes of each layer are gradually expanded to form a complete and hierarchical drainage network. The depth-first search algorithm and the longest path function algorithm are used for route planning, which can efficiently calculate the optimal or near-optimal drainage route. In addition, the drainage route planning is decomposed into multiple levels and steps, realizing the design concept of modular design, so that each level and step can be optimized and adjusted independently, improving the maintainability and scalability of the entire planning process. The drainage routes are hierarchically numbered according to the preset numbering rules, making the entire drainage system easier to manage and maintain. The management personnel can clearly understand the location, function and status of each drainage route, which is convenient for daily inspection, maintenance and troubleshooting. In addition, with the expansion of the airport scale and the increase in drainage needs, it can support subsequent expansion and upgrading, and can add new planning point sets and constraints on the existing basis to re-plan the route to meet new drainage needs.
[0031] In a preferred example, the present application can be further configured as follows: the route planning algorithm of the specified path includes:
[0032] The user-specified path information is set as a user-defined main layer drainage route, and a main layer base map where the user-defined main layer drainage route is located is obtained through Location algorithm matching;
[0033] If the user-defined main layer drainage route is inconsistent with the main layer drainage route in the main layer base map, the user-defined main layer longest path function is calculated based on the user-defined main layer drainage route through a depth-first search algorithm to complete the user-defined main layer route planning;
[0034] If the main layer drainage route defined by the user is consistent with the main layer drainage route in the main layer base map, the main layer drainage route in the main layer base map is retrieved, and the user-defined main layer longest path function is calculated based on the main layer drainage route in the main layer base map through a depth-first search algorithm to complete the main layer route planning;
[0035] Based on the user-defined main layer route or the main layer route, the depth-first search algorithm and the longest path function algorithm are used to complete the next level route planning until the route planning of all confluence points of the user-defined main layer route or the main layer route is completed, and numbered based on the preset numbering rules to obtain the final drainage route planning and design results.
[0036] By adopting the above technical solution, users are allowed to specify the main layer drainage route, so that the planning process is closer to the actual needs of users. Users can define the main layer drainage route based on their own experience and judgment, or based on specific scenarios and needs, when they judge that the planning results obtained by the route planning algorithm using the longest path are unreasonable, thereby improving user satisfaction with the planning results; when the user-defined main layer drainage route is inconsistent with the existing route in the main layer base map, the user-defined main layer longest path function is recalculated to complete the user-defined main layer route planning. This flexibility ensures that the algorithm can adapt to different user inputs and scenario changes, and ensures that it is based on the longest path; when the user-defined main layer drainage route is consistent with the main layer drainage route in the main layer base map, the algorithm will directly call the route in the main layer base map, avoiding unnecessary calculations, improving the efficiency of the algorithm, and reducing the waste of computing resources.
[0037] In the second aspect, the above invention objective of the present application is achieved through the following technical solutions:
[0038] A system for planning and designing drainage routes in an airport flight area, the system comprising:
[0039] A first database building module is used to define basic attributes of drainage line segments and build a drainage route basic database according to the basic attributes of the drainage line segments;
[0040] The second database building module is used to collect the customized information of the water inlet / outlet, input the customized information of the water inlet / outlet into the drainage route basic database, and build a route planning and design base database;
[0041] A planning point collection module, used to design a base database according to the route planning and obtain a planning point set;
[0042] The longest path calculation module is used to call the route planning algorithm of the longest path, perform route planning based on the set of planning points and perform route level numbering to obtain the drainage route planning and design result;
[0043] A modification instruction module, used for obtaining user-specified path information and calling a route planning algorithm for the specified path in response to a modification instruction when the drainage route planning design result needs to be modified;
[0044] The guidance path calculation module is used to modify and adjust the drainage route planning and design result based on the user-specified path information by using the route planning algorithm of the specified path to obtain the final drainage route planning and design result.
[0045] Optionally, the first database building module includes:
[0046] The attribute definition submodule is used to define the basic attributes of the drainage line segment, and the basic attributes of the drainage line segment include the line segment type and geometric attributes;
[0047] The first database building submodule is used to obtain optional drainage line segment information, draw drainage line segments based on the attribute framework represented by the basic attributes of the drainage line segments, and build a drainage route basic database using the optional drainage line segment information.
[0048] In the third aspect, the above invention objective of the present application is achieved through the following technical solutions:
[0049] A computer device comprises a memory, a processor and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above-mentioned airport flight area drainage route planning and design method when executing the computer program.
[0050] In a fourth aspect, the above-mentioned invention objective of the present application is achieved through the following technical solutions:
[0051] A computer-readable storage medium stores a computer program, which, when executed by a processor, implements the steps of the above-mentioned airport flight area drainage route planning and design method.
[0052] In summary, the present application includes at least one of the following beneficial technical effects:
[0053] 1. Define the basic attributes of drainage line segments, such as length, diameter, material, slope, etc., to achieve data standardization, provide a unified basis for subsequent data processing and analysis, and build a basic database for drainage routes so that the information of the entire drainage system can be systematically stored and managed, which is convenient for query, analysis and maintenance; collect custom information of inlets and outlets, for example, custom information can include location, flow, importance level, etc., and enter it into the basic database of drainage routes, which increases the flexibility of the system and provides rich data support for subsequent route planning. The database makes the system scalable, and new data fields can be easily added or existing data can be updated in the future; use the longest path route planning algorithm to plan the route for the set of planning points, and perform hierarchical editing. The number can ensure that the design of the drainage route not only meets the requirements of drainage efficiency, but also facilitates subsequent maintenance and management. The hierarchical numbering helps to quickly locate the problem area and improve the emergency response speed. Through scientific route planning, the resource allocation of the drainage system can be optimized, such as the location and number of pump stations, inspection wells, pipelines, etc., thereby reducing costs and improving the overall efficiency of the system. Reasonable route planning can also reduce water flow resistance, increase drainage speed, and reduce the risk of waterlogging. In addition, when the drainage route planning and design results need to be modified, the system can respond to the modification instructions and call the corresponding route planning algorithm based on the user-specified path information for modification and adjustment, making the system highly flexible and adaptable, able to cope with the changing needs in actual projects, and ensure that the drainage system is always in the optimal state. Based on this, by building a route planning and design base database and conducting scientific route planning, the system can provide decision makers with comprehensive and accurate data support. Designers can make more reasonable and scientific decisions based on these data. The construction of the drainage route basic database and the digital management of route planning and design can help promote information sharing and collaborative work between different departments, thereby improving the design efficiency and accuracy of the airport flight area drainage route.
[0054] 2. By defining the basic attributes of drainage segments, such as segment type and geometric attributes, such as length, width, height, slope, curvature, and start and end point coordinates, a unified standard is established for the description and recording of drainage segments, which helps to reduce data confusion and misunderstanding caused by different standards. The standardized attribute framework makes the management of drainage segments more standardized and facilitates subsequent data processing, analysis and maintenance. The detailed definition of geometric attributes enables each drainage segment to be accurately described, including key information such as its shape, size and position. Therefore, by building a basic drainage route database, the information of all drainage segments can be fully recorded, including their basic attributes, positional relationships and connection status, etc., providing comprehensive data support for subsequent route planning, design, construction and maintenance; in addition, optional drainage segment information Refers to the route information in the form of line segments where drainage lines can be set up, which is determined by analyzing the road surface and subgrade conditions of the airport flight area. For example, drainage ditches or culverts are usually set up on both sides of the taxiway, around the apron, on both sides of the runway, and at the end of the runway. In other words, the optional drainage line segment information is all the drainage line segments that may be set up in the analysis. Therefore, among the drainage line segments represented by the optional drainage line segment information, only some of the drainage line segments may appear in the final design results. In this way, based on the defined attribute framework, using the coordinate length and other information of the drainage line segments represented by the optional drainage line segment information, the drainage line segments can be quickly drawn and the drainage route basic database can be built. The data in the built drainage route basic database can be used for route planning and design in the future to ensure the unified integrity and traceability of the data;
[0055] 3. User-defined inlet / outlet information greatly improves the flexibility and customization of drainage route planning and design. Because the drainage needs of different airports or different areas of the same airport may be different, these specific needs can be met more accurately through customized information. One outlet customized information corresponds to multiple inlet customized information, and one outlet customized information corresponds to one drainage route planning and design result. Corresponding to the subsequent longest path route planning algorithm, the drainage route composed of one outlet is planned and designed at a time, avoiding the chaos and conflict caused by planning multiple outlets at the same time, and making the drainage route planning more efficient. By centrally managing this information, multiple drainage route plans can be quickly generated, compared and optimized to determine the best choice. By defining the endpoints of the drainage line segment as the inlet / outlet and assigning route numbers, the planning and design results of the drainage route are more intuitive and visual, the planning and design of the drainage route is more standardized, and it helps designers to understand the layout and operation of the drainage system more clearly. BRIEF DESCRIPTION OF THE DRAWINGS
[0056] Figure 1 This is a flowchart of an implementation of the airport flight area drainage route planning and design method in the embodiment of the present application;
[0057] Figure 2 This is a flowchart for implementing S10 of the airport flight area drainage route planning and design method in the embodiment of the present application;
[0058] Figure 3 is a flowchart for implementing S20 of the airport flight area drainage route planning and design method in the embodiment of the present application;
[0059] Figure 4 is a flowchart of the implementation of the route planning algorithm for the longest path in the embodiment of the present application;
[0060] Figure 5 is a flowchart of the implementation of the route planning algorithm for a specified path in an embodiment of the present application;
[0061] Figure 6 and Figure 7 is an example implementation diagram of a route planning algorithm for a specified path in an embodiment of the present application;
[0062] Figure 8 This is a principle block diagram of the airport flight area drainage route planning and design device in the embodiment of the present application;
[0063] Fig. 9 It is a diagram of the internal structure of a computer device in an embodiment of the present application. DETAILED DESCRIPTION
[0064] The following is combined with Figure 1-8 This application is described in further detail.
[0065] Airport drainage system: It is a drainage system composed of multiple drainage routes distributed on the airport pavement and soil surface area. Its function is to drain rainwater and melted snow from the airport in time, prevent or reduce surface water accumulation and erosion, and prevent surface water and groundwater from harming airport facilities.
[0066] Water inlet: It is the first facility or structure of the airport drainage system.
[0067] Outlet: It is the terminal facility or structure of the airport drainage system.
[0068] Drainage line segment: An independent line segment from a start point to an end point.
[0069] Drainage route: The collection of drainage line segments from an inlet to a branch confluence or outlet is a drainage route, and one inlet corresponds to one drainage route.
[0070] Drainage route: The set of drainage routes formed from different water inlets to the same water outlet is unified into a drainage route, and one water outlet corresponds to one drainage route.
[0071] Main line: Define the drainage route from a certain inlet to the outlet as the main line.
[0072] Branch line: Define the drainage route from a certain inlet to the branch confluence point as a branch line.
[0073] Branch confluence point: It is the end point where the branch line merges into the main line, it is the clamping point of the main line drainage segment, and serves as the outlet of the branch line.
[0074] In one embodiment, if Figure 1 As shown, the present application discloses a method for planning and designing drainage routes for an airport flight area, which specifically includes the following steps:
[0075] S10: Define the basic attributes of the drainage line segment, and build a basic database of the drainage route according to the basic attributes of the drainage line segment.
[0076] In this embodiment, the airport flight area drainage route planning and design method is applied to a planning analysis and design system, which includes three modules. The first module is used for the construction of basic information, including: the construction of drainage line segment basic data and the construction of drainage line segments; the second module is used for the construction of drainage route planning and design base, including the construction of water inlet, water outlet and route naming; the third module is used for route planning and automatic numbering design, including: the route planning scheme algorithm based on the longest path, the route planning scheme algorithm based on the specified path and the implementation of the route numbering scheme algorithm. The framework of the planning analysis and design system is that the first module for the construction of basic information is in the data layer, the second module for the construction of drainage route planning and design base is in the platform layer, and the third module for route planning and automatic numbering design is in the application layer.
[0077] Specifically, the basic domain object of the drainage route is the drainage line segment. Each drainage line segment is an independent line segment with a corresponding start and end point. When the end point of the previous line segment coincides with the start point of the next line segment, a confluence point is automatically formed between the two line segments. Therefore, the basic attributes of the drainage line segment are first defined, such as length, diameter, material, and slope. If the drainage line segment is an arc, the basic attributes of the drainage line segment also include attribute parameters such as the arc radius. After completing the definition of the basic attributes of the drainage line segment, the basic attribute parameter framework of the drainage line segment can be obtained. For example, when designing a drainage line segment somewhere in the airport flight area, the design of the drainage line segment can be realized by inputting the data of the defined basic attributes of the drainage line segment, including the coordinates of the design start and end points and the length.
[0078] When realizing the automatic planning and design of the drainage route of the airport flight area, the layout and coordinate position of the drainage route are mainly designed. Therefore, before the automatic planning and design of the drainage route of the airport flight area, the specific location of the airport flight area that can be used to set the drainage route can be analyzed by survey. For example, in a flat and wide area of the flight area, a straight drainage segment can be used. When it is necessary to bypass obstacles (such as navigation equipment, light towers, etc.) or to adapt to terrain changes, an arc drainage segment can be used. In areas with complex terrain or large drainage needs, a branch culvert network can be constructed. Based on this, the specific location of the flight area that can be used to set the drainage segment obtained by survey is analyzed and extracted. The specific coordinates and length of the drainage segment that can be set in the flight area, as well as the parameters such as the arc, can be used to complete the drawing and construction of the drainage segment that can be set in the flight area. In this way, in the subsequent planning and design, the drainage segment that can be set in the flight area can be analyzed, so as to determine the preferred drainage route using the drainage segment that can be set in the flight area. Therefore, based on the drainage segment that can be set in the flight area that has been drawn and constructed and the corresponding data, a drainage route basic database is built.
[0079] S20: Collect the customized information of the water inlet / outlet, input the customized information of the water inlet / outlet into the basic database of the drainage route, and build a base database for route planning and design.
[0080] Specifically, after completing the drawing and construction of the drainage line segment that can be set in the flight zone, since the design of the drainage route requires an inlet and a branch confluence point or an outlet, it is also necessary to collect the inlet / outlet custom information, that is, the outlet custom information and the inlet custom information. Similarly, the inlet / outlet custom information can also be obtained by surveying and analyzing the specific locations of the airport flight zone that can be used to set the inlet / outlet, thereby obtaining the inlet / outlet custom information; it should be noted that the defined inlet / outlet coincides with the endpoint of the drainage line segment;
[0081] The custom inlet / outlet information is input into the drainage route basic database. According to the custom inlet / outlet information, the endpoints of the drainage line segments corresponding to the custom inlet / outlet information in the drainage route basic database are defined as the inlet / outlet. Thus, some drainage line segments in the drainage route basic database will be converted into drainage routes, and some endpoints of drainage line segments will be converted into branch confluence points, and the attributes of drainage segments and drainage routes are defined in the drainage route basic database.
[0082] S30: Design a base database according to route planning and obtain a set of planning points.
[0083] Specifically, although the route planning and design base database already partially contains constructed drainage sections and drainage routes, these drainage sections and drainage routes are only drainage sections and drainage routes that can be set up in the airfield, and are not designed drainage sections and drainage routes. In addition, in the planning and design of the airport airfield drainage route, the water inlet, branch confluence point and water outlet are important parameters. In other words, only the determined water inlet, branch confluence point and water outlet are needed to complete the preliminary airport airfield drainage route planning and design. Therefore, according to the route planning and design base database, all the relevant information of the water inlet, branch confluence point and water outlet is extracted from it as a planning point set, which is a set of coordinate points used for airport airfield drainage route planning.
[0084] S40: Retrieve the route planning algorithm of the longest path, perform route planning based on the planning point set, perform route level numbering, and obtain a drainage route planning and design result.
[0085] Specifically, a preset longest path route planning algorithm is called up, and the main planning step of the longest path route planning algorithm is to find the longest route between a fixed point and multiple uncertain points. Therefore, based on the water inlet, branch confluence point and water outlet in the planning point set, the water outlet is taken as a fixed point, and the water inlet and branch confluence point are taken as uncertain points, and the drainage route planning design is realized through the longest path route planning algorithm.
[0086] S50: When the drainage route planning and design result needs to be modified, in response to the modification instruction, the user-specified path information is obtained and the route planning algorithm of the specified path is called.
[0087] Specifically, after obtaining the drainage route planning and design results, professional designers can verify the drainage route planning and design results. When the designers find that the design of a drainage route is unreasonable and needs to be modified, they can modify the drainage route. Therefore, when the drainage route planning and design results need to be modified, in response to the modification instruction, that is, the instruction information indicating the need to modify the current drainage route planning and design results, the user-specified path information, that is, the user-specified drainage route, is obtained, and the route planning algorithm for the specified path is called.
[0088] S60: using the route planning algorithm of the specified path, modifying and adjusting the drainage route planning and design result based on the path information specified by the user to obtain the final drainage route planning and design result.
[0089] Specifically, the route planning algorithm of the specified path is mainly based on the drainage route specified by the user, and re-plans and designs on the drainage route specified by the user, so that the final drainage route planning and design result includes the drainage route specified by the user. Therefore, using the route planning algorithm of the specified path, the construction of the user-specified drainage route is first completed with the user-specified drainage route, and the user-specified drainage route is fixed as an unchangeable route, and then re-planned and designed through algorithms such as the longest path route planning algorithm, so as to complete the modification and adjustment of the drainage route planning and design results and obtain the final drainage route planning and design results.
[0090] In one embodiment, if Figure 2 As shown, in step S10, the basic attributes of the drainage line segment are defined, and a basic database of the drainage route is built according to the basic attributes of the drainage line segment, including:
[0091] S11: Define the basic attributes of the drainage segment, which include segment type and geometric attributes.
[0092] Specifically, the basic attributes of the drainage line segment are defined, wherein the basic attributes of the drainage line segment include segment type and geometric attributes. The segment type includes two types: straight line segment and arc segment; the geometric attributes include length, radius, and start and end point coordinates.
[0093] S12: Obtain optional drainage line segment information, draw drainage line segments based on an attribute framework represented by basic attributes of the drainage line segments using the optional drainage line segment information, and build a basic drainage route database.
[0094] Specifically, the optional drainage line segment information is obtained, and on the attribute framework of the basic attribute representation of the drainage line segment, the corresponding data is extracted from the optional drainage line segment information and input into the attribute framework of the basic attribute representation of the drainage line segment, and then the drainage line segment is drawn according to the attribute framework of the basic attribute representation of the drainage line segment and the data in the attribute framework, thereby building a basic database for drainage routes.
[0095] In one embodiment, if Figure 3 As shown, in step S20, the customized information of the water inlet / outlet is collected, the customized information of the water inlet / outlet is input into the drainage route basic database, and the route planning and design base database is built, including:
[0096] S21: Collecting customized information of water outlet / inlet, the customized information of water outlet / inlet includes customized information of water outlet and customized information of water inlet, one customized information of water outlet corresponds to several customized information of water inlet, and one customized information of water outlet corresponds to one drainage route planning and design result.
[0097] Specifically, the customized information of the inlet / outlet is collected, wherein the customized information of the inlet / outlet includes the customized information of the outlet and the customized information of the inlet. One drainage route corresponds to one outlet, which is realized by specifying the endpoints of the drainage segment, and one drainage segment endpoint cannot be repeatedly specified as an outlet. One outlet can be planned to create a drainage route. In addition, one drainage route corresponds to multiple inlets, which is realized by specifying the endpoints of the drainage segment, and one drainage segment endpoint can be repeatedly specified as the inlet of different outlets. By specifying the inlet, a drainage route from the inlet to the outlet or branch confluence point can be planned and created.
[0098] S22: Input the custom information of the outlet / inlet into the drainage route basic database, set the endpoints of the drainage line segment as the outlet / inlet, and define the route number of the current drainage route, obtain the outlet definition information, inlet definition information, confluence point information and route number, and the route number corresponds to the name of the outlet definition information.
[0099] Specifically, the custom information of the inlet / outlet is input into the drainage route basic database. Through the custom information of the inlet / outlet, the endpoints of the drainage line segment are set as the inlet / outlet respectively. After the designation of the inlet / outlet is completed, the endpoints of the remaining drainage line segments will be automatically converted into branch confluence points if they meet the definition of branch confluence points. The route number of the current drainage route is then defined based on the preset numbering rules, thereby obtaining the outlet definition information, inlet definition information, confluence point information and route number. The route number corresponds to the name of the outlet definition information, that is, the route number is the name number of the outlet.
[0100] In addition, in addition to defining the route number of the current drainage route, the preset numbering rule is also used to define the numbering of each drainage route in the drainage route. For example, the route number of the drainage route is used as a prefix, and each outlet is named according to the route number. In the drainage route, each drainage route is numbered in sequence by level with the route number as a prefix, and a route tree is generated. Each drainage route is an independent hierarchical tree and an independent route number. For example, the numbering name rule of the first-level route (main line) is ${route number}-01, for example, A01, and the numbering name rule of the second-level and below to the i-level routes (branch lines) is ${route number}-${second-level sequence}-…-${i-level sequence}, for example, A02-1, A02-1-3, etc.
[0101] S23: Building a route planning and design base database based on the outlet definition information, the inlet definition information, the confluence point information and the route number.
[0102] Specifically, a route planning and design base database is established based on the outlet definition information, the inlet definition information, the confluence point information and the route number, as well as the drainage routes and drainage segments corresponding to the outlet definition information, the inlet definition information and the confluence point information.
[0103] In one embodiment, in step S30, the planning point set includes confluence point information and water inlet definition information.
[0104] Specifically, since each drainage route is an independent hierarchical tree and an independent route number, and each drainage route has only one fixed outlet, the confluence point information and the inlet definition information can be divided into a planning point set. When designing the drainage route, the planning point set is used for planning and design.
[0105] In one embodiment, if Figure 4 As shown, the route planning algorithm for the longest path includes:
[0106] S01: Use the drainage route definition in the route planning design base database as the basis for mapping, create a main layer base map based on the planning point set based on the mapping basis, and calculate the main layer longest path function based on the outlet definition information on the main layer base map through the depth-first search algorithm to complete the main layer route planning.
[0107] Specifically, the drainage route definition in the route planning design base database is used as the basis for mapping, and a main layer base map is created based on the planning point set on the basis of the mapping. The main layer base map includes all outlets, inlets and confluence points. Therefore, based on the outlet definition information on the main layer base map, a depth-first search algorithm is used to calculate the path distances from all inlet definitions and confluence points to the outlets, that is, the main layer longest path function is calculated to complete the main layer route planning.
[0108] S02: Based on the planned point set, the confluence points on the main drainage route are used as branch confluence points of the second-level drainage route in order from near to far, the branch confluence point farthest from the outlet is used as the current confluence point, and the other confluence points in the planned point set except the confluence points on the main route planning are used as the planned point set corresponding to the current branch confluence point.
[0109] Specifically, based on all the water inlets and confluence points in the planning point set, the confluence points on the main drainage route are sorted in order from near to far to obtain the first point set. The points in the first point set are used as branch confluence points of the second-level drainage route. At this time, according to the confluence points in order from near to far, the branch confluence point farthest from the water outlet is extracted as the current confluence point, and it is determined whether the sorting order of this point is less than the number of points in the first point set. When it is determined to be no, it means that the planning and design of all points in the first point set have been completed, that is, the planning and design of the current drainage route has been completed;
[0110] When the judgment is yes, the points in the planned point set that do not belong to the main drainage route, as well as the points on the drainage routes of each level of all the previous confluence points in order from near to far, are calculated and extracted as the second set, that is, the planned point set corresponding to the current branch confluence point.
[0111] S03: Based on the current branch confluence point, use the depth-first search algorithm and the longest path function algorithm to calculate the second-level longest path function under the constraints, complete the second-level route planning corresponding to the current branch confluence point, and repeat this cycle until the set of planned points corresponding to the current branch confluence point is an empty set.
[0112] Specifically, based on the current branch confluence point, it is determined whether the second set is an empty set. When it is determined that the second set is an empty set, that is, all points in the planning point set have been planned on the main layer drainage route and the drainage routes of each level of the previous confluence point, and there are no points that need to be planned and designed. Therefore, it means that the planning and design of the current drainage route has been completed at this time;
[0113] When it is determined that the second set is not an empty set, a second-layer base map is created based on the second set, and the depth-first search algorithm and the longest path function algorithm are used to calculate the second-layer longest path function under the constraints to complete the second-layer route planning corresponding to the current branch confluence point. This cycle is repeated until the planning point set corresponding to the current branch confluence point is an empty set. For example, after completing the second-layer route planning, the branch confluence point corresponding to the second-layer route is used as a fixed outlet, and the second-layer route is used as the main line. The above operation is repeated until the second set is determined to be an empty set. That is to say, after completing the route planning of one layer each time, the drainage route of that layer is used as the main line of the next layer.
[0114] Furthermore, in this embodiment, the constraint rule may be:
[0115] Constraint 1: The main line of the current layer is the drainage route of the branch confluence point farthest from the outlet or the branch confluence point serving as the outlet;
[0116] Constraint 2: The drainage routes of each layer are generated in order of distance from the outlet;
[0117] Constraint 3 The second set is all the confluence points except the points on the main layer drainage route and the points on the drainage routes of each level of all the preceding confluence points in order from near to far.
[0118] S04: Return to the next confluence point of the main layer drainage route, and repeat the above operation until the route planning of all confluence points is completed, and number them based on the preset numbering rules to obtain the drainage route planning and design results.
[0119] Specifically, the next confluence point of the main-layer drainage route is returned, and the above operation is repeated until the route planning of all confluence points on the main-layer drainage route corresponding to the current drainage route is completed. In addition, during the route planning process, the hierarchical numbering is performed based on the preset numbering rule. In this way, the automatic planning and automatic numbering of the drainage route are completed, and the drainage route planning and design results are obtained. The drainage route planning and design results can be expressed in various forms, for example, in the form of a route tree and the corresponding hierarchical numbering.
[0120] In one embodiment, if Figure 5 As shown, the route planning algorithm for the specified path includes:
[0121] S001: The user-specified path information is set as the user-defined main layer drainage route, and the main layer base map where the user-defined main layer drainage route is located is obtained through Location algorithm matching.
[0122] Specifically, the user-specified path information is set as the user-defined main-layer drainage route, that is, the main-layer drainage route of the level corresponding to the user-specified path in the drainage route planning and design results. Therefore, through Location algorithm matching, the level corresponding to the user-specified path information is determined, and the base map of the level corresponding to the user-specified path information is obtained as the main-layer base map.
[0123] S002: If the user-defined main layer drainage route is inconsistent with the main layer drainage route in the main layer base map, the user-defined main layer longest path function is calculated based on the user-defined main layer drainage route through the depth-first search algorithm to complete the user-defined main layer route planning.
[0124] Specifically, if the user-defined main layer drainage route is inconsistent with the main layer drainage route in the main layer base map, that is, the user-specified path and the original drainage route planning and design result are inconsistent with the main line of the level corresponding to the user-specified path, then the user-defined main layer longest path function is calculated based on the user-defined main layer drainage route through the depth-first search algorithm to complete the user-defined main layer route planning.
[0125] It is understandable that when it is determined that the user-defined main layer drainage route is inconsistent with the main layer drainage route in the main layer base map, the route planning algorithm of the longest path is subsequently used to re-plan and design based on the user-defined route.
[0126] S003: If the main layer drainage route defined by the user is consistent with the main layer drainage route in the main layer base map, the main layer drainage route in the main layer base map is retrieved, and the user-defined main layer longest path function is calculated based on the main layer drainage route in the main layer base map through the depth-first search algorithm to complete the main layer route planning.
[0127] Specifically, if the user-defined main layer drainage route is consistent with the main layer drainage route in the main layer base map, that is, the user-specified path is consistent with the main line of the original drainage route planning and design result at the level corresponding to the user-specified path, the main layer drainage route in the main layer base map is retrieved, and the user-defined main layer longest path function is calculated based on the main layer drainage route in the main layer base map through the depth-first search algorithm to complete the main layer route planning. That is, when the user proposes a modification, even if the route modified by the user is consistent with the main layer drainage route in the current main layer base map, the longest path route planning algorithm is used again for planning and design based on the user-defined route to ensure the accuracy of the drainage route planning and design results.
[0128] S004: Based on the user-defined main layer route or main layer route, use the depth-first search algorithm and the longest path function algorithm to complete the next level route planning until the user-defined main layer route or all confluence point route planning of the main layer route is completed, and number them based on the preset numbering rules to obtain the final drainage route planning and design results.
[0129] Specifically, when the user-defined main layer drainage route is inconsistent with the main layer drainage route in the main layer base map, the next level route planning is completed based on the user-defined main layer route, or, when the user-defined main layer drainage route is consistent with the main layer drainage route in the main layer base map, the main layer route is used to complete the next level route planning using the depth-first search algorithm and the longest path function algorithm, until the user-defined main layer route or all confluence point route planning of the main layer route is completed, and the level numbering is performed based on the preset numbering rule to obtain the final drainage route planning and design result.
[0130] like Figure 6 and Figure 7 As shown in the figure, the initial state is the initial drainage route planning and design result obtained by the route planning algorithm based on the longest path, state one is the drainage route planning and design result after one adjustment based on the route planning algorithm of the specified path, and state two is the drainage route planning and design result after a second adjustment based on the route planning algorithm of the specified path in state one.
[0131] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
[0132] In one embodiment, a system for planning and designing drainage routes for an airport flight zone is provided, and the system for planning and designing drainage routes for an airport flight zone corresponds one-to-one to the method for planning and designing drainage routes for an airport flight zone in the above embodiment. Figure 8 As shown, the airport flight area drainage route planning and design system includes a first database building module, a second database building module, a planning point collection module, a longest path calculation module, a modification instruction module and a guidance path calculation module. The detailed description of each functional module is as follows:
[0133] The first database building module is used to define the basic attributes of the drainage line segment and build a drainage route basic database according to the basic attributes of the drainage line segment;
[0134] The second database building module is used to collect the customized information of the water inlet / outlet, input the customized information of the water inlet / outlet into the drainage route basic database, and build the route planning and design base database;
[0135] The planning point collection module is used to design the base database according to the route planning and obtain the planning point collection;
[0136] The longest path calculation module is used to call the route planning algorithm of the longest path, perform route planning based on the planning point set and perform route level numbering to obtain the drainage route planning and design results;
[0137] A modification instruction module is used to obtain user-specified path information and call a route planning algorithm for the specified path in response to a modification instruction when the drainage route planning design result needs to be modified;
[0138] The guidance path calculation module is used to modify and adjust the drainage route planning and design results based on the user-specified path information using the route planning algorithm of the specified path to obtain the final drainage route planning and design results.
[0139] Optionally, the first database building module includes:
[0140] The attribute definition submodule is used to define the basic attributes of the drainage segment, which include segment type and geometric attributes;
[0141] The first database building submodule is used to obtain optional drainage line segment information, draw drainage line segments based on the attribute framework represented by the basic attributes of the drainage line segments, and build a basic drainage route database using the optional drainage line segment information.
[0142] Optionally, the second database building module includes:
[0143] A custom information collection submodule is used to collect the custom information of the water outlet / inlet. The custom information of the water outlet / inlet includes the custom information of the water outlet and the custom information of the water inlet. One custom information of the water outlet corresponds to several custom information of the water inlet, and one custom information of the water outlet corresponds to one drainage route planning and design result.
[0144] The database definition endpoint submodule is used to input the customized information of the water outlet / inlet into the drainage route basic database, set the endpoint of the drainage line segment as the water outlet / inlet, and define the route number of the current drainage route, obtain the water outlet definition information, the water inlet definition information, the confluence point information and the route number, and the route number corresponds to the name of the water outlet definition information;
[0145] The second database building submodule is used to build a route planning and design base database based on the outlet definition information, the inlet definition information, the confluence point information and the route number.
[0146] Optionally, the planning point set includes confluence point information and inlet definition information.
[0147] Optionally, the airport flight area drainage route planning and design system also includes:
[0148] The main line planning module is used to use the drainage line definition in the route planning design base database as the basis for mapping, create a main layer base map based on the planning point set on the basis of the mapping basis, and calculate the main layer longest path function based on the outlet definition information on the main layer base map through the depth-first search algorithm to complete the main layer route planning;
[0149] The confluence point set acquisition module is used to use the confluence points on the main layer drainage route as the branch confluence points of the second-level drainage route in order from near to far based on the planned point set, use the branch confluence point farthest from the outlet as the current confluence point, and use the other confluence points in the planned point set except the confluence points on the main layer route planning as the planned point set corresponding to the current branch confluence point;
[0150] The current confluence point planning module is used to calculate the second-layer longest path function based on the current branch confluence point using the depth-first search algorithm and the longest path function algorithm under the constraints, complete the second-layer route planning corresponding to the current branch confluence point, and cycle until the planning point set corresponding to the current branch confluence point is an empty set;
[0151] The confluence point loop planning module is used to return to the next confluence point of the main layer drainage route and loop the above operations until the route planning of all confluence points is completed, and the hierarchical numbering is performed based on the preset numbering rule to obtain the drainage route planning design results.
[0152] Optionally, the airport flight area drainage route planning and design system also includes:
[0153] The positioning module is used to set the user-specified path information as the user-defined main layer drainage route, and obtain the main layer base map where the user-defined main layer drainage route is located through Location algorithm matching;
[0154] The first main layer planning module is used to calculate the user-defined main layer longest path function based on the user-defined main layer drainage route through a depth-first search algorithm to complete the user-defined main layer route planning if the user-defined main layer drainage route is inconsistent with the main layer drainage route in the main layer base map;
[0155] The second main layer planning module is used to retrieve the main layer drainage route in the main layer base map if the main layer drainage route defined by the user is consistent with the main layer drainage route in the main layer base map, and calculate the user-defined main layer longest path function based on the main layer drainage route in the main layer base map through a depth-first search algorithm to complete the main layer route planning;
[0156] The loop planning module is used to complete the next level route planning based on the user-defined main layer route or main layer route using the depth-first search algorithm and the longest path function algorithm until the planning of all confluence point routes of the user-defined main layer route or main layer route is completed, and the level numbering is performed based on the preset numbering rule to obtain the final drainage route planning and design results.
[0157] The specific definition of the airport flight zone drainage route planning and design system can be found in the above definition of the airport flight zone drainage route planning and design method, which will not be repeated here. Each module in the above-mentioned airport flight zone drainage route planning and design system can be implemented in whole or in part by software, hardware and a combination thereof. The above-mentioned modules can be embedded in or independent of the processor in the computer device in the form of hardware, or can be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.
[0158] In one embodiment, a computer device is provided. The computer device may be a server, and its internal structure diagram may be as follows: Fig. 9As shown. The computer device includes a processor, a memory, a network interface and a database connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of the computer device is used to store a drainage route basic database, a route planning and design base database, a planning point set, a drainage route planning and design result and a final drainage route planning and design result. The network interface of the computer device is used to communicate with an external terminal through a network connection. When the computer program is executed by the processor, a method for planning and designing an airport flight area drainage route is implemented.
[0159] In one embodiment, a computer device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the following steps when executing the computer program:
[0160] Define the basic attributes of drainage segments, and build a basic database of drainage routes based on the basic attributes of drainage segments;
[0161] Collect the custom information of the inlet / outlet, input the custom information of the inlet / outlet into the drainage route basic database, and build the route planning and design base database;
[0162] Design the base database according to the route planning and obtain the set of planning points;
[0163] The route planning algorithm of the longest path is retrieved, the route is planned based on the set of planning points, and the route level is numbered to obtain the drainage route planning and design result;
[0164] When the drainage route planning and design result needs to be modified, in response to the modification instruction, the user-specified path information is obtained and the route planning algorithm of the specified path is called;
[0165] Utilize the route planning algorithm of the specified path, modify and adjust the drainage route planning and design results based on the user-specified path information, and obtain the final drainage route planning and design results.
[0166] In one embodiment, a computer readable storage medium is provided, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:
[0167] Define the basic attributes of drainage segments, and build a basic database of drainage routes based on the basic attributes of drainage segments;
[0168] Collect the custom information of the inlet / outlet, input the custom information of the inlet / outlet into the drainage route basic database, and build the route planning and design base database;
[0169] Design the base database according to the route planning and obtain the set of planning points;
[0170] The route planning algorithm of the longest path is retrieved, the route is planned based on the set of planning points, and the route level is numbered to obtain the drainage route planning and design result;
[0171] When the drainage route planning and design result needs to be modified, in response to the modification instruction, the user-specified path information is obtained and the route planning algorithm of the specified path is called;
[0172] Utilize the route planning algorithm of the specified path, modify and adjust the drainage route planning and design results based on the user-specified path information, and obtain the final drainage route planning and design results.
[0173] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be implemented by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.
[0174] Those skilled in the art will clearly understand that for the sake of convenience and brevity of description, only the division of the above-mentioned functional units and modules is used as an example. In actual applications, the above-mentioned functions can be distributed and completed by different functional units and modules as needed, that is, the internal structure of the system can be divided into different functional units or modules to complete all or part of the functions described above.
[0175] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.
Claims
1. A method for planning and designing drainage routes in an airport flight area, characterized in that: The airport flight area drainage route planning and design method comprises: Define the basic attributes of the drainage line segment, and build a basic database of the drainage route according to the basic attributes of the drainage line segment, including: Defining basic attributes of drainage line segments, wherein the basic attributes of drainage line segments include line segment type and geometric attributes; Obtain optional drainage line segment information, draw drainage line segments based on an attribute framework represented by basic attributes of the drainage line segments using the optional drainage line segment information, and build a drainage route basic database; Collect the customized information of the water inlet / outlet, input the customized information of the water inlet / outlet into the drainage route basic database, and build a route planning and design base database, including: Collecting customized information of water inlet / outlet, wherein the customized information of water inlet / outlet includes customized information of water outlet and customized information of water inlet, one customized information of water outlet corresponds to several customized information of water inlet, and one customized information of water outlet corresponds to one drainage route planning and design result; The outlet / inlet custom information is input into the drainage route basic database, the endpoints of the drainage line segment are correspondingly set as the outlet / inlet, and the route number of the current drainage route is defined, and the outlet definition information, the inlet definition information, the confluence point information and the route number are obtained, and the route number corresponds to the name of the outlet definition information; Building a route planning and design base database based on the outlet definition information, inlet definition information, confluence point information and route number; Design a base database according to the route planning, and obtain a set of planning points; Retrieving the route planning algorithm of the longest path, performing route planning based on the set of planning points and performing route level numbering, and obtaining a drainage route planning and design result; When the drainage route planning and design result needs to be modified, in response to the modification instruction, the user-specified path information is obtained and the route planning algorithm of the specified path is called; The route planning algorithm of the designated path is utilized to modify and adjust the drainage route planning and design result based on the user designated path information to obtain a final drainage route planning and design result.
2. The airport flight area drainage route planning and design method according to claim 1 is characterized in that: The planning point set includes confluence point information and water inlet definition information.
3. The airport flight area drainage route planning and design method according to claim 2 is characterized in that: The route planning algorithm of the longest path includes: Using the drainage route definition in the route planning and design base database as a mapping basis, creating a main layer base map based on the planning point set on the basis of the mapping basis, and calculating the main layer longest path function based on the outlet definition information on the main layer base map through a depth-first search algorithm to complete the main layer route planning; Based on the planned point set, the confluence points on the main drainage route are used as branch confluence points of the second-level drainage route in order from near to far, the branch confluence point farthest from the outlet is used as the current confluence point, and the other confluence points in the planned point set except the confluence points on the main route plan are used as the planned point set corresponding to the current branch confluence point; Based on the current branch confluence point, using the depth-first search algorithm and the longest path function algorithm, under the constraints, the second-layer longest path function is calculated to complete the second-layer route planning corresponding to the current branch confluence point, and this cycle is repeated until the planning point set corresponding to the current branch confluence point is an empty set; Return to the next confluence point of the main layer drainage route, and repeat the above operation until the route planning of all confluence points is completed, and number them based on the preset numbering rules to obtain the drainage route planning and design results.
4. The airport flight area drainage route planning and design method according to claim 3 is characterized in that: The route planning algorithm for the specified path includes: The user-specified path information is set as a user-defined main layer drainage route, and a main layer base map where the user-defined main layer drainage route is located is obtained through Location algorithm matching; If the user-defined main layer drainage route is inconsistent with the main layer drainage route in the main layer base map, the user-defined main layer longest path function is calculated based on the user-defined main layer drainage route through a depth-first search algorithm to complete the user-defined main layer route planning; If the main layer drainage route defined by the user is consistent with the main layer drainage route in the main layer base map, the main layer drainage route in the main layer base map is retrieved, and the user-defined main layer longest path function is calculated based on the main layer drainage route in the main layer base map through a depth-first search algorithm to complete the main layer route planning; Based on the user-defined main layer route or the main layer route, the depth-first search algorithm and the longest path function algorithm are used to complete the next level route planning until the route planning of all confluence points of the user-defined main layer route or the main layer route is completed, and numbered based on the preset numbering rules to obtain the final drainage route planning and design results.
5. An airport flight area drainage route planning and design system, characterized in that: The airport flight area drainage route planning and design system includes: The first database building module is used to define the basic attributes of the drainage line segment and build a drainage route basic database according to the basic attributes of the drainage line segment. The first database building module includes: The attribute definition submodule is used to define the basic attributes of the drainage line segment, and the basic attributes of the drainage line segment include the line segment type and geometric attributes; A first database building submodule is used to obtain optional drainage line segment information, draw drainage line segments based on an attribute framework represented by basic attributes of the drainage line segments, and build a drainage route basic database using the optional drainage line segment information; The second database building module is used to collect the customized information of the water inlet / outlet, input the customized information of the water inlet / outlet into the drainage route basic database, and build a route planning and design base database. The second database building module includes: A custom information collection submodule is used to collect the custom information of the water outlet / inlet. The custom information of the water outlet / inlet includes the custom information of the water outlet and the custom information of the water inlet. One custom information of the water outlet corresponds to several custom information of the water inlet, and one custom information of the water outlet corresponds to one drainage route planning and design result. The database definition endpoint submodule is used to input the customized information of the water outlet / inlet into the drainage route basic database, set the endpoint of the drainage line segment as the water outlet / inlet, and define the route number of the current drainage route, obtain the water outlet definition information, the water inlet definition information, the confluence point information and the route number, and the route number corresponds to the name of the water outlet definition information; The second database building submodule is used to build a route planning and design base database based on the outlet definition information, the inlet definition information, the confluence point information and the route number; A planning point collection module, used to design a base database according to the route planning and obtain a planning point set; The longest path calculation module is used to call the route planning algorithm of the longest path, perform route planning based on the set of planning points and perform route level numbering to obtain the drainage route planning and design result; A modification instruction module, used for obtaining user-specified path information and calling a route planning algorithm for the specified path in response to a modification instruction when the drainage route planning design result needs to be modified; The guidance path calculation module is used to modify and adjust the drainage route planning and design result based on the user-specified path information by using the route planning algorithm of the specified path to obtain the final drainage route planning and design result.
6. A computer device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the steps of the airport flight area drainage route planning and design method as described in any one of claims 1 to 4 are implemented.
7. A computer-readable storage medium storing a computer program, characterized in that: When the computer program is executed by a processor, the steps of the airport flight area drainage route planning and design method as described in any one of claims 1 to 4 are implemented.
Citation Information
Patent Citations
Drainage pipe network convergence path generation method and device based on Redis technology
CN114117708A