Movatterモバイル変換


[0]ホーム

URL:


CN119922117B - Charging data real-time processing method and system applied to charging information platform - Google Patents

Charging data real-time processing method and system applied to charging information platform

Info

Publication number
CN119922117B
CN119922117BCN202411997216.XACN202411997216ACN119922117BCN 119922117 BCN119922117 BCN 119922117BCN 202411997216 ACN202411997216 ACN 202411997216ACN 119922117 BCN119922117 BCN 119922117B
Authority
CN
China
Prior art keywords
charging
parent
node
nodes
network
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202411997216.XA
Other languages
Chinese (zh)
Other versions
CN119922117A (en
Inventor
毕双斌
徐春源
宋静静
周晶
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xi'an Chengtou Intelligent Charging Co ltd
Original Assignee
Xi'an Chengtou Intelligent Charging Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xi'an Chengtou Intelligent Charging Co ltdfiledCriticalXi'an Chengtou Intelligent Charging Co ltd
Priority to CN202411997216.XApriorityCriticalpatent/CN119922117B/en
Publication of CN119922117ApublicationCriticalpatent/CN119922117A/en
Application grantedgrantedCritical
Publication of CN119922117BpublicationCriticalpatent/CN119922117B/en
Activelegal-statusCriticalCurrent
Anticipated expirationlegal-statusCritical

Links

Landscapes

Abstract

The invention discloses a charging data real-time processing method and a system applied to a charging information platform, which relate to the technical field of data processing and comprise the following steps of constructing a topological structure of a charging pile network; the method comprises the steps of calculating the weight of edges between child nodes and father nodes, calculating the weight of the edges between the father nodes, selecting an initial father node to construct a child network, dividing a charging pile network into a plurality of child networks based on the weight expansion child network of the edges between the father nodes, determining the central father node of each child network, collecting voltage and current data between the father nodes in real time, calculating the fluctuation rate, determining an optimal path based on the topology structure of the charging pile network, collecting charging data during charging, calculating a charging data average value by using a sliding window, reselecting the optimal path if the charging data average value exceeds a fluctuation threshold value, realizing real-time efficient processing of the charging data, and improving the data processing capacity and response speed of a charging information platform.

Description

Charging data real-time processing method and system applied to charging information platform
Technical Field
The invention relates to the technical field of data processing, in particular to a charging data real-time processing method and system applied to a charging information platform.
Background
Along with the rapid development of the electric automobile industry, the construction and perfection of a charging infrastructure become key elements for supporting popularization of electric automobiles, and the charging pile is used as a main facility for energy supply of the electric automobiles, and the distribution, the operation efficiency and the data processing capability of the charging pile directly influence the charging experience of users of the electric automobiles and the stable operation of a power grid.
However, the current technology mainly relies on wireless or wired data transmission, but the optimization requirement of the network structure is not fully considered when the power line communication technology (PLC) is used for data transmission, and the power line communication technology is used as an innovative data transmission means, and has the potential of being capable of using the existing power infrastructure to perform data transmission, but in practical application, how to reasonably optimize the network structure according to the characteristics of the PLC technology to maximize the data transmission efficiency and stability is still a blank of the current technology.
Secondly, when the power line communication technology is adopted for data transmission, current and voltage fluctuation becomes a non-negligible influence factor, and the fluctuation can not only interfere with normal transmission of data, so that data loss or error is caused, but also the reliability and stability of data transmission can be reduced.
Disclosure of Invention
(One) solving the technical problems
Aiming at the defects of the prior art, the invention provides a charging data real-time processing method and a charging data real-time processing system applied to a charging information platform, which realize the real-time and efficient processing of charging data by means of constructing topological structures of charging piles and a power network, calculating edge weights, dividing sub-networks, optimizing a data transmission path in real time and the like, improve the data processing capacity and the response speed of the charging information platform and provide higher-quality charging service for electric automobile users.
(II) technical scheme
In order to achieve the purpose, the invention is realized by the following technical scheme that the charging data real-time processing method applied to the charging information platform comprises the following steps:
Collecting geographic position information of all charging piles, including longitude and latitude coordinates, numbers of the charging piles and information of convergence points accessed to a power grid, and constructing a topological structure of a charging pile network;
Collecting historical charging data, calculating the weight of edges between the child nodes and the father nodes through the charging amount of the child nodes and the physical distance between the child nodes and the father nodes, calculating the weight of edges between the father nodes through the charging amount of the father nodes and the physical distance between the father nodes, and updating the weight of corresponding edges in the topological structure of the charging pile network;
selecting an initial parent node to construct a sub-network, expanding the sub-network based on the weight of edges between each parent node, dividing a charging pile network into a plurality of sub-networks, checking whether parent nodes which are not added to any sub-network exist, and determining a central parent node of each sub-network;
And collecting voltage and current data among father nodes in real time, calculating the fluctuation rate, determining an optimal path based on a network topology structure of the charging pile, collecting charging data during charging, calculating a charging data average value by using a sliding window, and reselecting the optimal path if the charging data average value exceeds a fluctuation threshold value.
Further, constructing a topology structure of the charging pile network, specifically including:
Defining each charging pile as a child node, allocating a unique identifier to each child node, defining a convergence point of the charging pile accessing the power grid as a father node, and allocating a unique identifier to each father node;
Determining edges between the child nodes and the father nodes according to the connection relation between the charging piles and the power grid convergence points, and determining edges between the father nodes according to the connection relation between the power grid convergence points, wherein each edge contains directional information;
Initializing an empty graph structure, wherein the graph structure is used for storing nodes and edges, adding child nodes and father nodes into the graph to serve as vertex sets of the graph, adding edges into the graph according to connection relations, and connecting the corresponding child nodes and father nodes.
Further, the weight of the edge between the child node and the parent node is calculated by the charge amount of the child node and the physical distance between the child node and the parent node: Wherein ωs,p represents the weight of the edge between the child node s and its parent node p, Es represents the historical average power consumption of the child node s, Ds,p represents the physical distance between the child node s and its parent node p, child (p) represents all the child node sets of the parent node p;
Further, the weights of the edges of the parent nodes are calculated by the charge amount of the parent nodes and the physical distance between the parent nodes: Wherein ωp1,p2 represents the weight of the edge between the parent nodes p1 and p2, Ep1 and Ep2 represent the historical average power consumption of the parent nodes p1 and p2, respectively, Dp1,p2 represents the physical distance between the parent nodes p1 and p2, and parent_ pairs represents the set of all parent node pairs.
Further, the charging pile network is divided into a plurality of sub-networks, which specifically comprises:
s1, creating an empty list for storing the divided sub-networks, initializing a variable for tracking the identifier of the current sub-network;
S2, randomly selecting a father node as a starting point of a current sub-network, and adding the father node and directly connected sub-nodes and edges thereof into the current sub-network;
S3, checking the weight of the edge between each father node and other father nodes in the current sub-network, and if the weight of the edge between the current father node and other father nodes in the current sub-network is lower than a preset weight threshold, adding the father node and the directly connected child nodes and edges thereof into the current sub-network until new father nodes and child nodes cannot be added into the current sub-network;
And S4, traversing all the father nodes, checking whether the father nodes which are not added to any child network exist or not, if so, repeating the steps S2-S3, and adding the father nodes and the child nodes and edges thereof into a new child network.
Further, determining a central parent node of each sub-network specifically includes:
For each divided sub-network, calculating the approximate centrality index of all the father nodes, selecting the father node with the highest approximate centrality index as the central father node of the sub-network, and adopting an approximate centrality index calculation formula: where Cc (p) represents a near centrality index for node p, N represents the total number of nodes in the subnetwork, and d (p, q) represents the shortest path length between node p and node q.
Further, determining an optimal path based on the network topology structure of the charging pile specifically includes:
Calculating the fluctuation rate of the father node pair according to the voltage and current data between each father node pair, generating data transmission paths between all father nodes based on the constructed charging pile network topology structure, and calculating the stability index of each candidate path according to the fluctuation rate of all father node pairs on the path: Wherein μ represents a stability index, σi represents a fluctuation rate of the ith parent node pair of the path, K represents the number of the parent node pairs of the path, and a path with the highest stability index is selected as an optimal path.
Further, the optimal path is reselected, specifically including:
when the electric automobile is connected to the charging pile and starts to charge, charging data in the charging process are collected in real time through a sensor arranged in the charging pile, the charging data are ordered according to time stamps, a charging data sequence is constructed, and the charging data are transmitted to a charging information platform through an optimal path by using a power line communication technology.
Further, setting the size and the step length of the sliding window, creating a first sliding window from the initial position of the charging data sequence, accumulating the charging data in the sliding window to obtain an accumulated sum, calculating the ratio of the accumulated sum to the window size to obtain the average value of the charging data in the sliding window, and if the average value of the charging data in the sliding window exceeds a preset fluctuation threshold value, re-determining the optimal path.
Charging data real-time processing system applied to charging information platform includes:
The network topology construction module is used for collecting geographic position information of all charging piles, including longitude and latitude coordinates, numbers of the charging piles and information of convergence points of an access power grid, and constructing a topology structure of a charging pile network;
The topological structure analysis module is used for collecting historical charging data, calculating the weight of the edge between the child node and the father node through the charging amount of the child node and the physical distance between the child node and the father node, calculating the weight of the edge between the father node through the charging amount of the father node and the physical distance between the father node, and updating the weight of the corresponding edge in the topological structure of the charging pile network;
The sub-network dividing module is used for selecting an initial parent node to construct a sub-network, dividing a charging pile network into a plurality of sub-networks based on the weight expansion sub-network of the edges between the parent nodes, checking whether the parent nodes which are not added to any sub-network exist or not, and determining the central parent node of each sub-network;
The data processing module is used for collecting voltage and current data among father nodes in real time, calculating the fluctuation rate, determining an optimal path based on a charging pile network topology structure, collecting charging data during charging, calculating a charging data average value by using a sliding window, and reselecting the optimal path if the charging data average value exceeds a fluctuation threshold value.
(III) beneficial effects
The invention provides a charging data real-time processing method and a system applied to a charging information platform, which have the following beneficial effects:
(1) By constructing the topological structure of the charging pile network, the connection relation between the charging pile and the power grid convergence point and the energy flow direction can be clearly displayed, which is helpful for optimizing the data transmission path, reducing the delay and loss of data in the transmission process, and by utilizing the characteristics of the topological structure, the rapid routing and forwarding of the data can be realized, and the real-time performance and reliability of the data transmission are improved.
(2) By collecting and processing historical charging data, the weights of the sides (connections) in the charging stake network are calculated and updated, the calculation of the weights taking into account the charge and physical distance, helping to identify critical paths for transmitting data in the network. By optimizing the data transmission on these critical paths, the transmission efficiency of the overall network can be improved.
(3) The whole charging pile network is divided into a plurality of sub-networks, the data processing amount in each sub-network is obviously reduced, the complexity of data processing is reduced, the data processing efficiency is improved, meanwhile, due to the fact that the number of nodes in the sub-networks is limited, the delay and the error rate of data transmission are correspondingly reduced, the division of the sub-networks is carried out according to factors such as charging characteristics and physical distances among father nodes, the fact that the nodes in each sub-network have stronger relevance is guaranteed, interference and noise in the data transmission process are reduced, and the reliability of data transmission is improved.
(4) The change of the state of the power grid can be found in time by collecting the voltage and current data among the father nodes in real time and calculating the fluctuation rate, and the stability index of the path is calculated based on the charging pile network topology structure and the fluctuation rate of the father nodes, so that the optimal data transmission path is selected, the network structure of power communication is optimized, and the stability and the reliability of data transmission are ensured.
Drawings
Fig. 1 is a schematic diagram of steps of a method for processing charging data in real time, which is applied to a charging information platform;
FIG. 2 is a schematic diagram of a network structure of the charging information platform according to the present invention;
Fig. 3 is a schematic structural diagram of a charging data real-time processing system applied to a charging information platform.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1-2, the present invention provides a method for processing charging data in real time, which is applied to a charging information platform, and includes the following steps:
collecting geographical position information of all charging piles, including longitude and latitude coordinates, numbers of the charging piles and information of convergence points accessed to a power grid, and constructing a topological structure of a charging pile network;
The first step comprises the following steps:
step 101, collecting geographic position information of all charging piles, including longitude and latitude coordinates, numbers of the charging piles and information of convergence points (namely father node information) of an access power grid;
102, defining each charging pile as a child node, allocating a unique identifier (such as a charging pile number) to each child node, defining a convergence point of the charging pile accessing the power grid as a father node, and allocating a unique identifier to each father node;
Step 103, determining edges (connection) between the child nodes and the father nodes according to the connection relation between the charging piles and the power grid convergence points, and determining edges between the father nodes according to the connection relation between the power grid convergence points, wherein each edge comprises directivity information (such as the direction from the child node to the father node or the direction from the father node to the child node or the direction from the father node to the father node) so as to represent the direction of energy flow;
It should be noted that, the power grid convergence point refers to a convergence point of the charging piles accessing the power grid, usually is an output end of a transformer substation or a distribution substation, and is used as an electric power source of a plurality of charging piles, and has a function of distributing electric energy to each charging pile, and in a topology structure of the charging pile network, the power grid convergence point is abstracted into a father node and is connected with a child node (charging pile) through an edge;
The connection relation between the child node (charging pile) and the father node (power grid convergence point) represents a specific path of the charging pile connected to the power grid, in the topological structure, the connection relation is represented by a directional edge, and the direction of the edge points to the father node from the child node, so that electric energy flows to the charging pile from the power grid convergence point;
Connection relations between the grid convergence points can exist, which are usually used for realizing redundant backup, load balancing or optimizing electric energy distribution of the power grid, and in the topological structure of the charging pile network, the connection relations between the grid convergence points are also represented by directed edges, and the directions of the edges can be changed according to the actual running condition of the power grid, so that the flowing directions of electric energy among different grid convergence points are represented;
When determining the directional information of the edge, the directional information of the edge needs to be determined according to the actual operation condition of the power grid, for example, in normal conditions, electric energy flows from a power grid convergence point to a charging pile, so that the direction of the edge points to a child node from a father node, but in certain special conditions (such as power grid faults or maintenance), electric energy may need to flow back from other power grid convergence points or the charging pile, and at the moment, the direction of the edge may change;
Step 104, initializing an empty graph structure by using the basic concept of graph theory, wherein the graph structure can store nodes and edges, and the child nodes and the father nodes defined in the step 102 are added into the graph to be used as a vertex set of the graph;
It should be noted that, according to the connection relationship and the weight (the initial weight is set as the distance) between the charging pile and the power grid convergence point, an adjacency matrix or adjacency table is constructed to represent the topology structure of the charging pile network, the adjacency matrix is a two-dimensional array, wherein the elements represent the connection relationship and the weight between the nodes, the adjacency table is a list of lists, and each list comprises other nodes directly connected with the corresponding nodes and weights thereof.
Step 105, adding edges into the graph according to the connection relation defined in step 103, connecting corresponding child nodes and father nodes, and simplifying the adding process of the edges by using functions in a graph theory library or a framework;
and 106, verifying the correctness of the graph structure, ensuring that no isolated node or unconnected edge exists, and carrying out necessary adjustment on the graph structure according to actual conditions, such as correcting the wrong connection relationship or adding the missing edge, when all nodes and edges are correctly added into the graph, and after the graph structure is verified and adjusted, completing the topology structure construction of the charging pile network.
In use, the contents of steps 101 to 106 are combined:
By constructing the topological structure of the charging pile network, the connection relation between the charging pile and the power grid convergence point and the energy flow direction can be clearly displayed, which is helpful for optimizing the data transmission path, reducing the delay and loss of data in the transmission process, and by utilizing the characteristics of the topological structure, the rapid routing and forwarding of the data can be realized, and the real-time performance and reliability of the data transmission are improved.
Step two, collecting historical charging data, calculating the weight of the edge between the child node and the father node through the charging amount of the child node and the physical distance between the child node and the father node, calculating the weight of the edge between the father node through the charging amount of the father node and the physical distance between the father node, and updating the weight of the corresponding edge in the topological structure of the charging pile network;
The second step comprises the following steps:
Step 201 of collecting historical charge data including historical charge data of each child node (charge stake), historical charge data of each parent node (grid convergence point), physical distance data between child node and parent node, and physical distance data between parent nodes,
It should be noted that, the charge amount data of each charging pile (child node) recorded by the charge amount data at time intervals (such as day, week and month) and the total charge amount received or distributed by each grid convergence point (parent node), the charge amount data of the parent node needs to be summarized and calculated according to the charge amount data of the child node, the physical distance between the child node and the parent node is usually static and can be obtained through a Geographic Information System (GIS) or actual measurement, and the mutual distance between the parent nodes is also obtained in a similar way;
Step 202, calculating the weight of the edge between the child node and the father node through the charge amount of the child node and the physical distance between the child node and the father node: Wherein ωs,p represents the weight of the edge between the child node s and its parent node p, Es represents the historical average power consumption of the child node s, Ds,p represents the physical distance between the child node s and its parent node p, child (p) represents all the child node sets of the parent node p;
step 203, calculating the weight of the edges of the parent nodes by the charge amount of the parent nodes and the physical distance between the parent nodes: Wherein ωp1,p2 represents the weight of the edge between the parent nodes p1 and p2, Ep1 and Ep2 represent the historical average power consumption of the parent nodes p1 and p2, respectively, Dp1,p2 represents the physical distance between the parent nodes p1 and p2, and parent_ pairs represents the set of all parent node pairs;
step 204, using the weights obtained in step 202 and step 203 to update the weights of the corresponding edges in the graph structure constructed in step one.
It should be noted that, ensuring that each edge (whether the edge from the child node to the parent node or the edge between the parent nodes) has a weight correctly set, after updating the weight, verifying the correctness of the graph structure is required, and ensuring that there are no isolated nodes or edges with weights incorrectly set can be accomplished by traversing the graph structure and checking the weight value of each edge.
In use, the contents of steps 201 to 204 are combined:
By collecting and processing historical charging data, the weights of the sides (connections) in the charging stake network are calculated and updated, the calculation of the weights taking into account the charge and physical distance, helping to identify critical paths for transmitting data in the network. By optimizing the data transmission on these critical paths, the transmission efficiency of the overall network can be improved.
Selecting an initial parent node to construct a sub-network, dividing a charging pile network into a plurality of sub-networks based on the weight expansion sub-network of the edges between the parent nodes, checking whether the parent nodes which are not added to any sub-network exist or not, and determining the central parent node of each sub-network;
The third step comprises the following steps:
Step 301, creating an empty list or data structure for storing the divided sub-networks, initializing a variable for tracking the number or identifier of the current sub-network;
Step 302, selecting a parent node as a starting point of a current sub-network randomly or according to strategies such as charge amount size, geographical position distribution and the like, for example, selecting a parent node with the largest charge amount or a parent node with the most center of the geographical position as the starting point, and adding the parent node and the directly connected child nodes and edges thereof into the current sub-network;
Step 303, for each father node in the current sub-network, checking the weight of the edge between the father node and other father nodes, if the weight of the edge between the current father node and other father nodes in the current sub-network is lower than a preset weight threshold (which indicates that the charging characteristics of the father node and other father nodes are similar or the physical distance is closer), adding the father node and the directly connected child nodes and edges thereof into the current sub-network, and repeating the process until new father nodes and child nodes cannot be added into the current sub-network;
It should be noted that, the preset weight threshold plays an important role in the sub-network dividing process, if the threshold is set too high, the number of sub-networks may be too large and the scale may be too small;
Step 304, traversing all father nodes, checking whether there is a father node which is not added to any child network, if so, repeating steps 302 to 303, and adding the father node and child nodes and edges thereof to a new child network;
When the division of the sub-network is completed, checking the result of the division of the sub-network to ensure that each father node and the sub-node belong to only one sub-network and have no isolated node or sub-network, and if a problem is found, adjusting the division of the sub-network is needed;
Step 305, for each divided sub-network, calculating the centrality index of all father nodes, selecting the father node with the highest centrality index as the central father node of the sub-network, wherein the centrality index comprises centrality, proximity centrality, betweenness centrality and the like, for example, selecting the proximity centrality index as the centrality index, and the proximity centrality index calculating formula:
wherein Cc (p) represents a near centrality index of the node p, N represents a total number of nodes in the sub-network, and d (p, q) represents a shortest path length between the node p and the node q;
in use, the contents of steps 301 to 305 are combined:
The whole charging pile network is divided into a plurality of sub-networks, the data processing amount in each sub-network is obviously reduced, the complexity of data processing is reduced, the data processing efficiency is improved, meanwhile, due to the fact that the number of nodes in the sub-networks is limited, the delay and the error rate of data transmission are correspondingly reduced, the division of the sub-networks is carried out according to factors such as charging characteristics and physical distances among father nodes, the fact that the nodes in each sub-network have stronger relevance is guaranteed, interference and noise in the data transmission process are reduced, and the reliability of data transmission is improved.
And step four, collecting voltage and current data among father nodes in real time, calculating the fluctuation rate, determining an optimal path based on a network topology structure of the charging pile, collecting charging data during charging, calculating a charging data average value by using a sliding window, and re-selecting the optimal path if the charging data average value exceeds a fluctuation threshold value.
The fourth step comprises the following steps:
step 401, collecting voltage and current data between each father node (a power grid convergence point) in real time through a sensor or monitoring equipment installed in a power grid, and calculating the fluctuation rate of the father node pair according to the voltage and current data between each father node pair: Where σp1,p2 denotes the ripple ratio of the parent node pair, Vp1,p2 (t) and Ip1,p2 (t) denote the voltage and current between parent node p1 and parent node p2 at time t,AndRespectively representing the average value of the voltage and the current, and M represents the number of data points;
step 402, based on the charging pile network topology structure constructed in the step one, generating data transmission paths among all the father nodes, and for each candidate path, calculating a stability index of the path according to the fluctuation rate of all the father node pairs on the path: Wherein μ represents a stability index, σi represents a fluctuation rate of the ith father node pair of the path, K represents the number of the father node pairs of the path, and a path with the highest stability index is selected as an optimal path;
step 403, when the electric automobile is connected to the charging pile and starts charging, collecting charging data in the charging process in real time through a sensor arranged in the charging pile, including but not limited to current, voltage, charging duration, charging power and charging amount, sequencing the charging data according to a time stamp, constructing a charging data sequence, wherein the charging data sequence includes but not limited to a current data sequence, a voltage data sequence and a charging power data sequence, and transmitting the charging data to a charging information platform through an optimal path by using a power line communication technology;
Step 404, setting the size of the sliding window, namely the data amount processed each time, setting the step length of the sliding window, namely the distance of each movement of the window, wherein the window size and the step length of the sliding window are set according to the data processing requirement, for example, the step length is set to be 1, which means that one data point is moved each time, and other values can be set;
Step 405, creating a first sliding window from the initial position of the charging data sequence, accumulating the charging data in the sliding window to obtain an accumulated sum, calculating the ratio of the accumulated sum to the window size to obtain the average value of the charging data in the sliding window, and repeating the steps 401 to 402 to re-determine the optimal path if the average value of the charging data in the sliding window exceeds a preset fluctuation threshold;
It should be noted that, the average value calculation is performed for a specific charging data (such as current and voltage), in practical application, the average values of different charging data need to be calculated respectively, and corresponding comparison and analysis are performed, and the setting of the fluctuation threshold needs to be adjusted according to the practical application scene and the data characteristics, so as to ensure that the operation of reselecting the optimal path can be triggered in time when the data is abnormal;
in use, the contents of steps 401 to 405 are combined:
the change of the state of the power grid can be found in time by collecting the voltage and current data among the father nodes in real time and calculating the fluctuation rate, and the stability index of the path is calculated based on the charging pile network topology structure and the fluctuation rate of the father nodes, so that the optimal data transmission path is selected, the network structure of power communication is optimized, and the stability and the reliability of data transmission are ensured.
Referring to fig. 3, the invention also provides a charging data real-time processing system applied to the charging information platform, which comprises a network topology construction module, a topology analysis module, a sub-network division module and a data processing module, wherein,
The network topology construction module is used for collecting geographic position information of all charging piles, including longitude and latitude coordinates, numbers of the charging piles and information of convergence points of an access power grid, and constructing a topology structure of a charging pile network;
The topological structure analysis module is used for collecting historical charging data, calculating the weight of the edge between the child node and the father node through the charging amount of the child node and the physical distance between the child node and the father node, calculating the weight of the edge between the father node through the charging amount of the father node and the physical distance between the father node, and updating the weight of the corresponding edge in the topological structure of the charging pile network;
The sub-network dividing module is used for selecting an initial parent node to construct a sub-network, dividing a charging pile network into a plurality of sub-networks based on the weight expansion sub-network of the edges between the parent nodes, checking whether the parent nodes which are not added to any sub-network exist or not, and determining the central parent node of each sub-network;
The data processing module is used for collecting voltage and current data among father nodes in real time, calculating the fluctuation rate, determining an optimal path based on a charging pile network topology structure, collecting charging data during charging, calculating a charging data average value by using a sliding window, and reselecting the optimal path if the charging data average value exceeds a fluctuation threshold value.
In the application, the related formulas are all the numerical calculation after dimensionality removal, and the formulas are one formulas for obtaining the latest real situation by software simulation through collecting a large amount of data, and coefficients in the formulas are set by a person skilled in the art according to the actual situation.
The above embodiments may be implemented in whole or in part by software, hardware, firmware, or any other combination. When implemented in software, the above-described embodiments may be implemented in whole or in part in the form of a computer program product. Those of ordinary skill in the art will appreciate that the elements and algorithm steps described in connection with the embodiments disclosed herein can be implemented as a combination of electronic hardware, computer software, and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed over a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
The foregoing is merely illustrative of the present application, and the present application is not limited thereto, and any person skilled in the art will readily recognize that variations or substitutions are within the scope of the present application.

Claims (9)

Translated fromChinese
1.应用于充电信息平台的充电数据实时处理方法,其特征在于:包括以下步骤:1. A real-time charging data processing method applied to a charging information platform, characterized in that it comprises the following steps:收集所有充电桩的地理位置信息,包括经纬度坐标、充电桩的编号以及接入电网的汇聚点信息,构建充电桩网络的拓扑结构;Collect the geographic location information of all charging piles, including latitude and longitude coordinates, charging pile numbers, and grid access point information, to build the topology of the charging pile network;收集历史充电数据,通过子节点的充电量和子节点与父节点之间的物理距离,计算子节点与父节点之间的边的权重,通过父节点的充电量和父节点相互之间的物理距离,计算父节点相互之间的边的权重,并更新充电桩网络的拓扑结构中相应边的权重;Collect historical charging data, calculate the weight of the edge between the child node and the parent node based on the charge capacity of the child node and the physical distance between the child node and the parent node, calculate the weight of the edge between the parent nodes based on the charge capacity of the parent node and the physical distance between the parent nodes, and update the weight of the corresponding edge in the topology of the charging pile network;选择一个起始父节点构建子网络,基于每个父节点之间的边的权重扩展子网络,将充电桩网络划分为若干个子网络,检查是否存在未被添加到任何子网络的父节点,并确定每个子网络的中心父节点;Select a starting parent node to build a subnetwork, expand the subnetwork based on the weight of the edges between each parent node, divide the charging pile network into several subnetworks, check whether there are parent nodes that have not been added to any subnetwork, and determine the central parent node of each subnetwork;实时收集父节点间的电压电流数据,并计算波动率:Collect voltage and current data between parent nodes in real time and calculate the fluctuation rate:其中,σp1,p2表示父节点对的波动率,Vp1,p2(t)和Ip1,p2(t)表示在时刻t父节点p1和父节点p2之间的电压和电流,分别表示电压和电流的均值,M表示数据点的数量; Where σp1,p2 represents the fluctuation rate of the parent node pair, Vp1,p2 (t) and Ip1,p2 (t) represent the voltage and current between the parent node p1 and the parent node p2 at time t, and Represent the mean values of voltage and current respectively, and M represents the number of data points;基于构建的充电桩网络拓扑结构,生成所有父节点之间的数据传输路径,对于每个候选路径,根据该路径上所有父节点对的波动率,计算该路径的稳定性指标:其中,μ表示稳定性指标,σi表示该路径第i个父节点对的波动率,K表示该路径父节点对的数量,选择稳定性指标最高的路径作为最优路径;Based on the constructed charging pile network topology, the data transmission paths between all parent nodes are generated. For each candidate path, the stability index of the path is calculated according to the volatility of all parent node pairs on the path: Where μ represents the stability index,σi represents the volatility of the i-th parent node pair of the path, and K represents the number of parent node pairs of the path. The path with the highest stability index is selected as the optimal path.充电时,收集充电数据,使用滑动窗口计算充电数据均值,若充电数据均值超过波动阈值,则重选最优路径。During charging, charging data is collected and the average of the charging data is calculated using a sliding window. If the average of the charging data exceeds the fluctuation threshold, the optimal path is reselected.2.根据权利要求1所述的应用于充电信息平台的充电数据实时处理方法,其特征在于:构建充电桩网络的拓扑结构,具体包括:2. The method for real-time processing of charging data applied to a charging information platform according to claim 1, characterized in that: constructing a topological structure of a charging pile network specifically includes:将每个充电桩定义为一个子节点,并为每个子节点分配一个唯一的标识符,将充电桩接入电网的汇聚点定义为父节点,为每个父节点分配一个唯一的标识符;Define each charging pile as a child node and assign a unique identifier to each child node. Define the convergence point where the charging pile is connected to the power grid as a parent node and assign a unique identifier to each parent node.根据充电桩与电网汇聚点的连接关系,确定子节点与父节点之间的边,根据电网汇聚点之间的连接关系,确定父节点之间的边,每条边包含方向性信息;Based on the connection relationship between the charging pile and the grid convergence point, the edge between the child node and the parent node is determined. Based on the connection relationship between the grid convergence points, the edge between the parent nodes is determined. Each edge contains directional information.初始化一个空的图结构,该图结构用于存储节点和边,将子节点和父节点添加到图中,作为图的顶点集合;根据连接关系,将边添加到图中,连接相应的子节点和父节点。Initialize an empty graph structure, which is used to store nodes and edges. Add child nodes and parent nodes to the graph as the vertex set of the graph. Add edges to the graph according to the connection relationship to connect the corresponding child nodes and parent nodes.3.根据权利要求1所述的应用于充电信息平台的充电数据实时处理方法,其特征在于:3. The method for real-time processing of charging data applied to a charging information platform according to claim 1, characterized in that:通过子节点的充电量和子节点与父节点之间的物理距离,计算子节点与父节点之间的边的权重:其中,ωs,p表示子节点s与其父节点p之间边的权重,Es表示子节点s的历史平均用电量,Ds,p表示子节点s与其父节点p之间的物理距离,children(p)表示父节点p的所有子节点集合。The weight of the edge between the child node and the parent node is calculated by the charge of the child node and the physical distance between the child node and the parent node: Where ωs,p represents the weight of the edge between child node s and its parent node p,Es represents the historical average electricity consumption of child node s, Ds,p represents the physical distance between child node s and its parent node p, and children(p) represents the set of all child nodes of parent node p.4.根据权利要求3所述的应用于充电信息平台的充电数据实时处理方法,其特征在于:4. The method for real-time processing of charging data applied to a charging information platform according to claim 3, characterized in that:通过父节点的充电量和父节点相互之间的物理距离,计算父节点相互之间的边的权重:其中,ωp1,p2表示父节点p1与p2之间边的权重,Ep1和Ep2分别表示父节点p1与p2的历史平均用电量,Dp1,p2表示父节点p1与p2之间的物理距离,parent_pairs表示所有父节点对的集合。The weights of the edges between parent nodes are calculated by the charge of the parent nodes and the physical distance between the parent nodes: Where ωp1,p2 represents the weight of the edge between parent nodes p1 and p2, Ep1 and Ep2 represent the historical average electricity consumption of parent nodes p1 and p2 respectively, Dp1,p2 represents the physical distance between parent nodes p1 and p2, and parent_pairs represents the set of all parent node pairs.5.根据权利要求1所述的应用于充电信息平台的充电数据实时处理方法,其特征在于:将充电桩网络划分为若干个子网络,具体包括:5. The method for real-time processing of charging data applied to a charging information platform according to claim 1 is characterized in that the charging pile network is divided into several sub-networks, specifically including:S1:创建一个空的列表,用于存储划分后的子网络,初始化一个变量,用于追踪当前子网络的标识符;S1: Create an empty list to store the divided sub-networks and initialize a variable to track the identifier of the current sub-network;S2:随机选择一个父节点作为当前子网络的起始点,将该父节点及其直接相连的子节点和边添加到当前子网络中;S2: Randomly select a parent node as the starting point of the current sub-network, and add the parent node and its directly connected child nodes and edges to the current sub-network;S3:对于当前子网络中的每个父节点,检查其与其他父节点之间的边的权重,若当前父节点与当前子网络中的其他父节点之间的边的权重低于预设的权重阈值,则将该父节点及其直接相连的子节点和边添加到当前子网络中,直到无法再添加新的父节点和子节点到当前子网络中;S3: For each parent node in the current sub-network, check the weights of the edges between it and other parent nodes. If the weights of the edges between the current parent node and other parent nodes in the current sub-network are lower than the preset weight threshold, then add the parent node and its directly connected child nodes and edges to the current sub-network until no new parent nodes and child nodes can be added to the current sub-network.S4:遍历所有父节点,检查是否存在未被添加到任何子网络的父节点,若存在,则重复S2~S3的步骤,将该父节点及其子节点和边添加到新的子网络中。S4: Traverse all parent nodes and check whether there is a parent node that has not been added to any sub-network. If so, repeat steps S2 to S3 to add the parent node and its child nodes and edges to the new sub-network.6.根据权利要求5所述的应用于充电信息平台的充电数据实时处理方法,其特征在于:确定每个子网络的中心父节点,具体包括:6. The method for real-time processing of charging data applied to a charging information platform according to claim 5, characterized in that determining the central parent node of each sub-network specifically comprises:对于每个已划分的子网络,计算所有父节点的接近中心性指标,选择接近中心性指标最高的父节点作为该子网络的中心父节点,接近中心性指标计算公式:其中,Cc(p)表示节点p的接近中心性指标,N表示子网络中节点的总数,d(p,q)表示节点p和节点q之间的最短路径长度。For each divided sub-network, calculate the closeness centrality index of all parent nodes, and select the parent node with the highest closeness centrality index as the central parent node of the sub-network. The calculation formula of the closeness centrality index is: Where Cc(p) represents the closeness centrality index of node p, N represents the total number of nodes in the subnetwork, and d(p,q) represents the shortest path length between node p and node q.7.根据权利要求6所述的应用于充电信息平台的充电数据实时处理方法,其特征在于:重选最优路径,具体包括:7. The method for real-time processing of charging data applied to a charging information platform according to claim 6, wherein reselecting the optimal path specifically comprises:当电动汽车连接到充电桩并开始充电时,通过充电桩内置的传感器实时采集充电过程中的充电数据,将充电数据根据时间戳进行排序,构建充电数据序列,利用电力线通信技术将充电数据通过最优路径传输至充电信息平台。When an electric vehicle is connected to a charging pile and starts charging, the charging data during the charging process is collected in real time through the built-in sensors in the charging pile. The charging data is sorted according to the timestamp to construct a charging data sequence, and the charging data is transmitted to the charging information platform through the optimal path using power line communication technology.8.根据权利要求7所述的应用于充电信息平台的充电数据实时处理方法,其特征在于:8. The method for real-time processing of charging data applied to a charging information platform according to claim 7, characterized in that:设置滑动窗口的大小和步长,从充电数据序列的起始位置,创建第一个滑动窗口,对滑动窗口内的充电数据进行累加,得到累加和,计算累加和与窗口大小的比值,得到滑动窗口内充电数据的均值,若滑动窗口内充电数据的均值超过预先设置的波动阈值,则重新确定最优路径。Set the size and step size of the sliding window, create the first sliding window from the starting position of the charging data sequence, accumulate the charging data in the sliding window, obtain the cumulative sum, calculate the ratio of the cumulative sum to the window size, and obtain the mean of the charging data in the sliding window. If the mean of the charging data in the sliding window exceeds the preset fluctuation threshold, redetermine the optimal path.9.应用于充电信息平台的充电数据实时处理系统,用于实现权利要求1至8中任一项所述方法,其特征在于:包括:9. A real-time charging data processing system applied to a charging information platform, for implementing the method according to any one of claims 1 to 8, characterized in that it comprises:网络拓扑构建模块,收集所有充电桩的地理位置信息,包括经纬度坐标、充电桩的编号以及接入电网的汇聚点信息,构建充电桩网络的拓扑结构;The network topology construction module collects the geographic location information of all charging piles, including latitude and longitude coordinates, charging pile numbers, and grid access point information, to build the topology of the charging pile network;拓扑结构分析模块,收集历史充电数据,通过子节点的充电量和子节点与父节点之间的物理距离,计算子节点与父节点之间的边的权重,通过父节点的充电量和父节点相互之间的物理距离,计算父节点相互之间的边的权重,并更新充电桩网络的拓扑结构中相应边的权重;The topology analysis module collects historical charging data, calculates the weight of the edge between the child node and the parent node based on the charge capacity of the child node and the physical distance between the child node and the parent node, calculates the weight of the edge between the parent nodes based on the charge capacity of the parent node and the physical distance between the parent nodes, and updates the weight of the corresponding edge in the topology of the charging pile network;子网络划分模块,选择一个起始父节点构建子网络,基于每个父节点之间的边的权重扩展子网络,将充电桩网络划分为若干个子网络,检查是否存在未被添加到任何子网络的父节点,并确定每个子网络的中心父节点;The subnetwork partitioning module selects a starting parent node to build a subnetwork, expands the subnetwork based on the weight of the edges between each parent node, divides the charging pile network into several subnetworks, checks whether there are parent nodes that have not been added to any subnetwork, and determines the central parent node of each subnetwork;数据处理模块,实时收集父节点间的电压电流数据,并计算波动率:The data processing module collects voltage and current data between parent nodes in real time and calculates the fluctuation rate:其中,σp1,p2表示父节点对的波动率,Vp1,p2(t)和Ip1,p2(t)表示在时刻t父节点p1和父节点p2之间的电压和电流,分别表示电压和电流的均值,M表示数据点的数量; Where σp1,p2 represents the fluctuation rate of the parent node pair, Vp1,p2 (t) and Ip1,p2 (t) represent the voltage and current between the parent node p1 and the parent node p2 at time t, and Represent the mean values of voltage and current respectively, and M represents the number of data points;基于构建的充电桩网络拓扑结构,生成所有父节点之间的数据传输路径,对于每个候选路径,根据该路径上所有父节点对的波动率,计算该路径的稳定性指标:其中,μ表示稳定性指标,σi表示该路径第i个父节点对的波动率,K表示该路径父节点对的数量,选择稳定性指标最高的路径作为最优路径;充电时,收集充电数据,使用滑动窗口计算充电数据均值,若充电数据均值超过波动阈值,则重选最优路径。Based on the constructed charging pile network topology, the data transmission paths between all parent nodes are generated. For each candidate path, the stability index of the path is calculated according to the volatility of all parent node pairs on the path: Where μ represents the stability index,σi represents the volatility of the i-th parent node pair of the path, and K represents the number of parent node pairs of the path. The path with the highest stability index is selected as the optimal path. During charging, charging data is collected and the mean of the charging data is calculated using a sliding window. If the mean of the charging data exceeds the fluctuation threshold, the optimal path is reselected.
CN202411997216.XA2024-12-312024-12-31Charging data real-time processing method and system applied to charging information platformActiveCN119922117B (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CN202411997216.XACN119922117B (en)2024-12-312024-12-31Charging data real-time processing method and system applied to charging information platform

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CN202411997216.XACN119922117B (en)2024-12-312024-12-31Charging data real-time processing method and system applied to charging information platform

Publications (2)

Publication NumberPublication Date
CN119922117A CN119922117A (en)2025-05-02
CN119922117Btrue CN119922117B (en)2025-08-01

Family

ID=95502062

Family Applications (1)

Application NumberTitlePriority DateFiling Date
CN202411997216.XAActiveCN119922117B (en)2024-12-312024-12-31Charging data real-time processing method and system applied to charging information platform

Country Status (1)

CountryLink
CN (1)CN119922117B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN120546995B (en)*2025-07-252025-09-26长春工程学院Cloud computing-based power distribution network energy storage data safety protection method

Citations (2)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN102045088A (en)*2011-01-262011-05-04长沙威胜信息技术有限公司Low-voltage power line narrowband carrier communication routing method
CN106100995A (en)*2016-06-082016-11-09南京南瑞集团公司A kind of method for routing being applicable to power line carrier communication network network

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN103326904B (en)*2013-07-122016-12-28中国人民解放军理工大学A kind of fast network topology estimating method cognitive based on multiparameter
US9893981B2 (en)*2016-03-142018-02-13Mitsubishi Electric Research Laboratories, Inc.Resource aware multi-task routing in multi-hop heterogeneous wireless networks

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN102045088A (en)*2011-01-262011-05-04长沙威胜信息技术有限公司Low-voltage power line narrowband carrier communication routing method
CN106100995A (en)*2016-06-082016-11-09南京南瑞集团公司A kind of method for routing being applicable to power line carrier communication network network

Also Published As

Publication numberPublication date
CN119922117A (en)2025-05-02

Similar Documents

PublicationPublication DateTitle
CN119922117B (en)Charging data real-time processing method and system applied to charging information platform
EP2568664B1 (en)Apparatus and method for detecting critical nodes and critical links in a multi-hop network
US8842520B2 (en)Apparatus and method for identifying optimal node placement to form redundant paths around critical nodes and critical links in a multi-hop network
Lee et al.Maximal covering with network survivability requirements in wireless mesh networks
CN110740394B (en)Power optical transmission network optimization method and system based on site classification business classification
CN109743215B (en)Ant colony optimization virtual network mapping method based on disaster prediction under multi-region fault
CN117729567B (en)Optimization method and system for wireless ad hoc network
CN113347059A (en)In-band network telemetering optimal detection path planning method based on fixed probe position
Szczytowski et al.DKM: Distributed k-connectivity maintenance in wireless sensor networks
CN112990538A (en)Method, device and equipment for determining current collection circuit of mountain photovoltaic power station
US12270669B1 (en)Test routes planning method and apparatus of vehicle on actual roads, medium and device thereof
CN111222692B (en)Reliability discrete addressing method considering return under limited information situation
CN116527562A (en) A routing method, system, device and medium for grid connection of rooftop photovoltaic power plants
CN100405787C (en) A Link State Routing Protocol Flooding Method Based on Reliable Subnet Technology
CN119921843A (en) Satellite communication system multipath routing dynamic scheduling method, device and medium
Kang et al.Multi-objective optimized connectivity restoring of disjoint segments using mobile data collectors in wireless sensor network
EP3425861A1 (en)Improved routing in an heterogeneous iot network
CN116112421A (en) A routing optimization method and device
CN113094857B (en)Controller layout method of energy-saving software-defined vehicle network
CN115277449B (en) OPNET-based space-ground integrated network routing simulation method and application
CN114301512B (en)Method and system for evaluating bearing capacity of multilayer low-orbit satellite network
CN116127661A (en) Method, device, equipment, and storage medium for determining a path for terminal access to a substation
Chowdhury et al.Estimating reliability of mobile agent system for mobile ad hoc networks
CN114697221B (en) Reliability Mapping Algorithm Based on Snapshot Tree Model in Space-Space-Ground Integrated Network
Sharma et al.A Survey on Cut Detection and Connectivity Restoration in Wireless Sensor Network

Legal Events

DateCodeTitleDescription
PB01Publication
PB01Publication
SE01Entry into force of request for substantive examination
SE01Entry into force of request for substantive examination
GR01Patent grant
GR01Patent grant

[8]ページ先頭

©2009-2025 Movatter.jp