Method for generating urban public route network, electronic device and storage medium

Abstract

The present invention relates to the field of aviation transportation technology, and in particular to a method, electronic device, and storage medium for generating a public route network in an urban area. The method comprises: obtaining a key route network based on collected ground transportation road network and location information of several target building areas in a given urban area, deleting routes of aviation areas corresponding to any given type of area to obtain a first target route network, generating supplementary routes between each take-off and landing point and the corresponding nearest route, and using each take-off and landing point as a supplementary network node to obtain a second target route network, calculating the accessibility coefficient between each two network nodes in the second target route network, then calculating the single route cost between each two network nodes, and generating a public route network corresponding to the given urban area based on the single route cost between each two network nodes. The present invention can reasonably plan urban routes, minimize route costs, and improve transportation efficiency and flight safety.

Description

Technical Field

[0001] The present invention relates to the field of aviation traffic technology, and in particular to a method for generating an urban public air route network, electronic equipment and a storage medium. Background Art

[0002] With the development of modern cities, traffic congestion is becoming increasingly serious. Traditional ground transportation can no longer meet people's needs for fast travel. Therefore, low-altitude air transport has gradually attracted attention as an emerging mode of transportation. However, existing urban route planning methods still have many shortcomings. For example, some route plans simply randomly set routes above the city, resulting in a chaotic route distribution, which not only affects flight safety but also fails to achieve efficient transportation. Existing route planning methods fail to effectively identify and avoid restricted areas, which can easily lead to flight conflicts and safety hazards. Another more important problem is that they do not reasonably connect various take-off and landing points, resulting in the inability to directly connect some take-off and landing points, increasing the number of transfers and transportation costs.

[0003] In view of the above problems, the present invention provides a method for generating an urban public route network with low travel cost and high flight safety. Summary of the Invention

[0004] In response to the above technical problems, the present invention provides a method for generating an urban public route network, an electronic device and a storage medium, which can reasonably plan urban routes, minimize route costs and improve transportation efficiency and flight safety.

[0005] According to a first aspect of the present invention, a method for generating an urban public route network is provided, comprising the following steps:

[0006] Based on the collected ground transportation road network of a given urban area and the location information of several target building areas, an initial route network corresponding to the given urban area is generated, and each intersection of the initial route network is generated into a network node to obtain the key route network.

[0007] When any route in the critical route network passes through the aviation area corresponding to any given type of area, the route itself is deleted from the critical route network, and a first target route network is generated based on the remaining routes in the critical route network; any of the routes refers to a route between any two network nodes.

[0008] Based on the collected location information of each take-off and landing point in a given urban area, the closest route to each take-off and landing point is determined from the first target route network, and supplementary routes are generated between each take-off and landing point and the corresponding closest route and added to the first target route network. Each take-off and landing point is used as a supplementary network node to obtain the second target route network.

[0009] Calculate the accessibility coefficient between every two network nodes in the second target route network; the accessibility coefficient is the ratio of the route distance between any two network nodes to the ground navigation distance.

[0010] Based on the accessibility coefficient between each two network nodes, the cost of a single route between each two network nodes is calculated, and a public route network corresponding to a given urban area is generated based on the cost of a single route between each two network nodes. The cost of a single route between any two network nodes meets the following conditions:

[0011] C ij =L ij ×b ij ×ζ ij ×K x ×N g , where C ij is the single route cost between the i-th and j-th network nodes, L ij is the route distance between the i-th and j-th network nodes, b ij is the accessibility coefficient between the i-th and j-th network nodes, ζ ij for b ij The corresponding preset accessibility correction coefficient, K x is the preset positive constraint weight coefficient corresponding to the x-th facility type in the ground transportation network and several target building areas, N g is the preset negative constraint weight coefficient corresponding to the g-th type area among several preset safety hazard type areas.

[0012] According to a second aspect of the present invention, a non-transitory computer-readable storage medium is provided, wherein the storage medium stores at least one instruction or at least one program, and the at least one instruction or the at least one program is loaded and executed by a processor to implement the above-mentioned method for generating an urban public route network.

[0013] According to a third aspect of the present invention, there is provided an electronic device comprising a processor and the above-mentioned non-transitory computer-readable storage medium.

[0014] The present invention has at least the following beneficial effects:

