Bridge busy degree identification and bridge group operation and maintenance method and system

Abstract

The invention relates to a bridge busy degree identification and bridge group operation and maintenance method and system, an electronic device and a storage medium, all information of a bridge is integrated into a knowledge graph, unified management and standardization of the information are achieved, the accuracy and efficiency of information acquisition are improved, and subsequent operation and maintenance management decisions can be made conveniently. And secondly, by utilizing functions of correlation analysis, reasoning and the like of the knowledge graph, intelligent decision support can be provided for operation and maintenance management of the bridge, resource configuration is optimized, and the operation and maintenance efficiency is improved. By establishing the Thiessen polygon and dividing the importance degree of the bridge according to the traffic flow, the operation and maintenance work of the bridge can be more accurately focused on the key bridge, and the pertinence and effectiveness of the operation and maintenance work are improved. The traffic flow line between the bridges is analyzed through the knowledge graph, a scientific basis can be provided for regional traffic planning, the traffic layout is optimized, and the traffic management efficiency is improved.

Description

Technical Field

[0001] The present application relates to the field of traffic operation and maintenance management, and in particular to a bridge group operation and maintenance management method, system, computer equipment and computer-readable storage medium. Background Art

[0002] Ensuring the service safety of regional bridges is of great significance. It not only affects the smoothness and safety of the transportation network, but is also closely related to economic development, urban image and social welfare. As a key node in the transportation network, the safety and stability of bridges are directly related to the safety of public life and social order. Bridges play an important role in regional economic development. Good bridge operation and maintenance management can ensure efficient operation of traffic, reduce logistics costs, enhance regional competitiveness and promote economic development. At the same time, bridge beautification and lighting management can enhance the city's image and citizens' sense of belonging and pride.

[0003] Bridge operation and maintenance management is also related to the life of infrastructure, environmental impact and social welfare. Bridge damage or failure will lead to traffic disruption, economic losses, shorten the life of infrastructure and increase maintenance costs. Unreasonable operation and maintenance will also lead to traffic congestion and accidents, affecting the environment and society. In addition, effective operation and maintenance management also plays a key role in responding to natural disasters and emergencies.

[0004] However, regional bridge operation and maintenance management faces multiple difficulties, such as complex data collection and integration, and the need for professional knowledge in bridge condition assessment, which leads to poor efficiency and accuracy in the existing bridge group operation and maintenance management methods. Summary of the invention

[0005] The embodiments of the present application provide a method, system, computer device and computer-readable storage medium for identifying the busyness of bridges and operating and maintaining a group of bridges, so as to at least solve the problems of poor efficiency and accuracy in the operation and maintenance management of a group of bridges in the related art.

[0006] In a first aspect, an embodiment of the present application provides a method for identifying the busyness of a bridge, the method comprising:

[0007] According to the location information of each bridge in the target area, the target area is divided into a plurality of Thiessen polygons, wherein a discrete point of the Thiessen polygon corresponds to the location information of a bridge;

[0008] Based on the Thiessen polygon, obtain the reference trunk road corresponding to the internal bridge position and the intersection side length between the road where the bridge is located and the Thiessen polygon;

[0009] The weight parameters of each reference trunk road are obtained according to the attribute information of the reference trunk road, and the busyness information of the bridge in each Thiessen polygon is obtained based on the weight information and the intersection edge length.

[0010] In some embodiments, dividing the target area into a plurality of Thiessen polygons according to the location information of each bridge in the target area includes:

[0011] Obtain the location information of each bridge through the geographic information system;

[0012] Taking the location information as a node, creating a point layer corresponding to the target area and including nodes corresponding to all bridges;

[0013] The point layer is divided by using a Thiessen polygon creation tool to obtain a plurality of Thiessen polygons.

[0014] In some embodiments, obtaining a reference trunk road corresponding to the bridge based on the Thiessen polygon includes:

[0015] According to the Thiessen polygon, a road whose angle with the bridge is at a preset degree is obtained to obtain the reference trunk road.

[0016] In some embodiments, obtaining the weight parameter of each reference trunk road according to the attribute information of the reference trunk road includes:

[0017] Obtaining initial weight parameters of each reference trunk road according to the number of lanes of the reference trunk road;

[0018] The initial weight parameters are modified according to the road grade of the reference trunk roads to obtain the weight parameters of the respective reference trunk roads.

[0019] In some embodiments, based on the weight information and the intersection edge length, obtaining the busyness information of the bridges in each Thiessen polygon includes:

[0020] Perform weighted averaging on the intersecting side lengths based on the weight information to obtain side length information of the road where the bridge is located corresponding to the target Thiessen polygon;

[0021] According to the development degree of the sub-region corresponding to each Thiessen polygon, the side length information of the road where the bridge corresponding to each Thiessen polygon is located is corrected to obtain the busyness information of each bridge in the target area.

[0022] In a second aspect, an embodiment of the present application provides a bridge group operation and maintenance management method, the method comprising:

[0023] Acquire bridge information and road information in a target area, and establish a bridge knowledge graph based on the bridge information and road information;

[0024] Obtain busyness information of each bridge in the target area by the method described in the first aspect;

