Comprehensive pipe gallery information integration and sharing platform
Through the model diagram construction, graph level optimization and load prediction module of the integrated pipeline information integration and sharing platform, the problem of inaccurate data management and power load prediction in traditional technology is solved, efficient data management and power allocation are achieved, and improved Operational efficiency and reliability of urban infrastructure.
Patent Information
- Application Number
- CN202411022534.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-29
- Publication Date
- 2024-11-15
- Estimated Expiration
- Not applicable · inactive patent
AI Technical Summary
Traditional information processing technology lacks efficient data structure management and real-time update capabilities in urban infrastructure management, resulting in reduced decision-making and response timeliness, inaccurate power load prediction, and serious problems of waste of resources and supply interruptions.
Adopt the integrated pipeline information integration and sharing platform, and use model diagram construction module, graph hierarchical optimization module and load prediction and allocation module to convert three-dimensional model data into graph structure data set, optimize hierarchical structure, dynamic rendering decisions, predict power demand and adjust Load, achieves the accuracy of data management and power allocation.
It improves the efficiency and responsiveness of data management, ensures reasonable allocation of resources, significantly improves the reliability and efficiency of power management, and reduces urban operation risks and costs.
Smart Images

Figure CN118966428A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of information processing technology, and in particular to an information integration and sharing platform for a comprehensive pipe gallery. Background Art
[0002] The field of information processing technology covers various methods and processes used by electronic devices and software systems to process, store, transmit, retrieve and manipulate data. This field focuses on optimizing data circulation and information management to support operational efficiency in a variety of industries. Key parts of the technology field include database management systems, data analysis, automation tools, artificial intelligence algorithms, and data security and privacy protection measures. In addition, the development of information processing technology has also promoted the application of big data and cloud computing, enabling organizations to process large-scale data sets more effectively to support decision making and resource management.
[0003] Among them, the integrated pipe gallery information integration and sharing platform refers to the use of information technology to integrate and share data from various facilities (such as cables, pipelines and other infrastructure) in the city's underground pipe gallery system. The main purpose of the platform is to improve the management efficiency and response speed of urban infrastructure, and support intelligent monitoring, fault warning, maintenance management and emergency response. By integrating data from different sensors and monitoring equipment, the platform can provide real-time analysis and decision support, thereby optimizing urban public services and safety management.
[0004] Traditional information processing technologies generally lack the ability to efficiently manage and update complex data structures in real time in urban infrastructure management, which leads to reduced timeliness of decision-making and response. Unoptimized data structures make the retrieval and analysis of key information cumbersome and inefficient. In addition, traditional technologies are inadequate in predicting and adjusting power loads, often resulting in waste of resources or supply disruptions due to untimely responses or inaccurate predictions. These problems are particularly evident in the context of expanding urban scale and complex infrastructure. The limitations of existing technologies increase the risks and costs of urban operations, posing a challenge to improving the sustainability and efficiency of cities. Summary of the invention
[0005] The purpose of the present invention is to solve the shortcomings of the prior art and to propose an integrated pipe gallery information integration and sharing platform.
[0006] In order to achieve the above-mentioned purpose, the present invention adopts the following technical scheme: the comprehensive pipe gallery information integration and sharing platform includes:
[0007] The model graph construction module collects the 3D model element data including the location and size information of buildings, pipelines and equipment, converts them into graph nodes and edges, constructs the graph representation of the 3D model based on the infrastructure of the integrated pipeline corridor, and generates a graph structure data set;
[0008] The graph level optimization module identifies and marks high-density subgraphs from the graph structure data set, including key pipelines and communication lines, and divides them into levels, each level representing a densely associated part in data and vision, to obtain an optimized hierarchical structure;
[0009] The dynamic rendering decision module analyzes user interaction behaviors including zooming and rotating view parameters, and adjusts the rendering quality of the user's attention area in combination with the optimized hierarchical structure, while reducing the rendering details of the non-attention area, to obtain a dynamic rendering decision result;
[0010] The load prediction and dispatch module analyzes the real-time and historical load data of the power pipeline corridor, predicts the changes in power demand in multiple sections in the short term through time series analysis, evaluates the sections with high loads based on the predicted data, uses the data obtained from the dynamic rendering decision results to dynamically adjust the power output, adjusts the load of equipment or sections, and generates power dispatch optimization results.
[0011] As a further solution of the present invention, the steps of acquiring the graph structure data set are specifically as follows:
[0012] Get the size and position from buildings, pipes and equipment, record the three-dimensional coordinates of each component, and use the formula:
[0013] P i =(x i α+β,y i γ+δ,z i ·∈+ζ)
[0014] Calculate the three-dimensional coordinate point of each component to obtain a three-dimensional coordinate point set;
[0015] Among them, P i represents the three-dimensional coordinate point of the i-th component, x i ,y i , z i are the x-axis, y-axis, and z-axis coordinate values of the component in three-dimensional space, α and β are the adjustment coefficient and offset of the x-axis, γ and δ are the adjustment coefficient and offset of the y-axis, and ∈ and ζ are the adjustment coefficient and offset of the z-axis;
[0016] Based on the three-dimensional coordinate point set, use the formula:
[0017] V={v i ∣v i =f(P i )}
[0018] Extract the nodes of the graph and obtain the graph node set;
[0019] Among them, V represents the set of graph nodes, v i According to the coordinate point P iThe converted graph node,f,is the mapping function from three-dimensional coordinates to graph nodes, responsible for converting three-dimensional position data into nodes in the graph;
[0020] The edges between nodes are determined by calculating the Euclidean distance between nodes in the graph node set, using the formula:
[0021]
[0022] Get the edge set of the graph;
[0023] Among them, E represents the edge set of the graph, e ij is node v i With v j The Euclidean distance between them, λ is the normalization coefficient in the distance calculation, which is used to adjust the spatial data of differential scale to a uniform scale;
[0024] Combining the graph node set and the graph edge set, a graph representation of the three-dimensional model is created using the formula:
[0025] G=(V,E)
[0026] Obtain a three-dimensional model graph structure data set;
[0027] Among them, G represents the constructed graph structure.
[0028] As a further solution of the present invention, the step of obtaining the optimized hierarchical structure is specifically as follows:
[0029] Identify high-density areas from the graph structure dataset and calculate the weighted average connection strength of each node using the formula:
[0030]
[0031] Get the node density index;
[0032] Among them, D i represents the weighted average connection strength of the i-th node, c ij is the connection strength between node i and node j, w ij is the weight of the connection strength, n is the total number of reference nodes;
[0033] According to the node density index, nodes with density exceeding the threshold are selected to form a high-density area, using the formula:
[0034] HD={v i ∣D i >θ}
[0035] Generate a high-density subgraph set;
[0036] Among them, HD represents high-density subgraph, v iis a node in the graph, θ is the preset density threshold;
[0037] The nodes in the high-density subgraph set are divided into levels according to the importance of key pipelines and communication lines, using the formula:
[0038] L k =∑ i∈H λ i ·v i
[0039] Get a hierarchical high-density subgraph;
[0040] Among them, L k represents the structure of the kth layer, λ i is the weight assigned according to the strategic importance of node i, v i is a node in the high-density subgraph set;
[0041] To integrate the hierarchical high-density subgraphs, the formula is:
[0042]
[0043] Obtaining the optimized hierarchical structure;
[0044] Among them, S represents the optimized hierarchical structure and m is the total number of levels.
[0045] As a further solution of the present invention, the step of obtaining the dynamic rendering decision result is specifically:
[0046] Analyze the scaling and rotation view parameters in user interaction behavior, using the formula:
[0047]
[0048] Calculate and obtain the user interaction behavior score;
[0049] Among them, B represents the user interaction behavior score, x i ,y i is the view parameter for user interaction, a i , b i is the weight factor, n is the number of interactions;
[0050] Combining the user interaction behavior score and the optimized hierarchical structure, the formula is adopted:
[0051]
[0052] Determine the user's attention area and generate an adjusted attention area configuration;
[0053] Where C represents the adjusted focus region configuration, v j is a node in the hierarchical structure, Bj is the interaction behavior score corresponding to the node, and λ is the adjustment factor;
[0054] Adjust the rendering quality according to the adjusted region of interest configuration, using the formula:
[0055]
[0056] Optimize the rendering of the focus area and the non-focus area to obtain the rendering quality adjustment result;
[0057] Among them, Q represents the rendering quality adjustment result, μ k , ν k is the rendering quality factor, C k is the adjusted configuration of the region of interest;
[0058] Based on the rendering quality adjustment results, the formula is adopted:
[0059] D = ∫Qdx
[0060] Output dynamic rendering decision results;
[0061] Among them, D represents the dynamic rendering decision result, and dx represents the change of rendering parameters.
[0062] As a further solution of the present invention, the steps for obtaining the power allocation optimization result are specifically as follows:
[0063] Collect real-time and historical load data of the power pipeline corridor, using the formula:
[0064]
[0065] Calculate total load and generate load data summary;
[0066] Among them, L t Represents the total load, l i is the load data at a single time point, c i and d i is the weighting coefficient, n is the number of data points;
[0067] The load data are summarized and analyzed for time series to predict the changes in power demand in multiple sections in the short term, using the formula:
[0068]
[0069] Predict electricity demand and obtain electricity demand prediction results;
[0070] Among them, P t represents the predicted electricity demand, L t-i is the historical load data, a i , b iare model parameters;
[0071] According to the power demand forecast results, the high load section is evaluated using the formula:
[0072]
[0073] Identify the high load section and generate the high load section identification;
[0074] Among them, H represents the high load section set, P si is the predicted load of the segment, s i is the section of the power corridor, γ is the high load threshold;
[0075] The high load section identification is used to adjust the power output, using the formula:
[0076]
[0077] Optimize power distribution and generate power distribution optimization results;
[0078] Among them, A represents the optimization result of power dispatch, δ j is the adjustment factor, s j This is the section that needs to be adjusted.
[0079] Compared with the prior art, the advantages and positive effects of the present invention are:
[0080] In the present invention, by converting the three-dimensional model data into a graph structure data set, the information presentation of the system is more accurate and efficient. This data structure conversion provides clear visual and data association, especially for the intuitive understanding of the location and size information of buildings, pipelines and equipment. The optimized hierarchical structure enhances the rapid access to key infrastructure information and enhances the flexibility and responsiveness of data management. The real-time prediction and adjustment of power demand is more accurate, ensuring the rational allocation of resources and maximization of energy efficiency, and significantly improving the reliability and efficiency of power management. BRIEF DESCRIPTION OF THE DRAWINGS
[0081] Figure 1 is a flow chart of the platform of the present invention;
[0082] Figure 2 A flowchart of the steps for obtaining a graph structure data set of the present invention;
[0083] Figure 3 A flowchart of the steps for obtaining the optimized hierarchical structure of the present invention;
[0084] Figure 4 A flowchart of the steps for obtaining the dynamic rendering decision result of the present invention;
[0085] Figure 5This is a flow chart of the steps for obtaining the power allocation optimization results of the present invention. DETAILED DESCRIPTION
[0086] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail 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 invention and are not intended to limit the present invention.
[0087] In the description of the present invention, it should be understood that the terms "length", "width", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or element referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, in the description of the present invention, "multiple" means two or more, unless otherwise clearly and specifically defined.
[0088] Embodiment 1
[0089] See also Figure 1 The comprehensive pipe gallery information integration and sharing platform includes:
[0090] The model graph construction module collects the 3D model element data including the location and size information of buildings, pipelines and equipment, converts them into graph nodes and edges, constructs the graph representation of the 3D model based on the infrastructure of the integrated pipeline corridor, and generates a graph structure data set;
[0091] The graph-level optimization module identifies and marks high-density subgraphs from graph-structured datasets, including key pipelines and communication lines, and divides them into hierarchical levels, where each level represents a densely associated part in terms of data and vision, to obtain an optimized hierarchical structure.
[0092] The dynamic rendering decision module analyzes user interaction behaviors including zooming and rotating view parameters, and adjusts the rendering quality of the user's attention area based on the optimized hierarchical structure, while reducing the rendering details of non-attention areas to obtain dynamic rendering decision results;
[0093] The load forecasting and dispatching module analyzes the real-time and historical load data of the power corridor, predicts the changes in power demand in multiple sections in the short term through time series analysis, evaluates the sections with high loads based on the forecast data, uses the data obtained from the dynamic rendering decision results to dynamically adjust the power output, adjust the load of equipment or sections, and generate power dispatch optimization results.
[0094] The graph structure data set includes building nodes, pipeline edges, and equipment nodes. The optimized hierarchical structure specifically includes a data-intensive layer and a visual association layer. The dynamic rendering decision results involve rendering quality adjustment and view parameter response. The power allocation optimization results specifically include high-load section adjustment and short-term power demand forecasting.
[0095] See also Figure 2 ,The specific steps for obtaining the graph structure dataset are:
[0096] Get the size and position from buildings, pipes and equipment, record the three-dimensional coordinates of each component, and use the formula:
[0097] P i =(x i α+β,y i γ+δ,z i ·∈+ζ)
[0098] Calculate the three-dimensional coordinate point of each component to obtain a three-dimensional coordinate point set;
[0099] Among them, P i represents the three-dimensional coordinate point of the i-th component, x i ,y i , z i are the x-axis, y-axis, and z-axis coordinate values of the component in three-dimensional space, α and β are the adjustment coefficient and offset of the x-axis, γ and δ are the adjustment coefficient and offset of the y-axis, and ∈ and ζ are the adjustment coefficient and offset of the z-axis;
[0100] Based on a three-dimensional coordinate point set, use the formula:
[0101] V={v i ∣v i =f(P i )}
[0102] Extract the nodes of the graph and obtain the graph node set;
[0103] Among them, V represents the graph node set, v i According to the coordinate point P i The converted graph node,f,is the mapping function from three-dimensional coordinates to graph nodes, responsible for converting three-dimensional position data into nodes in the graph;
[0104] The edges between nodes are determined by calculating the Euclidean distance between nodes in the graph node set, using the formula:
[0105]
[0106] Get the edge set of the graph;
[0107] Among them, E represents the edge set of the graph, e ij is node vi With v j The Euclidean distance between them, λ is the normalization coefficient in the distance calculation, which is used to adjust the spatial data of differential scale to a uniform scale;
[0108] Combine the graph node set and the graph edge set to create a graph representation of the three-dimensional model using the formula:
[0109] G=(V,E)
[0110] Obtain a three-dimensional model graph structure data set;
[0111] Among them, G represents the constructed graph structure.
[0112] formula:
[0113] P i =(x i α+β,y i γ+δ,z i ·∈+ζ)
[0114] Assumed parameter values:
[0115] Original coordinate x i =100,y i =150, z i =200
[0116] Adjustment coefficient and offset: α = 1.05, β = 5, γ = 1.03, δ = -3, ∈ = 0.98, ζ = 2 Calculation process:
[0117] x new =100×1.05+5=105+5=110
[0118] y new =150×1.03-3=154.5-3=151.5
[0119] z new =200×0.98+2=196+2=198
[0120] Result analysis:
[0121] P i =(110, 151.5, 198) represents the adjusted three-dimensional coordinates to ensure accuracy and positional correctness.
[0122] formula:
[0123] V={v i ∣v i =f(P i )}
[0124] Calculation process:
[0125] Use function f to transform the three-dimensional coordinates into the nodes of the graph. Here, function f is a mapping function, that is, f(P i )=P i .
[0126] Result analysis:
[0127] V is the node set of the graph, including the nodes mapped by the f function, such as v i =(110, 151.5, 198).
[0128] formula:
[0129]
[0130] Assumed parameter values:
[0131] Two nodes v i =(110, 151.5, 198) and v j =(130, 171.5, 210)
[0132] Normalization coefficient λ = 10
[0133] Calculation process:
[0134]
[0135] Result analysis:
[0136] e ij =3.073 represents node v i With v j The normalized distance between them, used for edge representation in graphs.
[0137] See also Figure 3 , the steps for obtaining the optimized hierarchical structure are as follows:
[0138] Identify high-density areas from the graph structure dataset and calculate the weighted average connection strength of each node using the formula:
[0139]
[0140] Get the node density index;
[0141] Among them, D i represents the weighted average connection strength of the i-th node, c ij is the connection strength between node i and node j, w ij is the weight of the connection strength, n is the total number of reference nodes;
[0142] According to the node density index, nodes with density exceeding the threshold are selected to form a high-density area, using the formula:
[0143] HD={v i ∣D i >θ}
[0144] Generate a high-density subgraph set;
[0145] Among them, HD represents high-density subgraph, v i is a node in the graph, θ is the preset density threshold;
[0146] The nodes in the high-density subgraph set are divided into levels according to the importance of key pipelines and communication lines, using the formula:
[0147] L k =∑ i∈H λ i ·v i
[0148] Get a hierarchical high-density subgraph;
[0149] Among them, L k represents the structure of the kth layer, λ i is the weight assigned according to the strategic importance of node i, v i is a node in the high-density subgraph set;
[0150] Integrate hierarchical high-density subgraphs using the formula:
[0151]
[0152] Obtaining the optimized hierarchical structure;
[0153] Among them, S represents the optimized hierarchical structure and m is the total number of levels.
[0154] formula:
[0155]
[0156] Detailed explanation and calculation process:
[0157] definition:
[0158] D i : The weighted average connection strength of the ith node.
[0159] w ij : The weight of the connection between node i and node j, determined based on the distance attribute.
[0160] c ij : The connection strength between node i and node j is determined according to the interaction strength or communication frequency between the two nodes.
[0161] n: The total number of nodes referenced in the graph.
[0162] Assumptions:
[0163] Assume there are 4 nodes, the connection strength and weight between nodes are as follows:
[0164] c 12 =3,w 12 =0.5
[0165] c 13 =5,w 13 =0.2
[0166] c 14 =2,w 14 =0.3
[0167] calculate:
[0168] Calculate the numerator:
[0169] Calculate the denominator:
[0170] Calculate D i :
[0171] Result analysis:
[0172] D i =3.1 means that the weighted average connection strength of the node is 3.1, which reflects the average influence or connection strength of node i in the graph.
[0173] formula:
[0174] HD={v i ∣D i >θ}
[0175] Detailed explanation and calculation process:
[0176] definition:
[0177] HD: High-density subgraph, including all nodes with connection strength above a certain threshold.
[0178] θ: Threshold, used to filter high-density nodes.
[0179] Assumptions:
[0180] θ=2.5
[0181] D calculated in the previous step i =3.1
[0182] judge:
[0183] Due to D i =3.1>θ=2.5, node i belongs to the high-density subgraph.
[0184] Result analysis:
[0185] Node i is classified into the high-density subgraph because its connection strength is higher than the threshold.
[0186] formula:
[0187]
[0188] Detailed explanation and calculation process:
[0189] definition:
[0190] L k : Represents the structure of the kth layer.
[0191] λ i : A weight assigned according to the strategic importance of a node, which can be based on the node's centrality, communication volume, or other association metrics.
[0192] v i : Nodes in a high-density subgraph collection.
[0193] Assumptions:
[0194] Consider a certain high-density subgraph, including node i.
[0195] Assume that the weight factor of the node is λ i =0.8, which means that it is more important in the subgraph.
[0196] calculate:
[0197] Refer to single layer L k The calculation of only includes one node i.
[0198] Calculate L k :L k =0.8·v i , where we assume that v i The numerical representation of can be any scalar metric of a node, such as its degree or flow (assumed to be 1).
[0199] Result analysis:
[0200] L k The calculated result is 0.8, which represents the weighted contribution of the nodes in the hierarchical structure.
[0201] formula:
[0202]
[0203] Detailed explanation and calculation process:
[0204] definition:
[0205] S: Optimized hierarchical structure.
[0206] m: The total number of levels, simplified to 1 level, that is, only L1.
[0207] Assumptions:
[0208] L1 is known to be 0.8.
[0209] calculate:
[0210] Calculate S: Since there is only one level L1,
[0211] Result analysis:
[0212] S = 0.8, indicating that the value of the integrated hierarchical structure is 0.8, which reflects the cumulative influence of the most important nodes in the entire high-density subgraph.
[0213] See also Figure 4 , the specific steps for obtaining dynamic rendering decision results are:
[0214] Analyze the scaling and rotation view parameters in user interaction behavior, using the formula:
[0215]
[0216] Calculate and obtain the user interaction behavior score;
[0217] Among them, B represents the user interaction behavior score, x i ,y i is the view parameter for user interaction, a i , b i is the weight factor, n is the number of interactions;
[0218] Combining the user interaction behavior score and the optimized hierarchical structure, the formula is adopted:
[0219]
[0220] Determine the user's attention area and generate an adjusted attention area configuration;
[0221] Where C represents the adjusted focus region configuration, v j is a node in the hierarchical structure, B j is the interaction behavior score corresponding to the node, and λ is the adjustment factor;
[0222] Adjust the rendering quality according to the adjusted focus area configuration, using the formula:
[0223]
[0224] Optimize the rendering of the focus area and the non-focus area to obtain the rendering quality adjustment result;
[0225] Among them, Q represents the rendering quality adjustment result, μ k , ν k is the rendering quality factor, C k is the adjusted configuration of the region of interest;
[0226] Comprehensive rendering quality adjustment results, using the formula:
[0227] D = ∫Qdx
[0228] Output dynamic rendering decision results;
[0229] Among them, D represents the dynamic rendering decision result, and dx represents the change of rendering parameters.
[0230] formula:
[0231]
[0232] Parameter explanation:
[0233] B: User interaction behavior score
[0234] x i : Scaling parameter for the i-th interaction
[0235] y i : Rotation parameter of the i-th interaction
[0236] a i , b i : Weight factors for scaling and rotation of the i-th interaction
[0237] n: number of interactions
[0238] Calculation process:
[0239] Assume that there are three user interactions, where the scaling and rotation parameters are as follows:
[0240] The 1st time: x1=1.2, y1=0.8, a1=0.5, b1=0.5
[0241] Second time: x2=1.5, y2=0.7, a2=0.6, b2=0.4
[0242] Third time: x3=1.1, y3=0.9, a3=0.4, b3=0.6
[0243] Apply the formula to calculate the contribution of each interaction:
[0244] First time: 0.5·1.2+0.5·0.8=0.6+0.4=1.0
[0245] Second time: 0.6·1.5+0.4·0.7=0.9+0.28=1.18
[0246] The third time: 0.4·1.1+0.6·0.9=0.44+0.54=0.98
[0247] Calculate the overall average score:
[0248]
[0249] Example results:
[0250] The obtained user interaction behavior score B=1.053 represents the average weighted score of each interaction, which helps to analyze the user's interaction preference.
[0251] formula:
[0252]
[0253] Parameter explanation:
[0254] C: Adjusted focus area configuration
[0255] v j : Node in the hierarchy
[0256] B j : Interaction behavior score corresponding to the node
[0257] λ: adjustment factor
[0258] Calculation process:
[0259] Assume there are two nodes in the hierarchy, the interaction score of each node is calculated as above, and assume the adjustment factor λ = 1.2
[0260] Apply the formula to calculate the adjusted configuration:
[0261] C=1.053·1.2+1.053·1.2=1.2636+1.2636=2.5272
[0262] Example results:
[0263] The obtained adjusted focus region configuration C=2.5272 is used to determine the key focus points of the user on the interface.
[0264] formula:
[0265]
[0266] Parameter explanation:
[0267] Q: Rendering quality adjustment results
[0268] μ k : Rendering quality factor of the focus area
[0269] ν k : Rendering quality factor for non-interest areas
[0270] C k : Adjusted focus area configuration
[0271] Calculation process:
[0272] Based on the above output, assume there are two regions of interest configurations:
[0273] C1=1.2636(calculated)
[0274] C2=0.7636(assumed value)
[0275] Set the rendering quality coefficient of the focus area and non-focus area, assuming:
[0276] μ1=0.8,ν1=0.2
[0277] μ2=0.7,ν2=0.3
[0278] Apply the formula to calculate rendering quality:
[0279] Q1=0.8·1.2636+0.2·(1-1.2636)=1.01088+0.05272=1.0636
[0280] Q2=0.7·0.7636+0.3·(1-0.7636)=0.53452+0.07092=0.60544
[0281] Calculate the total rendering quality adjustment result:
[0282] Q=Q1+Q2=1.0636+0.60544=1.66904
[0283] Example results:
[0284] The obtained rendering quality adjustment result Q=1.66904 reflects the sum of rendering qualities dynamically adjusted according to user attention.
[0285] formula:
[0286] D = ∫Qdx
[0287] Parameter explanation:
[0288] D: Dynamic rendering decision results
[0289] dx: represents a small change in the rendering parameter space
[0290] Q: Rendering quality adjustment results
[0291] Calculation process:
[0292] Assume Q is a constant of 1.66904 and changes by one unit:
[0293] dx=1
[0294] Apply the formula to calculate the dynamic rendering decision results:
[0295] D=∫1.66904dx=1.66904×1=1.66904
[0296] Example results:
[0297] The dynamic rendering decision result D=1.66904 represents the integral value of the overall rendering quality adjustment under the given parameter settings, reflecting the quantitative score of the overall rendering decision.
[0298] See also Figure 5 , the specific steps for obtaining the power dispatch optimization results are:
[0299] Collect real-time and historical load data of the power pipeline corridor, using the formula:
[0300]
[0301] Calculate total load and generate load data summary;
[0302] Among them, L t Represents the total load, l i is the load data at a single time point, c i and d i is the weighting coefficient, n is the number of data points;
[0303] The load data is aggregated for time series analysis to predict the changes in power demand in multiple sections in the short term, using the formula:
[0304]
[0305] Predict electricity demand and obtain electricity demand prediction results;
[0306] Among them, P t represents the predicted electricity demand, L t-i is the historical load data, a i , b i are model parameters;
[0307] According to the power demand forecast results, the high load section is evaluated using the formula:
[0308]
[0309] Identify the high load section and generate the high load section identification;
[0310] Among them, H represents the high load section set, P si is the predicted load of the segment, s i is the section of the power corridor, γ is the high load threshold;
[0311] The power output is adjusted by identifying the high load section, using the formula:
[0312]
[0313] Optimize power distribution and generate power distribution optimization results;
[0314] Among them, A represents the optimization result of power dispatch, δ j is the adjustment factor, s j This is the section that needs to be adjusted.
[0315] Assumptions:
[0316] The load data of the power corridor at three time points (t1, t2, and t3) are 100kW, 150kW, and 200kW respectively.
[0317] Weighting coefficient c i and d i They are 1.5 and 0.5 respectively.
[0318] formula:
[0319]
[0320] calculate:
[0321] l1=100, c1=1.5, d1=0.5
[0322]
[0323] l2=150, c2=1.5, d2=0.5
[0324]
[0325] l3=200, c3=1.5, d3=0.5
[0326]
[0327] Total load L t It is 15005+33756.12+60007.07=108768.19kW, which represents the weighted load summary at three time points.
[0328] Assumptions:
[0329] Use historical load data L t-1 , L t-2 They are 33756.12 and 60007.07 calculated in the previous step respectively.
[0330] Prediction model parameter a i and b i 0.8 and 0.2 respectively.
[0331] formula:
[0332]
[0333] calculate:
[0334]
[0335] The values represent the short-term electricity demand forecast calculated by the forecasting model based on historical load data.
[0336] Reset the parameters to suit the actual scenario:
[0337] The power demand forecast result P t =4743291.7587kW.
[0338] Set a more reasonable high load threshold γ to 1.5 (a multiple rather than an absolute value), standard deviation Assume 200,000kW (this is an estimate, defined by the volatility of the system).
[0339] formula:
[0340]
[0341] calculate:
[0342]
[0343] because Above 300,000 kW, all sections are identified as high load sections.
[0344] Assumptions:
[0345] Assume that adjustments are required in high load sections.
[0346] Adjustment factor δ j Set to 1.1.
[0347] formula:
[0348]
[0349] calculate:
[0350] Assume that the segments s1, s2, and s3 that need to be adjusted are 1, 2, and 3 respectively.
[0351] δ1=δ2=δ3=1.1
[0352]
[0353] The result A=0.14445 represents the average adjustment factor, reflecting the power output optimization adjusted according to the high load section.
[0354] The above are only preferred embodiments of the present invention and are not intended to limit the present invention in other forms. Any technician familiar with the profession may use the technical contents disclosed above to change or modify them into equivalent embodiments with equivalent changes and apply them to other fields. However, any simple modification, equivalent change and modification made to the above embodiments based on the technical essence of the present invention without departing from the technical solution of the present invention still falls within the protection scope of the technical solution of the present invention.
Claims
1. Comprehensive pipe gallery information integration and sharing platform, It is characterized in that The platform includes: The model graph construction module collects the 3D model element data including the location and size information of buildings, pipelines and equipment, converts them into graph nodes and edges, constructs the graph representation of the 3D model based on the infrastructure of the integrated pipeline corridor, and generates a graph structure data set; The graph level optimization module identifies and marks high-density subgraphs from the graph structure data set, including key pipelines and communication lines, and divides them into levels, each level representing a densely associated part in data and vision, to obtain an optimized hierarchical structure; The dynamic rendering decision module analyzes user interaction behaviors including zooming and rotating view parameters, and adjusts the rendering quality of the user's attention area in combination with the optimized hierarchical structure, while reducing the rendering details of the non-attention area, to obtain a dynamic rendering decision result; The load prediction and dispatch module analyzes the real-time and historical load data of the power pipeline corridor, predicts the changes in power demand in multiple sections in the short term through time series analysis, evaluates the sections with high loads based on the predicted data, uses the data obtained from the dynamic rendering decision results to dynamically adjust the power output, adjusts the load of equipment or sections, and generates power dispatch optimization results.
2. According to the comprehensive pipe gallery information integration and sharing platform of claim 1, It is characterized in that The steps for obtaining the graph structure dataset are specifically as follows: Get the size and position from buildings, pipes and equipment, record the three-dimensional coordinates of each component, and use the formula: P i =(x i ·α+β,yi·γ+δ,z i ·∈+ζ) Calculate the three-dimensional coordinate point of each component to obtain a three-dimensional coordinate point set; Among them, P i represents the three-dimensional coordinate point of the i-th component, x i , yi, z i are the x-axis, y-axis, and z-axis coordinate values of the component in three-dimensional space, α and β are the adjustment coefficient and offset of the x-axis, γ and δ are the adjustment coefficient and offset of the y-axis, and ∈ and ζ are the adjustment coefficient and offset of the z-axis; Based on the three-dimensional coordinate point set, use the formula: V={v i ∣v i =f(P i )} Extract the nodes of the graph and obtain the graph node set; Among them, V represents the graph node set, v i According to the coordinate point P i The converted graph node,f,is the mapping function from three-dimensional coordinates to graph nodes, responsible for converting three-dimensional position data into nodes in the graph; The edges between nodes are determined by calculating the Euclidean distance between nodes in the graph node set, using the formula: Get the edge set of the graph; Among them, E represents the edge set of the graph, e ij is node v i With v j The Euclidean distance between them, λ is the normalization coefficient in the distance calculation, which is used to adjust the spatial data of differential scale to a uniform scale; Combining the graph node set and the graph edge set, a graph representation of the three-dimensional model is created using the formula: G=(V,E) Obtain a three-dimensional model graph structure data set; Among them, G represents the constructed graph structure.
3. According to the comprehensive pipe gallery information integration and sharing platform of claim 2, It is characterized in that The steps for obtaining the optimized hierarchical structure are specifically as follows: Identify high-density areas from the graph structure dataset and calculate the weighted average connection strength of each node using the formula: Get the node density index; Among them, D i represents the weighted average connection strength of the i-th node, c ij is the connection strength between node i and node j, w ij is the weight of the connection strength, n is the total number of reference nodes; According to the node density index, nodes with density exceeding the threshold are selected to form a high-density area, using the formula: HD i ∣D i >θ} Generate a high-density subgraph set; Among them, HD represents high-density subgraph, v i is a node in the graph, θ is the preset density threshold; The nodes in the high-density subgraph set are divided into levels according to the importance of key pipelines and communication lines, using the formula: L k =∑ i∈H l i ·v i Get a hierarchical high-density subgraph; Among them, L k represents the structure of the kth layer, λ i is the weight assigned according to the strategic importance of node i, v i is a node in the high-density subgraph set; To integrate the hierarchical high-density subgraphs, the formula is: Obtain optimized hierarchical structure; Among them, S represents the optimized hierarchical structure and m is the total number of levels.
4. According to the comprehensive pipe gallery information integration and sharing platform of claim 3, It is characterized in that The steps for obtaining the dynamic rendering decision result are specifically as follows: Analyze the scaling and rotation view parameters in user interaction behavior, using the formula: Calculate and obtain the user interaction behavior score; Among them, B represents the user interaction behavior score, x i ,y i is the view parameter for user interaction, a i , b i is the weight factor, n is the number of interactions; Combining the user interaction behavior score and the optimized hierarchical structure, the formula is adopted: Determine the user's attention area and generate an adjusted attention area configuration; Where C represents the adjusted focus region configuration, v j is a node in the hierarchical structure, B j is the interaction behavior score corresponding to the node, and λ is the adjustment factor; Adjust the rendering quality according to the adjusted region of interest configuration, using the formula: Optimize the rendering of the focus area and the non-focus area to obtain the rendering quality adjustment result; Among them, Q represents the rendering quality adjustment result, μ k , ν k is the rendering quality factor, C k is the adjusted configuration of the region of interest; Based on the rendering quality adjustment results, the formula is adopted: D = ∫Qdx Output dynamic rendering decision results; Among them, D represents the dynamic rendering decision result, and dx represents the change of rendering parameters.
5. According to the comprehensive pipe gallery information integration and sharing platform of claim 4, It is characterized in that The steps for obtaining the power dispatch optimization result are specifically as follows: Collect real-time and historical load data of the power pipeline corridor, using the formula: Calculate total load and generate load data summary; Among them, L t represents the total load, l i is the load data at a single time point, c i and d i is the weighting coefficient, n is the number of data points; The load data are summarized and analyzed for time series to predict the changes in power demand in multiple sections in the short term, using the formula: Predict electricity demand and obtain electricity demand prediction results; Among them, P t represents the predicted electricity demand, L t-i is the historical load data, a i , b i are model parameters; According to the power demand forecast results, the high load section is evaluated using the formula: Identify the high load section and generate the high load section identification; Among them, H represents the high load section set, P si is the predicted load of the segment, s i is the section of the power corridor, γ is the high load threshold; The high load section identification is used to adjust the power output, using the formula: Optimize power distribution and generate power distribution optimization results; Among them, A represents the optimization result of power dispatch, δ j is the adjustment factor, s j This is the section that needs to be adjusted.
Citation Information
Patent Citations
BIM rendering method and equipment based on lightweight equipment, and computer readable storage medium
CN112347546A
Intelligent power grid power distribution method based on BP neural network
CN117077922A
Image and data organization, fusion loading and display method and system
CN117272495A
3D sand table real-time visual angle tracking system
CN117827012A
Cited By
Geological disaster intelligent early warning method and system based on multi-source remote sensing data
CN119380496A