[0015] The present invention provides a method for generating a public route network in an urban area. First, based on the collected location information of the ground transportation road network and several target building areas of a given urban area, a key route network is obtained in combination with intersections. Since the transportation road network and the target building areas often have fewer obstacles and less human activity, the location of the constructed routes is more ideal and has higher flight safety. Then, the routes of the aviation areas corresponding to any given type of area are deleted to obtain a first target route network, further reducing flight safety risks. Then, supplementary routes are generated between each take-off and landing point and the corresponding nearest route, and each take-off and landing point is used as a supplementary network node to obtain a second target route network. The accessibility coefficient between each two network nodes in the second target route network is calculated, and the single route cost between each two network nodes is calculated. Based on the single route cost between each two network nodes, a public route network corresponding to the given urban area is generated. In this way, direct navigation between each take-off and landing point can be achieved, urban routes can be rationally planned, the number of transfers and total transportation time can be reduced, the passage cost can be reasonably controlled, and resource utilization and operational efficiency can be maximized. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0017] Figure 1 This is a flow chart of a method for generating an urban public route network provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0018] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making any creative efforts shall fall within the scope of protection of the present invention.

[0019] The embodiment of the present invention provides a method for generating a public air route network in an urban area. Figure 1 As shown, the method includes the following steps:

[0020] S100, based on the collected ground traffic road network of a given urban area and the location information of several target building areas, an initial route network corresponding to the given urban area is generated, and each intersection of the initial route network is generated into a network node to obtain a key route network.

[0021] Furthermore, the target construction areas include but are not limited to rivers, green belts and parks. It can be understood that the target construction areas refer to areas with lower obstacles and less human activities.

[0022] Specifically, the initial route network corresponding to a given urban area is generated through the following steps:

[0023] S101, mapping the collected ground transportation road network of a given urban area into a route network to be processed.

[0024] S102: Based on the preset route drawing rules corresponding to each target building area and the location information of each target building area, the building area route is added to the corresponding location in the processed route network to generate an initial route network corresponding to the given urban area. For example, when the target building area is a river or a green belt, the corresponding preset route drawing rule is to draw the route along the length of the river or green belt. When the target building area is a park, the corresponding preset route drawing rule may be to draw the route along the length of the center of the park or to draw the route along both the length and width of the park.

[0025] As mentioned above, the route corresponding to each target building area is first drawn according to the preset route drawing rules corresponding to each target building area, and then the route network to be processed is supplemented according to the location information of the target building area, that is, the location information corresponding to the route in the route network to be processed to obtain the initial route network. Since the traffic road network and the above-mentioned building areas often have lower obstacles and less human activities, the location of the constructed route is more ideal and has higher flight safety.

[0026] S200, when any route in the critical route network passes through an aviation area corresponding to any given type of area, the route itself is deleted from the critical route network, and a first target route network is generated based on the remaining routes in the critical route network; any of the routes refers to a route between any two network nodes.

[0027] Furthermore, the given type of areas are pre-set areas that cannot be used to set routes, such as confidential areas, dangerous areas, etc.

[0028] S300, based on the collected location information of each take-off and landing point in a given urban area, determine the closest route to each take-off and landing point from the first target route network, and generate supplementary routes between each take-off and landing point and the corresponding closest route and add them to the first target route network, using each take-off and landing point as a supplementary network node to obtain a second target route network.

[0029] Furthermore, the supplementary route generated between the take-off and landing points and the corresponding nearest routes refers to a new route generated by connecting the take-off and landing points and the nearest routes according to the shortest path.

[0030] As mentioned above, by adding new routes, the take-off and landing points are integrated with the initial route network and connected by the shortest path, which can reduce flight costs and achieve efficient transportation.

[0031] S400, calculating the accessibility coefficient between every two network nodes in the second target route network; the accessibility coefficient is the ratio of the route distance between any two network nodes to the ground navigation distance; it can be understood that the ground navigation distance between two network nodes refers to the total length of the path when navigating from the ground position corresponding to one node to the ground position corresponding to the other node. Generally, the accessibility coefficient can be considered to be a value greater than 1.