[0025] sorting the importance of each bridge based on the busyness information, and determining the key bridge based on the result of the importance sorting;

[0026] The knowledge graph is used to perform operation and maintenance management on all bridges in the target area, wherein the key bridges are focused on during the operation and maintenance management process, and when any bridge has a safety problem, the related bridges are located based on the association information between the bridges in the knowledge graph.

[0027] In some embodiments, obtaining bridge information and road information in a target area, and establishing a bridge knowledge graph based on the bridge information and road information includes:

[0028] Acquire bridge information and road information in the target area, wherein the bridge information includes: bridge name, bridge type, bridge length and bridge width, and the road information includes: road name, road length and number of road lanes;

[0029] The knowledge graph is constructed by taking the bridge as a node, the bridge information as the node attribute information, the road as the connection relationship between the nodes, and the attribute information of the road as the edge attribute information.

[0030] In a third aspect, an embodiment of the present application provides a bridge busyness identification system, the system comprising: a preprocessing module and a calculation module, wherein:

[0031] The preprocessing module is used to divide the target area into a plurality of Thiessen polygons according to the location information of each bridge in the target area, wherein a discrete point of the Thiessen polygon corresponds to the location information of a bridge;

[0032] The computing module is used to obtain, based on the Thiessen polygon, a reference trunk road corresponding to the internal bridge position and the intersection side length between the road where the bridge is located and the Thiessen polygon;

[0033] Furthermore, the weight parameters of each reference trunk road are obtained according to the attribute information of the reference trunk road, and the busyness information of the bridge in each Thiessen polygon is obtained based on the weight information and the intersection edge length.

[0034] In a fourth aspect, the embodiment of the present application further provides a bridge group operation and maintenance management system, the system comprising: a knowledge graph construction module and an operation and maintenance management module, wherein:

[0035] The knowledge graph construction module is used to obtain bridge information and road information in the target area, and to establish a bridge knowledge graph based on the bridge information and road information;

[0036] The operation and maintenance management module is used to obtain the busyness information of each bridge in the target area through the method described in any one of claims 1 to 5, and to sort the importance of each bridge based on the busyness information, and to determine the key bridge based on the result of the importance sorting;

[0037] Furthermore, the knowledge graph is used to perform operation and maintenance management on all bridges in the target area, wherein the key bridges are focused on during the operation and maintenance management process, and when any bridge has a safety problem, the related bridges are located based on the association information between the bridges in the knowledge graph.

[0038] In a fifth aspect, an embodiment of the present application provides a computer device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the method described in the first aspect above when executing the computer program.

[0039] In a sixth aspect, an embodiment of the present application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the method described in the first aspect above.

[0040] Compared with related technologies, the method for identifying the busyness of bridges and operating and maintaining a group of bridges provided in the embodiment of the present application realizes unified management and standardization of information by integrating various information of bridges into the knowledge graph, and improves the accuracy and efficiency of information acquisition, so as to facilitate subsequent operation and maintenance management decisions. Secondly, by utilizing the association analysis, reasoning and other functions of the knowledge graph, it is possible to provide intelligent decision-making support for the operation and maintenance management of bridges, optimize resource allocation, and improve operation and maintenance efficiency. By establishing Thiessen polygons and dividing the importance of bridges according to traffic flow, the operation and maintenance of bridges can be more accurately focused on key bridges, improving the pertinence and effectiveness of operation and maintenance work. By analyzing the traffic flow lines between bridges through the knowledge graph, a scientific basis can be provided for regional traffic planning, optimizing traffic layout and improving traffic management efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0042] Figure 1 is a flow chart of a method for identifying the busyness of a bridge according to an embodiment of the present application;

[0043] Figure 2 is a schematic diagram of a target area as multiple Thiessen polygons according to the present application;

[0044] Figure 3is a schematic diagram of a road condition within a Thiessen polygon according to an embodiment of the present application;

[0045] Figure 4 is another flow chart for calculating the busyness of a bridge according to an embodiment of the present application;

[0046] Figure 5 A flow chart of a bridge operation and maintenance management method according to an embodiment of the present application;

[0047] Figure 6 is a flow chart for constructing a knowledge graph according to an embodiment of the present application;

[0048] Figure 7 It is a schematic diagram of using a knowledge graph to perform bridge group operation and maintenance management according to an embodiment of the present application;

[0049] Figure 8 is a structural block diagram of a bridge busyness identification system according to an embodiment of the present application;

[0050] Fig. 9 is a structural block diagram of a bridge busyness identification system according to an embodiment of the present application;

[0051] Fig.10 It is a schematic diagram of the internal structure of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0052] In order to make the purpose, technical solutions and advantages of the present application clearer, the present application is described and illustrated below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. Based on the embodiments provided in the present application, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present application.

[0053] Obviously, the drawings described below are only some examples or embodiments of the present application. For ordinary technicians in this field, the present application can also be applied to other similar scenarios based on these drawings without creative work. In addition, it can also be understood that although the efforts made in this development process may be complicated and lengthy, for ordinary technicians in this field related to the content disclosed in this application, some changes in design, manufacturing or production based on the technical content disclosed in this application are just conventional technical means, and should not be understood as insufficient content disclosed in this application.

[0054] Reference to "embodiments" in this application means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those of ordinary skill in the art that the embodiments described in this application may be combined with other embodiments without conflict.

[0055] Unless otherwise defined, the technical terms or scientific terms involved in this application should be understood by people with ordinary skills in the technical field to which this application belongs. The words "one", "a", "a", "the" and the like involved in this application do not indicate a quantitative limitation, and may represent the singular or plural. The terms "include", "comprise", "have" and any of their variations involved in this application are intended to cover non-exclusive inclusions; for example, a process, method, system, product or device that includes a series of steps or modules (units) is not limited to the listed steps or units, but may also include steps or units that are not listed, or may also include other steps or units inherent to these processes, methods, products or devices. The words "connect", "connected", "coupled" and the like involved in this application are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. The "multiple" involved in this application refers to two or more. "And / or" describes the association relationship of associated objects, indicating that there may be three relationships, for example, "A and / or B" can represent: A exists alone, A and B exist at the same time, and B exists alone. The character " / " generally indicates that the objects before and after are in an "or" relationship. The terms "first", "second", "third", etc. involved in this application are only used to distinguish similar objects and do not represent a specific ordering of the objects.

[0056] Ensuring the service safety of regional bridges has far-reaching and significant significance. It is not only related to the smoothness and safety of the transportation network, but also closely linked to economic development, urban image and even social welfare. As a key node in the transportation network, the safety and stability of bridges are directly related to the safety of public life and social order. First of all, as an important part of transportation infrastructure, bridges play a vital role in the development of the regional economy. Good bridge operation and maintenance management can ensure the efficient operation of transportation, reduce logistics costs, enhance regional competitiveness, and inject strong impetus into economic development. At the same time, bridges are also the highlights of urban landscapes. Through management measures such as beautification and lighting, it can not only enhance the image and quality of the city, but also enhance the sense of belonging and pride of citizens.

[0057] Bridge operation and maintenance management is directly related to the life of infrastructure, environmental impact, and social welfare. Damage or failure of bridges will not only lead to traffic disruptions and economic losses, but also shorten the service life of infrastructure and increase maintenance and replacement costs. Unreasonable bridge operation and maintenance methods will cause traffic congestion, increase the probability of accidents, and have adverse effects on the environment and society. In addition, effective operation and maintenance management also plays a key role in responding to natural disasters and emergencies. By strengthening the operation and maintenance of bridges, we can prevent and respond to damage to bridges caused by natural disasters and emergencies in advance, reduce disaster losses, and ensure social stability and security.

[0058] However, it is difficult to manage the operation and maintenance of bridges in the entire region, mainly due to the following reasons: (1) Complexity of data collection and integration: Bridge operation and maintenance management involves the collection and integration of a large amount of data, including basic information of bridges, structural conditions, maintenance records, etc. These data may be scattered in different departments or systems, making it difficult to integrate them. (2) Professionalism of bridge condition assessment: Accurate assessment of the structural safety and service life of bridges requires professional knowledge. Lack of professional assessors or inaccurate assessment methods may affect the effectiveness of bridge operation and maintenance. (3) Limitation of maintenance funds and resources: Bridge maintenance requires a large amount of funds and resources, including maintenance costs, staff salaries, equipment procurement, etc. Under a limited budget, how to reasonably allocate resources to ensure that bridges are maintained in a timely and effective manner is a challenge. (4) Challenges in responding to emergencies: Bridges may encounter various emergencies during operation, such as natural disasters and traffic accidents. How to respond quickly and effectively to these events to reduce the impact on bridges and traffic is an important task of bridge operation and maintenance management.

[0059] In recent years, knowledge graphs have achieved rapid development. Knowledge graphs can integrate data from different sources, including structured data and unstructured data, and transform complex information into easy-to-understand machine-understandable knowledge. This integration helps to achieve unified management and integration of data, making it easier for users to obtain and use information. On this basis, by giving full play to its powerful relationship expression ability, compared with traditional databases, knowledge graphs can handle complex and diverse association analysis through graph theory and probabilistic graph models. They can not only represent direct relationships between entities, but also discover potential indirect relationships through reasoning, thereby meeting the analysis and management needs of various role relationships. In addition, knowledge graphs have good flexibility and scalability, and can be adjusted and expanded according to different scenarios and needs, explore the potential value of data according to actual conditions, and enrich the knowledge graph model without incurring too much additional costs.

[0060] In view of this, the present application scheme applies knowledge graphs to the operation and maintenance management of bridges in the region, and proposes a method for the operation and maintenance management of bridge groups in the region, which is used to manage bridges in the region by constructing a knowledge graph based on bridges and roads. In the constructed knowledge graph, each bridge is regarded as a node, which contains rich attribute information, such as detailed data such as bridge name, location, construction year, structural type, maintenance history, bearing capacity, safety level, etc.; roads are used as the relationship between connecting nodes to describe the spatial connection and traffic flow between bridges. On this basis, Thiessen polygons for bridges in the region are established, and the importance of bridges is divided according to the traffic flow in each area, so as to provide a reference for the operation and maintenance of regional bridges.