[0032] S500: Based on the accessibility coefficient between each two network nodes, calculate the cost of a single route between each two network nodes, and generate a public route network corresponding to a given urban area based on the cost of a single route between each two network nodes; the cost of a single route between any two network nodes meets the following conditions:

[0033] C ij =L ij ×b ij ×ζ ij ×K x ×N g , where C ij is the cost of a single route between the i-th and j-th network nodes, L ij is the route distance between the i-th and j-th network nodes, b ij is the accessibility coefficient between the i-th and j-th network nodes, ζ ij for b ij The corresponding preset accessibility correction coefficient, K x is the preset positive constraint weight coefficient corresponding to the x-th facility type in the ground transportation network and several target building areas, N g is the preset negative constraint weight coefficient corresponding to the gth type of area among several preset safety hazard types. For example, a transportation network is the first facility type, and parks, green belts, and rivers are the second, third, and fourth facility types, respectively. Furthermore, the preset positive constraint weight coefficients corresponding to parks, green belts, and rivers are all between 0 and 1, and decrease in descending order.

[0034] Specifically, ij The value of b ij There is a positive correlation, where ζ ij The value range of is 0 to 1. In the specific implementation process, when the accessibility coefficient is larger, it means that the route distance is relatively longer, and the route cost is higher, so ζ can be used to calculate the distance between the two routes. ij The value of is increased to achieve reasonable adjustment of the cost of a single route between two network nodes.

[0035] Specifically, the preset safety hazard types include, but are not limited to, densely populated areas, airport-controlled airspace, and residential communities. Furthermore, the negative constraint weight coefficients corresponding to densely populated areas, residential communities, and airport-controlled airspace are all between 1 and 10, decreasing in order.

[0036] In a specific embodiment, generating a public route network corresponding to a given urban area based on the single route cost between every two network nodes includes the following steps:

[0037] S501 , for a plurality of routes between any two take-off and landing points, calculate a multi-route cost corresponding to any route between the two take-off and landing points based on a single route cost between every two network nodes.

[0038] Specifically, the multi-route cost corresponding to a route path refers to the sum of the single-route costs corresponding to several routes in the route path; it can be understood that: each route path is composed of several continuous routes; those skilled in the art know the process of obtaining each route path between any two take-off and landing points, for example, using the A star algorithm to obtain several route paths between two take-off and landing points, which will not be repeated here.

[0039] S502 : Determine the route path corresponding to the minimum multi-route cost corresponding to the two take-off and landing points as the target route path corresponding to the two take-off and landing points.

[0040] S503: Draw a route map based on all target route paths, and generate a minimum spanning tree based on the route map, so that the result of the minimum spanning tree is used as the public route network corresponding to the given urban area; the weight of any edge of the minimum spanning tree is the multi-route cost corresponding to any edge.

[0041] As mentioned above, we first determine the minimum route cost between every two take-off and landing points, and draw a route path map to minimize the transportation costs of several take-off and landing points in the route path map. On this basis, considering that if a route path is set between every two take-off and landing points, it will result in numerous routes and a high total cost, the minimum spanning tree method is used to determine a total route that can connect all take-off and landing points, realize direct navigation between each take-off and landing point, reduce the number of transfers and total transportation time, reasonably control the passage cost, and maximize resource utilization and operational efficiency.

[0042] In summary, the present invention provides a method for generating a public route network in an urban area. First, based on the collected location information of the ground transportation road network and several target building areas of a given urban area, a key route network is obtained in combination with the intersections. Since the transportation road network and the target building areas often have lower obstacles and less human activities, the location of the constructed route is more ideal and has higher flight safety. Then, the routes of the aviation area corresponding to any given type of area are deleted to obtain a first target route network, thereby further reducing the flight safety risks. Then, a supplementary route is generated between each take-off and landing point and the corresponding nearest route, and each take-off and landing point is used as a supplementary network node to obtain a second target route network. The accessibility coefficient between each two network nodes in the second target route network is calculated, and then the single route cost between each two network nodes is calculated. Based on the single route cost between each two network nodes, a public route network corresponding to the given urban area is generated. In this way, urban routes can be reasonably planned to maximize resource utilization and operational efficiency.

[0043] An embodiment of the present invention also provides a non-transitory computer-readable storage medium, which can be set in an electronic device to store at least one instruction or at least one program related to implementing a method in a method embodiment. The at least one instruction or the at least one program is loaded and executed by the processor to implement the urban public route network generation method provided in the above embodiment.