[0061] Figure 1 is a flow chart of a method for identifying the busyness of a bridge according to an embodiment of the present application. Figure 1 As shown, the process includes the following steps:

[0062] S101, dividing the target area into a plurality of Thiessen polygons according to the location information of each bridge in the target area, wherein a control point of a Thiessen polygon corresponds to the location information of a bridge;

[0063] The target area may be any geographical area, such as a city, a county, or multiple cities and counties;

[0064] In this embodiment, the location information of the bridge can be obtained through a geographic information system (GIS), which includes the latitude and longitude coordinates of each bridge. Specifically, the geographical location of the bridge can be represented by the coordinate points at both ends of the bridge;

[0065] It should be noted that Thiessen polygons, also known as Voronoi diagrams or Dirichlet diagrams, can divide a plane area into several polygons. Each polygon contains only one discrete point, and any position in the polygon is closest to the discrete point, and the distance to the discrete point in the adjacent polygon is farther.

[0066] Figure 2 is a schematic diagram of a target area according to the present application being a plurality of Thiessen polygons, such as Figure 2 As shown, 10 discrete points and their corresponding Thiessen polygons are shown. Figure 2 In the figure, any discrete point corresponds to the position of a bridge. In any polygon, the distance of any position relative to the discrete points inside the polygon is smaller than the distance relative to the discrete points of other polygons.

[0067] In this embodiment, optionally, the polygon division process can be implemented by the following steps:

[0068] Step 1, obtain the location information of each bridge through the geographic information system;

[0069] Among them, the location information needs to be converted into geographic coordinates (longitude and latitude) that can be recognized by GIS software;

[0070] Step 2, using the location information as nodes, create a point layer corresponding to the target area and containing all the corresponding nodes of the bridges;

[0071] Specifically, the coordinate data of the bridge is imported using the data import function of the GIS software; in the GIS software, a point layer is created based on the imported latitude and longitude coordinate data, and each point represents the location of a bridge.

[0072] Step 3, use the Thiessen polygon creation tool to divide the point layer and obtain multiple Thiessen polygons.

[0073] Among them, in GIS software, a special tool or plug-in is provided to generate Thiessen polygons. In this embodiment, the bridge point layer created in the above step Step 2 is used as input, and the Thiessen polygon generation tool is run to obtain multiple Thiessen polygons.

[0074] Specifically, the generated Thiessen polygon layer will show the potential service area of ​​each bridge, which can be used to evaluate the bridge's coverage, traffic flow distribution and other aspects.

[0075] S102, based on the Thiessen polygon, obtaining a reference trunk road corresponding to the internal bridge position and the intersection side length between the road where the bridge is located and the Thiessen polygon;

[0076] It should be noted that for long-span bridges, a dynamic weighing system is usually used to measure the traffic volume of passing vehicles, thereby evaluating the traffic congestion of the bridge. However, for most bridges, there is no dynamic weighing system, making it difficult to intuitively evaluate the traffic congestion.

[0077] In this embodiment, the service area of ​​each bridge is determined by dividing the Thiessen polygon. On the basis of the service area, a comprehensive weighted calculation is performed based on the attribute information of each road in the service area, the intersection length of the road where the bridge is located and the polygon, and the economic development level of the service area to obtain the road where the bridge is located and determine the traffic congestion level of the bridge.

[0078] Specifically, according to the Thiessen polygons, a road whose angle with the bridge is at a preset degree is obtained to obtain a reference trunk road; wherein the preset degree may be 10°.

[0079] It can be understood that in the service area corresponding to each Thiessen polygon, the trunk roads with an angle within 10° with the bridge are selected for statistics. These roads are approximately parallel to the bridges and are an important source of bridge traffic flow in the region. They usually share the traffic flow of the roads where the bridges are located. Therefore, counting these trunk roads can provide important data support for evaluating the busyness of the bridges.

[0080] In an exemplary embodiment, Figure 3 is a schematic diagram of a road condition within a Thiessen polygon according to an embodiment of the present application; Figure 3 As shown, each reference trunk road has two intersecting edges with the Thiessen polygon, among which the length of the intersecting edge on the right is 14, and three roads pass through this edge; the length of the intersecting edge on the left is 5, and two roads pass through this edge.

[0081] S103, obtaining weight parameters of each reference trunk road according to the attribute information of the reference trunk road, and obtaining busyness information of the bridges in each Thiessen polygon based on the weight information and the length of the intersecting edges.

[0082] Step 1, obtaining the weight parameters of each reference trunk road according to the attribute information of the reference trunk road;

[0083] Optionally, the initial weight parameters of each reference trunk road are obtained according to the number of lanes of the reference trunk road; Figure 3 As shown, road 1 is a two-lane road, road 2 is a four-lane road, and road 3 is a four-lane road; the weights of each road are 2, 4, and 4.

[0084] Furthermore, according to the road grade of the reference trunk road, the initial weight parameters are corrected to obtain the weight parameters of each reference trunk road; for example, according to the road access grade (mainly divided into expressways, first-class highways, second-class highways, third-class highways and fourth-class highways), each weight is corrected. The weight is reduced by half for each level of decrease in access grade. For example, if road 2 is a first-class highway, and road 1 and road 3 are both second-class highways, the weights of road 1, road 2 and road 3 are corrected to: 1, 4, 2 respectively.

[0085] Step 2, based on the weight information and the length of the intersecting edges, obtain the busyness information of the bridges in each Thiessen polygon;

[0086] In this embodiment, a weighted operation is performed based on the weight information and the intersecting side lengths to obtain a weighted average side length. The side length obtained by the weighted operation reflects the importance of the bridge in the road network and the size of the traffic flow. Specifically:

[0087] like Figure 3As shown, the length of the right intersecting side itself is 14. There are three roads on this side, and the weights of each road are 1, 4, and 2 respectively. After the weighted average operation 14*4 / (1+4+2)=8, the weighted side length on the right is 8; among them, "14" is the length of the right intersecting side, and "4" multiplied by 14 is the corrected weight parameter of Road 2 where the bridge is located. The denominator (1+4+2) is the sum of the corrected weights of all roads passing through this side.

[0088] The length of the intersecting side on the left is 5. There are two roads passing through this side, and the weights of each road are 1 and 4 respectively. After weighted average calculation, 5*4 / (1+4)=4, that is, the weighted side length on the left is 4; among them, "5" is the length of the intersecting side on the right, and "4" multiplied by 5 is the corrected weight parameter of road 2 where the bridge is located. The (1+4+2) in the denominator is the sum of the corrected weights of all roads passing through this side.

[0089] When calculating the weighted length corresponding to the bridge, the original side length is multiplied by the modified weight 4 of the road where the bridge is located to perform a weighted operation, which can reflect the influence of the road 2 where the bridge is located on this intersecting side length.

[0090] Furthermore, by multiplying the correction weight of road 2 and dividing by the sum of the correction weights of all roads passing through the edge, the relative contribution of road 2 to the intersecting edge in the service area can be obtained. This relative contribution value reflects the busyness of the bridge.

[0091] Furthermore, the total weighted value of the intersecting edge length corresponding to the bridge in its Thiessen polygon is 8+4=12. This weighted edge length value comprehensively considers the impact of the number of lanes, traffic grade and traffic flow of each road on the bridge. Therefore, it can effectively reflect the importance and busyness of the bridge in the entire transportation network.

[0092] Specifically, the selection of weight parameters in the present application solution is established according to the following specific method:

[0093] Among them, the number of lanes is a direct reflection of the road's carrying capacity. The more lanes there are, the greater the traffic flow that the road can carry. Therefore, in the weighted calculation, the number of lanes is used as an important weight factor;

[0094] For example, a two-lane road has a smaller weight (2). A four-lane road has a larger weight (4). By taking the number of lanes into account, we can ensure that roads with more lanes have a greater impact on how busy a bridge is.

[0095] In addition, different levels of roads have different design standards and traffic flows: expressways and first-class highways have high design standards and large traffic flows, so their weights remain the same or are higher. Second-class highways and below have low design standards and small traffic flows, so their weights will be reduced.

[0096] For example, when Road 2 is a first-class highway, its weight is kept as 4, while Road 1 and Road 3 are second-class highways, and their weights are modified to 1 and 2. This adjustment reflects the difference in the contribution of different grades of roads to bridge traffic flow.

[0097] By calculating the intersecting side lengths by weighted average, the combined impact of multiple roads can be comprehensively reflected. The calculation method provided in this embodiment ensures that roads with high weights (such as roads with many lanes and high grades) contribute more to the weighted length, thereby better reflecting the traffic pressure and busyness borne by the bridge.

[0098] In addition, it should be noted that, considering that the degree of regional economic development is often closely related to traffic flow, generally speaking, the higher the economic development of the region, the greater the traffic flow and the busier the traffic. Therefore, when calculating the weighted length of the bridge, the initially calculated intersecting edge length is corrected according to the degree of economic development of the service area corresponding to each Thiessen polygon, so that the result of the busyness calculation is more accurate.

[0099] For example: Assume Figure 3 The bridge in the figure is Bridge A, and the annual GDP of the area where the bridge is located is 20. There are two other bridges, Bridge B and Bridge C, and the annual GDP of the areas where Bridge B and Bridge C are located are 10 and 40 respectively. Then the weighted coefficients of the corresponding side lengths of Bridge A, Bridge B and Bridge C become 2, 1, and 4. Therefore, Figure 4 The corrected side length corresponding to bridge A in the middle becomes 24.

[0100] Figure 4 This is another flow chart for calculating the busyness of a bridge according to an embodiment of the present application.

[0101] Through the above steps S101 to S103, for bridges that lack a dynamic weighing system, the target area is divided into multiple Thiessen polygons to obtain the potential service area of ​​each bridge. The traffic flow and importance of the bridge and its surrounding roads are analyzed and managed in this area, which helps to simplify the analysis process of complex transportation networks and achieve more accurate and balanced traffic flow evaluation; further, the length of the road within the influence range of the bridge is combined with the number of its lanes, the road grade and the degree of regional economic development to obtain an indicator for comprehensively evaluating the bridge traffic flow. This indicator can reflect the comprehensive impact of the road on the bridge traffic flow, helping to more accurately perform traffic flow analysis and bridge operation and maintenance management.