[0044] An embodiment of the present invention further provides an electronic device including a processor and the aforementioned non-transitory computer-readable storage medium.

[0045] Although some specific embodiments of the present invention have been described in detail by way of example, it should be understood by those skilled in the art that the above examples are for illustration only and are not intended to limit the scope of the present invention. It should also be understood by those skilled in the art that various modifications may be made to the embodiments without departing from the scope and spirit of the present invention. The scope of the present invention is defined by the appended claims.

Claims

1. A method for generating an urban public route network, characterized in that: The method comprises the following steps: Based on the collected ground transportation road network of a given urban area and the location information of several target building areas, an initial route network corresponding to the given urban area is generated, and each intersection of the initial route network is generated into a network node to obtain a key route network; When any route in the critical route network passes through an aviation area corresponding to any given type of area, the route itself is deleted from the critical route network, and a first target route network is generated based on the remaining routes in the critical route network; any of the routes refers to a route between any two network nodes; Based on the collected location information of each take-off and landing point within a given urban area, the closest route to each take-off and landing point is determined from the first target route network. Supplementary routes are generated between each take-off and landing point and the corresponding closest route and added to the first target route network. Each take-off and landing point is used as a supplementary network node to obtain a second target route network. Calculating the accessibility coefficient between every two network nodes in the second target route network; the accessibility coefficient is the ratio of the route distance between any two network nodes to the ground navigation distance; Based on the accessibility coefficient between each two network nodes, the cost of a single route between each two network nodes is calculated, and a public route network corresponding to a given urban area is generated based on the cost of a single route between each two network nodes. The cost of a single route between any two network nodes meets the following conditions: C ij =L ij ×b ij ×ζ ij ×K x ×N g , where C ij is the single route cost between the i-th and j-th network nodes, L ij is the route distance between the i-th and j-th network nodes, b ij is the accessibility coefficient between the i-th and j-th network nodes, ζ ij for b ij The corresponding preset accessibility correction coefficient, K x is the preset positive constraint weight coefficient corresponding to the x-th facility type in the ground transportation network and several target building areas, N g is a preset negative constraint weight coefficient corresponding to the g-th type area among several preset safety hazard type areas; The method of generating a public route network corresponding to a given urban area based on the cost of a single route between each two network nodes comprises the following steps: For any number of routes between any two take-off and landing points, the multi-route cost corresponding to any route between the two take-off and landing points is calculated based on the single-route cost between each two network nodes. The multi-route cost corresponding to a route path is the sum of the single-route costs corresponding to the several routes in the route path. Determine the route path corresponding to the minimum multi-route cost corresponding to the two take-off and landing points as the target route path corresponding to the two take-off and landing points; A route path diagram is drawn based on all target route paths, and a minimum spanning tree is generated based on the route path diagram, so that the result of the minimum spanning tree is used as the public route network corresponding to the given urban area; the weight of any edge of the minimum spanning tree is the multi-route cost corresponding to any edge.

2. The method for generating an urban public route network according to claim 1, characterized in that: The target construction areas include rivers, green belts and parks.

3. The method for generating an urban public route network according to claim 1, characterized in that: Generate the initial route network corresponding to a given urban area through the following steps: Draw the collected ground transportation road network of a given urban area into a route network to be processed; Based on the preset route drawing rules corresponding to each target building area and according to the location information of each target building area, the building area route is added to the corresponding position in the route network to be processed to generate an initial route network corresponding to the given urban area.

4. The method for generating an urban public route network according to claim 1, characterized in that: The given type areas are a number of pre-set areas that cannot be used to set routes.

5. The method for generating an urban public route network according to claim 1, characterized in that: ζ ij The value of b ij There is a positive correlation, where ζ ij The value range is 0 to 1.

6. A non-transitory computer-readable storage medium, wherein at least one instruction or at least one program is stored in the storage medium, characterized in that: The at least one instruction or the at least one program segment is loaded and executed by the processor to implement the method for generating an urban public route network according to any one of claims 1 to 5.

7. An electronic device, characterized in that: The device comprises a processor and the non-transitory computer-readable storage medium as claimed in claim 6.

Images