[0102] On the other hand, the embodiment of the present application also provides a bridge group operation and maintenance management method, Figure 5 According to a flow chart of a bridge operation and maintenance management method according to an embodiment of the present application, as shown in Figure 5 The process includes the following steps:

[0103] S501, obtaining bridge information and road information in a target area, and establishing a bridge knowledge graph based on the bridge information and road information;

[0104] The target area may be any geographical area, such as a city, a county, or multiple cities and counties; optionally, data of all bridges and roads in the area may be collected through field research, data collection, and web crawlers, and the data obtained may include but are not limited to information such as bridge name, bridge type, bridge length, bridge width, road name, road length, and number of road lanes.

[0105] In addition, it is necessary to analyze the connection between bridges and roads and clarify the position and function of bridges in the road network. The relationship between the two bridges is established based on the road between the two bridges. For example, if Bridge A and Bridge B are both located on the same road, the relationship between the two bridges is 1. If there is a fork in the road leading from Bridge A to Bridge B, the relationship between the two bridges is determined based on the forked road and the number of lanes on the road.

[0106] Furthermore, a knowledge graph is constructed with bridges as nodes, bridge information as node attribute information, roads as connection relationships between nodes, and road attributes as edge attribute information.

[0107] Specifically, Figure 6 is a flowchart of constructing a knowledge graph according to an embodiment of the present application, such as Figure 6 As shown in the figure, the process specifically includes:

[0108] Step 1: Create knowledge graph nodes based on the collected data. Treat each bridge as a node and assign a unique identifier to each node, such as the name of the bridge. Assign the collected bridge information as attribute information to each node, such as bridge type, bridge length, bridge width, etc.

[0109] Step 2: In the knowledge graph, roads are used as the connection between bridges. The connection between bridges is clarified, for example, bridge A is connected to bridge B through a road, or bridge A and bridge B are parts of a road, etc.

[0110] Step 3: After clarifying the connection relationship between bridges and roads, all bridges are connected through road relationships to form a complete regional bridge knowledge graph. This knowledge graph will clearly show the distribution, connection relationship and attribute information of bridges in the region.

[0111] It should also be noted that as the region develops and the traffic capacity is improved, the nodes and relationship information in the graph need to be updated in real time. For example, when a new bridge is built or an old bridge is demolished, the node information in the knowledge graph is updated in a timely manner; when a road is rebuilt or expanded, the connection relationship between the road and the bridge is updated.

[0112] In addition, the construction of the knowledge graph relies on high-quality data support, so it is necessary to ensure that the collected bridge information is accurate and complete to avoid management errors caused by data errors or omissions. In the process of building and using the knowledge graph, attention should be paid to protecting the privacy and security of bridge information to avoid information leakage or illegal use. The knowledge graph should be coordinated with other bridge management systems or traffic management systems to achieve information sharing and interoperability and improve the overall management effect.

[0113] S502, obtaining the busyness information of each bridge in the target area through the bridge busyness identification method provided in the above steps S101 to S103; ranking the importance of each bridge based on the busyness information, and determining the key bridge based on the result of the importance ranking;

[0114] The specific implementation process of obtaining the busyness information in this step can refer to the specific execution of the above steps S101 to S103, so it will not be described in detail in this step.

[0115] S503, using the knowledge graph to perform operation and maintenance management on all bridges in the target area, with a focus on key bridges, and when any bridge has a safety problem, locate the relevant bridges based on the association information between bridges in the knowledge graph.

[0116] It can be understood that by establishing Thiessen polygons and dividing the importance of bridges according to traffic flow, the operation and maintenance of bridges can be more accurately focused on key bridges, improving the pertinence and effectiveness of operation and maintenance. This method ensures the rational allocation of resources, makes maintenance and management more efficient, reduces unnecessary investment, and can detect and solve potential problems earlier, ensuring the smoothness and safety of the transportation network.

[0117] also, Figure 7 It is a schematic diagram of using a knowledge graph to perform operation and maintenance management of a bridge group according to an embodiment of the present application.

[0118] Through the above steps S501 to S503, by integrating various information of the bridge into the knowledge graph, unified management and standardization of information are achieved, and the accuracy and efficiency of information acquisition are improved to facilitate subsequent operation and maintenance management decisions. Secondly, by utilizing the association analysis, reasoning and other functions of the knowledge graph, intelligent decision-making support can be provided for the operation and maintenance management of the bridge, resource allocation can be optimized, and operation and maintenance efficiency can be improved. By establishing Thiessen polygons and dividing the importance of bridges according to traffic flow, the operation and maintenance of bridges can be more accurately focused on key bridges, improving the pertinence and effectiveness of operation and maintenance work. By analyzing the traffic flow lines between bridges through knowledge graphs, a scientific basis can be provided for regional traffic planning, traffic layout can be optimized, and traffic management efficiency can be improved.

[0119] In a third aspect, this embodiment also provides a bridge busyness identification system. Figure 8 is a structural block diagram of a bridge busyness identification system according to an embodiment of the present application, such as Figure 8 As shown, the system includes: a pre-processing module 80 and an operation module 81, wherein:

[0120] The preprocessing module 80 is used to divide the target area into a plurality of Thiessen polygons according to the location information of each bridge in the target area, wherein a discrete point of a Thiessen polygon corresponds to the location information of a bridge;

[0121] The operation module 81 is used to obtain, based on the Thiessen polygon, the reference trunk road corresponding to the internal bridge position and the intersection length of the road where the bridge is located and the Thiessen polygon;

[0122] Furthermore, the weight parameters of each reference arterial road are obtained according to the attribute information of the reference arterial road, and the busyness information of the bridges in each Thiessen polygon is obtained based on the weight information and the intersection edge length.

[0123] Through this system, for bridges that lack dynamic weighing systems, the target area is divided into multiple Thiessen polygons to obtain the potential service area of ​​each bridge. The traffic flow and importance of the bridge and its surrounding roads are analyzed and managed in this area, which helps to simplify the analysis process of complex transportation networks and achieve more accurate and balanced traffic flow assessment; further, the length of the road within the influence range of the bridge is combined with the number of its lanes, road grade and regional economic development level to obtain an indicator for comprehensive assessment of bridge traffic flow. This indicator can reflect the comprehensive impact of the road on the bridge traffic flow, helping to more accurately perform traffic flow analysis and bridge operation and maintenance management.

[0124] In a fourth aspect, the present application also provides a bridge group operation and maintenance management system. Fig. 9 is a structural block diagram of a bridge busyness identification system according to an embodiment of the present application, such as Fig. 9 As shown, the system includes: a knowledge graph construction module 90 and an operation and maintenance management module 91, wherein:

[0125] The knowledge graph construction module 90 is used to obtain bridge information and road information in the target area, and to establish a bridge knowledge graph based on the bridge information and road information;

[0126] The operation and maintenance management module 91 is used to obtain the busyness information of each bridge in the target area through the method of any one of claims 1 to 5, and to sort the importance of each bridge based on the busyness information, and to determine the key bridge based on the result of the importance sorting;

[0127] In addition, the knowledge graph is used to perform operation and maintenance management of all bridges in the target area. During the operation and maintenance management process, key bridges are focused on, and when any bridge has a safety problem, the relevant bridges are located based on the correlation information between bridges in the knowledge graph.

[0128] Through this system, by integrating various information of bridges into the knowledge graph, unified management and standardization of information are achieved, and the accuracy and efficiency of information acquisition are improved to facilitate subsequent operation and maintenance management decisions. Secondly, by utilizing the association analysis, reasoning and other functions of the knowledge graph, intelligent decision-making support can be provided for the operation and maintenance management of bridges, resource allocation can be optimized, and operation and maintenance efficiency can be improved. By establishing Thiessen polygons and dividing the importance of bridges according to traffic flow, the operation and maintenance of bridges can be more accurately focused on key bridges, improving the pertinence and effectiveness of operation and maintenance work. By analyzing the traffic flow lines between bridges through knowledge graphs, a scientific basis can be provided for regional traffic planning, traffic layout can be optimized, and traffic management efficiency can be improved.

[0129] This embodiment further provides an electronic device, including a memory and a processor, wherein the memory stores a computer program, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.

[0130] Optionally, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0131] S1, divide the target area into multiple Thiessen polygons according to the location information of each bridge in the target area;

[0132] S2, based on the Thiessen polygon, obtain the reference trunk road corresponding to the internal bridge position and the intersection edge length between the road where the bridge is located and the Thiessen polygon;

[0133] S3, obtaining weight parameters of each reference trunk road according to the attribute information of the reference trunk road, and obtaining busyness information of the bridges in each Thiessen polygon based on the weight information and the length of the intersecting edges.

[0134] It should be noted that the specific examples in this embodiment can refer to the examples described in the above embodiments and optional implementation modes, and this embodiment will not be described in detail here.

[0135] In one embodiment, Fig.10 is a schematic diagram of the internal structure of an electronic device according to an embodiment of the present application, such as Fig.10 As shown, an electronic device is provided, which may be a server, and its internal structure diagram may be as shown in Fig.10 As shown. The electronic device includes a processor, a network interface, an internal memory and a non-volatile memory connected through an internal bus, wherein the non-volatile memory stores an operating system, a computer program and a database. The processor is used to provide computing and control capabilities, the network interface is used to communicate with an external terminal through a network connection, the internal memory is used to provide an environment for the operation of the operating system, the computer program is executed by the processor to implement a bridge busyness identification and bridge group operation and maintenance method, and the database is used to store data.

[0136] Those skilled in the art will understand that Fig.10 The structure shown in the figure is merely a block diagram of a partial structure related to the scheme of the present application, and does not constitute a limitation on the electronic device to which the scheme of the present application is applied. Specifically, the electronic device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0137] In addition, in combination with the adaptive evolution warning method for abnormal traffic behavior in the above embodiment, the embodiment of the present application can provide a storage medium for implementation. The storage medium stores a computer program; when the computer program is executed by the processor, any one of the bridge busyness identification and bridge group operation and maintenance methods in the above embodiment is implemented.

[0138] In one embodiment, a computer program product is provided, including a computer program, characterized in that when the computer program is executed by a processor, any one of the bridge busyness identification and bridge group operation and maintenance methods in the above embodiments is implemented.

[0139] Those skilled in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed 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 can 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. As an 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).

[0140] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0141] The above-mentioned embodiments only express several implementation methods of the present application, and the descriptions thereof are relatively specific and detailed, but they cannot be understood as limiting the scope of the invention patent. It should be pointed out that, for a person of ordinary skill in the art, several variations and improvements can be made without departing from the concept of the present application, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application shall be subject to the attached claims.

Claims

1. A method for identifying the busyness of a bridge, characterized in that: The method comprises: According to the location information of each bridge in the target area, the target area is divided into a plurality of Thiessen polygons, wherein a discrete point of the Thiessen polygon corresponds to the location information of a bridge; Based on the Thiessen polygon, obtain the reference trunk road corresponding to the internal bridge position and the intersection side length between the road where the bridge is located and the Thiessen polygon; The weight parameters of each reference trunk road are obtained according to the attribute information of the reference trunk road, and the busyness information of the bridge in each Thiessen polygon is obtained based on the weight information and the intersection edge length.

2. The method according to claim 1, characterized in that According to the location information of each bridge in the target area, the target area is divided into a plurality of Thiessen polygons including: Obtain the location information of each bridge through the geographic information system; Taking the location information as a node, creating a point layer corresponding to the target area and including nodes corresponding to all bridges; The point layer is divided by using a Thiessen polygon creation tool to obtain a plurality of Thiessen polygons.

3. The method according to claim 1, characterized in that Based on the Thiessen polygon, obtaining a reference trunk road corresponding to the bridge includes: According to the Thiessen polygon, a road whose angle with the bridge is at a preset degree is obtained to obtain the reference trunk road.

4. The method according to claim 3, characterized in that Acquiring weight parameters of each reference trunk road according to the attribute information of the reference trunk road includes: Obtaining initial weight parameters of each reference trunk road according to the number of lanes of the reference trunk road; The initial weight parameters are modified according to the road grade of the reference trunk roads to obtain the weight parameters of the respective reference trunk roads.

5. The method according to any one of claims 1 to 4, characterized in that: Based on the weight information and the intersection edge length, the busyness information of the bridge in each Thiessen polygon is obtained, including: Perform weighted averaging on the intersecting side lengths based on the weight information to obtain side length information of the road where the bridge is located corresponding to the target Thiessen polygon; According to the development degree of the sub-region corresponding to each Thiessen polygon, the side length information of the road where the bridge corresponding to each Thiessen polygon is located is corrected to obtain the busyness information of each bridge in the target area.

6. A bridge group operation and maintenance management method, characterized in that: The method comprises: Acquire bridge information and road information in a target area, and establish a bridge knowledge graph based on the bridge information and road information; Obtaining busyness information of each bridge in the target area by the method described in any one of claims 1 to 5; sorting the importance of each bridge based on the busyness information, and determining the key bridge based on the result of the importance sorting; The knowledge graph is used to perform operation and maintenance management on all bridges in the target area, wherein the key bridges are focused on during the operation and maintenance management process, and when any bridge has a safety problem, the related bridges are located based on the association information between the bridges in the knowledge graph.

7. The method according to claim 6, characterized in that Acquiring bridge information and road information in a target area, and establishing a bridge knowledge graph based on the bridge information and road information includes: Acquire bridge information and road information in the target area, wherein the bridge information includes: bridge name, bridge type, bridge length and bridge width, and the road information includes: road name, road length and number of road lanes; The knowledge graph is constructed by taking the bridge as a node, the bridge information as the node attribute information, the road as the connection relationship between the nodes, and the attribute information of the road as the edge attribute information.

8. A bridge busyness identification system, characterized in that: The system comprises: a preprocessing module and a computing module, wherein: The preprocessing module is used to divide the target area into a plurality of Thiessen polygons according to the location information of each bridge in the target area, wherein a discrete point of the Thiessen polygon corresponds to the location information of a bridge; The computing module is used to obtain, based on the Thiessen polygon, a reference trunk road corresponding to the internal bridge position and the intersection side length between the road where the bridge is located and the Thiessen polygon; Furthermore, the weight parameters of each reference trunk road are obtained according to the attribute information of the reference trunk road, and the busyness information of the bridge in each Thiessen polygon is obtained based on the weight information and the intersection edge length.

9. A bridge group operation and maintenance management system, characterized in that: The system includes: a knowledge graph construction module and an operation and maintenance management module, wherein: The knowledge graph construction module is used to obtain bridge information and road information in the target area, and to establish a bridge knowledge graph based on the bridge information and road information; The operation and maintenance management module is used to obtain the busyness information of each bridge in the target area through the method described in any one of claims 1 to 5, and to sort the importance of each bridge based on the busyness information, and to determine the key bridge based on the result of the importance sorting; Furthermore, the knowledge graph is used to perform operation and maintenance management on all bridges in the target area, wherein the key bridges are focused on during the operation and maintenance management process, and when any bridge has a safety problem, the related bridges are located based on the association information between the bridges in the knowledge graph.

10. 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 method according to any one of claims 1 to 7 is implemented.

11. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 7 is implemented.

Images