A method and system for remote visual monitoring of 10kV three-phase disconnect switches
By constructing a weighted change graph and decomposing update tasks, the rendering process of the remote visualization monitoring system for 10kV three-phase disconnect switches was optimized, solving the problem of excessive rendering load and realizing timely display of key information and system stability.
Patent Information
- Application Number
- CN202611326175.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2026-08-29
- Publication Date
- 2026-11-17
AI Technical Summary
Existing technology cannot optimize the differential update process of the front-end interface based on the characteristics of the equipment status data of 10kV three-phase disconnect switches, resulting in excessive rendering load and difficulty in displaying key monitoring information in a timely manner.
By constructing a new virtual DOM tree and attaching static, temporal, or event identifiers, the weights of changed nodes are calculated, a weighted change graph is constructed, the differential comparison process is optimized, update tasks are decomposed into immediate and delayed update groups, and the rendering load is controlled.
It improves the rendering efficiency and smoothness of the front-end screen, reduces the risk of interface lag, and ensures the timely display of key information.
Smart Images

Figure CN123115491A_ABST
Abstract
Description
Technical Field
[0001] This application belongs to the field of visual monitoring, and in particular relates to a method and system for remote visual monitoring of a 10kV three-phase disconnector. Background Technology
[0002] Current visualization monitoring systems typically employ web-based front-end development technologies and utilize a virtual DOM mechanism to construct and render the monitoring interface. During continuous system operation, the front-end interface needs to be constantly refreshed based on real-time status data to display the current operating status of the equipment. For 10kV three-phase disconnect switches, the monitoring data is characterized by high update frequency, multiple data dimensions, and significant differences in change characteristics. This includes both periodically fluctuating regular operating parameters and sudden alarm information or switch position changes that require timely monitoring. In scenarios with large amounts of data changing centrally, traditional differential comparison methods tend to generate a large number of update patches, triggering concentrated real DOM updates within the same rendering cycle. This leads to increased front-end rendering load, consumes significant computing resources, and consequently causes interface lag or response delays. When the rendering thread is occupied for extended periods by ordinary data updates, critical equipment anomalies or position changes are difficult to present in a timely manner. Therefore, optimizing the front-end differential update process based on the changing characteristics and importance of equipment status data, while controlling overall rendering overhead and ensuring the timely display of critical monitoring information, is a pressing technical problem that needs to be solved in the field of remote visualization monitoring of 10kV three-phase disconnect switches. Summary of the Invention
[0003] This invention proposes a remote visual monitoring method for 10kV three-phase disconnect switches, which addresses the problem that existing technologies cannot optimize the differential update process of the front-end interface based on the different characteristics of equipment status data. Under the premise of reasonably controlling the overall rendering overhead of the system, it ensures that key monitoring information is responded to and presented in a timely manner, including: Obtain real-time status data of the disconnect switch, construct a new virtual DOM tree based on the real-time status data, and attach static identifiers, time sequence identifiers, or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes. Based on the difference between the real-time status data and the data at the previous moment, data change nodes are identified, the change weight of the data change nodes is calculated according to the additional identifier, and a weighted change graph is constructed based on the data change nodes and their parent nodes. Based on the weighted change graph, a difference comparison operation is performed between the new virtual DOM tree and the old virtual DOM tree at the previous moment to obtain a weighted update patch sequence. Patches on the same real DOM element in the weighted update patch sequence are merged to obtain a merged patch sequence, and the total rendering load is calculated according to the operation type of the patch. If the total rendering load does not exceed the preset rendering overhead threshold, the merged patch sequence is treated as an immediate update group and the update is executed immediately. If the total rendering load exceeds the preset rendering overhead threshold, the merged patch sequence is decomposed into a high-weight immediate update group and a low-weight delayed update group according to the patch weight. The high-weight immediate update group is executed immediately and the low-weight delayed update group is scheduled to be executed in a subsequent rendering cycle.
[0004] Furthermore, this invention also relates to a remote visual monitoring system for a 10kV three-phase disconnector switch, comprising: The module is used to acquire real-time status data of the disconnect switch, construct a new virtual DOM tree based on the real-time status data, and attach static identifiers, time sequence identifiers or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes. The calculation module is used to determine the data change node based on the difference between the real-time status data and the data at the previous time, calculate the change weight of the data change node according to the additional identifier, and construct a weighted change graph based on the data change node and its parent node. The update module is used to perform a difference comparison operation between the new virtual DOM tree and the old virtual DOM tree at the previous moment based on the weighted change graph, to obtain a weighted update patch sequence, to merge patches for the same real DOM element in the weighted update patch sequence, to obtain a merged patch sequence, and to calculate the total rendering load according to the operation type of the patch. The decomposition module is used to, when the total rendering load does not exceed a preset rendering overhead threshold, treat the merged patch sequence as an immediate update group and execute the update immediately; when the total rendering load exceeds the preset rendering overhead threshold, decompose the merged patch sequence into a high-weight immediate update group and a low-weight delayed update group according to the patch weight, execute the high-weight immediate update group immediately, and schedule the low-weight delayed update group to be executed in subsequent rendering cycles.
[0005] This invention introduces node identifiers during the construction of a new virtual DOM tree and calculates corresponding change weights based on data change nodes, thereby distinguishing the change type and importance of isolating switch status data. By constructing a weighted change graph and performing a differential comparison between the old and new virtual DOM trees, the comparison range can be narrowed, improving the generation efficiency of update patches. Simultaneously, multiple patches pointing to the same real DOM element are merged, reducing repetitive and redundant DOM update operations. Furthermore, an adaptive rendering scheduling mechanism is established based on the total rendering load assessment results and patch weights. When a large amount of status data changes centrally, update tasks are divided into immediate update groups and delayed update groups, allowing critical status data to be rendered and displayed first, while reducing the risk of interface lag caused by excessive instantaneous rendering overhead. This improves the rendering efficiency, display smoothness, and system stability of the remote visualization monitoring front-end. Attached Figure Description
[0006] Figure 1 A flowchart of a remote visual monitoring method for 10kV three-phase disconnect switches; Figure 2 A schematic diagram for constructing a weighted change graph. Detailed Implementation
[0007] To make the objectives, features, and advantages of this application more apparent and understandable, specific embodiments and accompanying drawings will be used to clearly and completely describe the technical solutions protected by this application. Obviously, the embodiments described below are only some embodiments of this application, and not all embodiments. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.
[0008] This invention proposes a remote visual monitoring method for 10kV three-phase disconnect switches, such as... Figure 1 As shown, it includes: S1, obtain the real-time status data of the disconnect switch, construct a new virtual DOM tree based on the real-time status data, and attach static identifiers, time sequence identifiers or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes.
[0009] Voltage sensors, current sensors, and mechanical position limit switches installed on the 10kV three-phase disconnect switch body are used to collect corresponding electrical parameters and mechanical status. The collected physical signals are then transmitted to the edge computing gateway after analog-to-digital conversion.
[0010] The edge computing gateway sends data acquisition and query commands to the lower-level hardware via RS485 serial port or TCP / IP network socket, reads the returned message byte stream, and parses it according to the corresponding communication protocol to obtain real-time status data. Then, the real-time status data is encapsulated into JSON format and pushed to the front-end monitoring center in real time via WebSocket long connection protocol.
[0011] The front-end monitoring center parses the real-time status data, generates node objects containing element tag names, attribute lists, status values, and child node relationships, and assembles them into a new virtual DOM tree structure starting from the root node. When there is no data from the previous moment or an old virtual DOM tree in the first sampling period, an empty virtual DOM tree is used as the old virtual DOM tree, and the entire current new virtual DOM tree is determined as the initial change range, or all nodes to be rendered in the current new virtual DOM tree are determined as the initial change nodes to perform the first complete rendering.
[0012] Traverse the new virtual DOM tree and read the data fields bound to each node: If the node corresponds to a pure UI layout element that does not change during operation, such as the interface background or title bar, add a static identifier field to the node object; if the node corresponds to telemetry data that changes continuously over time, such as three-phase voltage or three-phase current, add a timing identifier field to the node object; if the node corresponds to discrete and sudden remote signaling states, such as switch open / close status, alarm for incomplete open / close status, or mechanism abnormality alarm, add an event identifier field to the node object.
[0013] As one possible implementation, acquiring the real-time status data of the disconnector switch includes: Issue data collection and query commands; Read the message byte stream returned by the communication port; Extract the values of specified bit segments corresponding to different physical quantities from the message byte stream; The specific numerical values after parsing and conversion are stored in the device status variable field as real-time status data.
[0014] The edge computing gateway sends data acquisition and query commands to the lower-level hardware at a fixed period of 100ms via an RS485 serial port or a TCP / IP network socket. These commands are generated based on either the Modbus-RTU or Modbus-TCP protocol. When using the Modbus-RTU protocol, the command frame includes the device address (0x01), function code (0x03), start register address (0x0010), number of registers to be read (0x0006), and a CRC checksum. When using the Modbus-TCP protocol, the command message includes an MBAP header, function code, start register address, and number of registers to be read fields, but does not include a CRC checksum.
[0015] Call the read function to obtain the message byte stream returned by the lower-level machine.
[0016] Taking the hexadecimal return message body 01030C08FC091A0000000000000001 as an example, 0x0C indicates that the subsequent data area contains 12 data bytes. According to a pre-defined communication protocol dictionary, the specified bit segment value corresponding to the physical quantity is extracted according to the byte offset position of the data area. For example, bytes 1 to 2 (0x08FC) are extracted as the raw data of phase A current, and bytes 11 to 12 (0x0001) are extracted as the raw data of the disconnector switch's open / closed status.
[0017] The extracted hexadecimal bit segments are processed by bitwise shifting, bitwise OR, and masking to convert them into corresponding decimal integers. These integers are then multiplied by the appropriate scaling factor based on the physical quantity type. For example, shifting the first byte of the data area (0x08) left by 8 bits and performing a bitwise OR operation with the second byte (0xFC) yields the original value of phase A current (0x08FC), corresponding to the decimal value 2300. Multiplying this by a scaling factor of 0.1 gives a floating-point current value of 230.0A. For the disconnector status field, 0x0001 is converted to a Boolean value or the integer status value 1 to indicate the "closed" state.
[0018] The specific values obtained from the above analysis and conversion are written into the corresponding variable fields of the device status structure in the system memory. For example, the A-phase current field is assigned the value 230.0, and the switch status field is assigned the value 1, thereby forming a real-time status data object containing multi-dimensional physical quantity parameters, and the real-time status data object is stored in the cache database.
[0019] As one possible implementation, the construction of a new virtual DOM tree based on the real-time state data, and the appending of static identifiers, time-series identifiers, or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes, includes: Instantiate a multi-level struct collection to construct a front-end view mapping; The real-time status data is extracted and populated into the display attribute bar of the corresponding element of the structure collection to construct a new virtual DOM tree; Read the tag discrimination character mapping table in the device configuration file and compare it with each padding attribute category; When an attribute is a static fixed parameter, it is assigned a static identifier; when an attribute is a parameter that evolves continuously over time, it is assigned a temporal identifier; when an attribute is a parameter that undergoes a state transition, it is assigned an event identifier. The set identifier is appended to the parameter layer of the respective associated virtual tree node.
[0020] Generate and instantiate a multi-level structure collection containing node names, attribute objects, and a list of child nodes to form a front-end view mapping representing the interface structure of the 10kV disconnector. Parse the real-time status data object in JSON format, extract the A-phase voltage of 10.5kV and the switch open / closed state 1 values, and assign them to the text nodes or style attributes of the corresponding DOM nodes to construct a new virtual DOM tree for the current rendering cycle.
[0021] Simultaneously, a pre-defined device configuration file is loaded, and the defined tag discrimination character mapping table is extracted. The bound attribute fields of each node in the new virtual DOM tree are then compared by category. If the attribute name of a node is a fixed parameter (device ID), it is identified as a static fixed parameter and assigned the constant enumeration value 0x01 as a static identifier. If the attribute name is a continuous parameter (three-phase voltage or current), it is identified as a parameter that evolves continuously over time and assigned the time sequence identifier 0x02. If the attribute name is a Boolean parameter (switch on / off status or mechanism abnormal alarm), it is identified as a parameter that has undergone a state transition and assigned the event identifier 0x03. The hexadecimal identifier mask determined above is written into the identifier field of the associated virtual DOM tree node.
[0022] S2, based on the difference between the real-time status data and the data at the previous moment, determine the data change node, calculate the change weight of the data change node according to the additional identifier, and construct a weighted change graph based on the data change node and its parent node.
[0023] A mapping table is maintained in the front-end memory to record the old JSON data objects that were parsed at the previous moment. The current real-time status data is compared layer by layer with the old data from the previous moment to identify the field names whose key-value pairs have changed. In the current new virtual DOM tree, the corresponding virtual node is found based on the bound field name and marked as a data change node.
[0024] For each data change node, its identifier field is read to calculate the change weight: if an event identifier is included, the highest level basic alarm weight value is assigned to ensure the highest priority response to emergencies; if a time sequence identifier is included, the absolute change between the current value and the previous value is calculated, and the ratio of the absolute change to the preset baseline value is used as the dimensionless data change ratio, and then an adaptive weight value is obtained based on the weight conversion function; if a static identifier is included, the weight value is set to zero.
[0025] A change graph structure in the form of a directed acyclic graph (DAG) is constructed. All nodes with known data changes are added as target change vertices. Based on the parent-child hierarchy of the virtual DOM tree, the parent nodes of each data change node are traced from bottom to top until the root node of the virtual DOM tree. These traced parent nodes are added as vertices to the DAG. The relationships between parent and child nodes are used as directed edges, and parent nodes along these edges are added as path nodes to the weighted change graph. For parent nodes that have no data changes, their own change weight remains 0, and the maximum change weight in their child path is recorded as the path weight for subsequent traversal and scheduling reference, thus completing the construction of the weighted change graph. The completed weighted change graph structure is as follows: Figure 2 As shown.
[0026] As one possible implementation, the step of calculating the change weight of the data change node based on the additional identifier, and constructing a weighted change graph based on the data change node and its parent node, includes: For nodes with the event identifier, a corresponding dimensionless value is assigned as the floating-point change weight of each node according to the discrete state transition risk level. For nodes with the aforementioned time sequence identifier, dimensionless processing is performed based on the ratio of the data change amount within the current sampling period to the preset benchmark value, and the floating-point change weight of each node is calculated based on the weight conversion function. Iterate through and filter data structure nodes whose attribute values have changed relative to the previous time step and whose change weight is greater than 0 as data change nodes; Extract the parent node elements of the data change nodes layer by layer upwards until the root node is reached; The weighted change graph is obtained by summarizing the set of structural models that include the data change nodes and their parent nodes along the path.
[0027] For nodes with event identifiers, query the pre-configured risk level mapping dictionary. When a node attribute corresponds to a serious event such as an abnormal separation / merger state, an incomplete separation / merger state, or an institutional anomaly, its risk level is set to the highest level, and a floating-point change weight of 100.0 is assigned. When a node attribute corresponds to a status change of a regular user operation instruction receipt, a floating-point change weight of 50.0 is assigned.
[0028] For nodes with time-series identifiers, the data values of the previous period (100.0) and the current period (105.0) are extracted, and the absolute difference between them is calculated to obtain an absolute change of 5.0. This absolute change is then divided by the rated baseline value of the corresponding physical quantity, such as a current baseline value of 100A, to obtain a dimensionless data change ratio of 0.05. The floating-point change weight of the time-series node is calculated using the weight conversion function W=min(WTmax, W0+K×R), where W0 is the basic weight of the time-series node, K is the proportional coefficient, R is the dimensionless data change ratio, and WTmax is the preset upper limit of the time-series weight, which is lower than the minimum weight of the event node. For example, when W0 is 1.0, K is 100.0, and R is 0.05, the calculated floating-point change weight of the time-series node is 6.0.
[0029] Traversing the entire new virtual DOM tree, the process first determines whether the attribute values bound to a node have changed relative to the previous time step. For nodes whose attribute values have not changed, their change weight is set to 0.0 and they are excluded from the list of data-changed nodes. For nodes whose attribute values have changed, the corresponding change weight is calculated based on their node identifier, and nodes whose attribute values have changed and whose change weight is greater than 0.0 are selected and marked as data-changed nodes. For each marked data-changed node, the parent node pointer in its memory data structure is read, and the process iterates upwards layer by layer, recording the parent node references along the way, until the top-level node representing the root container of the interface is reached.
[0030] All data change nodes and their parent nodes along each backtracking path are stored in a deduplication set, forming a directed acyclic weighted change graph structure. When a parent node connects to multiple data change nodes, the maximum change weight among its downstream data change nodes is used as the path weight of that parent node. If the parent node itself is also a data change node, the larger of its own change weight and the maximum change weight of its downstream nodes is used as the path weight of that parent node.
[0031] S3. Based on the weighted change graph, perform a difference comparison operation between the new virtual DOM tree and the old virtual DOM tree at the previous moment to obtain a weighted update patch sequence. Merge the patches for the same real DOM element in the weighted update patch sequence to obtain a merged patch sequence and calculate the total rendering load according to the operation type of the patch.
[0032] Starting from the root vertex of the weighted change graph, a breadth-first traversal is performed along the directed edges. During the traversal, only the paths of nodes located in the weighted change graph are compared at the same level, and branches of nodes not yet included in the weighted change graph are skipped to narrow the comparison scope. The comparison includes the element type, attribute values, and text content of corresponding nodes in the old and new virtual DOM trees. When a difference is detected, a patch object is generated. This patch object records the unique identifier of the target node, the operation type, the specific change content, and the node weight inherited from the weighted change graph. The generated patch objects are sequentially written into the patch sequence to obtain the weighted update patch sequence.
[0033] The weighted update patch sequence is traversed, and patch objects are categorized according to the unique identifier of the real DOM element. For multiple patches pointing to the same real DOM element, object attribute merging is performed. For example, a color modification patch and a position translation patch for the same switch element are merged into a single comprehensive attribute modification patch to reduce redundant update operations, thus obtaining a merged patch sequence. The merged comprehensive attribute modification patch uses the maximum value among the weights of the patches participating in the merge as the final patch weight.
[0034] Pre-set corresponding load factors for different DOM operation types: set the load factor for creating or deleting DOM elements to a higher level, the load factor for modifying the geometry of DOM elements to a medium level, and the load factor for modifying only the text content or background color of DOM elements to a lower level. Read the operation type of each patch in the merged patch sequence and map it to obtain the corresponding load factor. Sum the load factors corresponding to each patch to obtain the total rendering load value.
[0035] As one possible implementation, the step of performing a difference comparison operation between the new virtual DOM tree and the old virtual DOM tree at the previous time step based on the weighted change graph to obtain a weighted update patch sequence includes: Read the old virtual DOM tree and the weighted change graph; Extract the label type and key value of the node to be processed, and obtain the structural hash value of the list of sibling nodes through hash calculation; When the structure hash values of the sibling child node lists of the new and old virtual DOM trees to be compared are consistent, the comparison of newly added, deleted, and moved nodes is removed, and only the modified node attributes are compared. When a node with the static identifier is matched and the parent node has no structural changes, the comparison of the node's own attributes is skipped and the comparison of the child nodes continues. The nodes with content differences are aggregated to generate a patch operation sequence, and the change weights are assigned to the patch parameters to obtain the weighted update patch sequence.
[0036] The old virtual DOM tree instance object from the previous rendering cycle is deserialized from the memory cache, and a weighted change graph object containing valid change paths is loaded.
[0037] When entering the comparison loop for sibling nodes in the tree, all child nodes at the same level are traversed, and their tag types and unique keys are extracted. A digest operation is performed on the concatenated strings of all nodes at the current level to generate structural hash values for the new and old trees, such as 0xA1B2C3D4. When the structural hash value of the new tree's sibling node list is found to be completely equal to that of the old tree, it indicates that no DOM nodes have been added, removed, or rearranged at that level. Logical checks for node addition, removal, and displacement are then disabled, and a depth-first traversal at the attribute level begins. When the structural hash value of the new tree's sibling node list is inconsistent with that of the old tree, differential comparisons for node addition, deletion, and repositioning are performed, and corresponding structural class patches are generated based on the comparison results.
[0038] When a node to be compared is detected to have an assigned static identifier 0x01 in its attribute layer, and it is confirmed in the weighted change graph that its parent node has not undergone structural changes, if the static identifier node exists only as a path node to the downstream data change node, the comparison operation of each specific key-value pair in the node's own attribute object is interrupted, the layer check is quickly skipped, and the comparison of its underlying child nodes continues.
[0039] For nodes that have undergone text replacement or style modification, instantiate a patch object containing the operation type, node identifier, difference content, and weight. At the same time, assign the floating-point change weight, such as 100.0, calculated in the previous step and attached to the node to the patch parameter. If the node itself has a weight of 0 and is only used as a path node, assign the maximum path weight of its corresponding subpath to the patch parameter. Collect all patch objects in sequence and output a weighted update patch sequence with weights.
[0040] As one possible implementation, merging patches for the same real DOM element in the weighted update patch sequence to obtain a merged patch sequence and calculating the total rendering load based on the patch operation type includes: Traverse the weighted update patch sequence, find multiple attribute change patches that indicate the same real DOM element, and merge them into a batch command to obtain a merged patch sequence; The total rendering load is calculated based on the operation type and node level corresponding to each patch in the merged patch sequence.
[0041] In the main thread, the weighted update patch sequence array is iterated through, and the target element identifier is used as the key using a hash map. If a patch that changes the text color and a patch that updates the text value exist for the same target element, these multiple scattered patches are aggregated into a single batch instruction containing multiple attribute updates. This constructs a streamlined and deduplicated merged patch sequence, and the maximum value among the weights of the patches participating in the merge is recorded as the patch weight of the batch instruction.
[0042] The system reads the preset performance evaluation constant table, assigns a base overhead value to the operation type (e.g., style update is 2.0, reflow is 5.0), and combines it with the amplification factor of the DOM tree depth where the node is located (e.g., the factor for the 3rd level is 1.3). Using the formula Load Value = Operation Type Base Overhead × Level Factor, the system accumulates the calculation results of each patch in the sequence to calculate the floating-point total rendering load parameter representing the rendering pressure of the current frame, for example, 45.5.
[0043] S4. When the total rendering load does not exceed the preset rendering overhead threshold, the merged patch sequence is treated as an immediate update group and the update is executed immediately. When the total rendering load exceeds the preset rendering overhead threshold, the merged patch sequence is decomposed into a high-weight immediate update group and a low-weight delayed update group according to the patch weight. The high-weight immediate update group is executed immediately and the low-weight delayed update group is scheduled to be executed in subsequent rendering cycles.
[0044] During initialization, a preset rendering overhead threshold is set in the configuration file. This threshold is a relative load threshold obtained through benchmark rendering tests, representing the upper limit of DOM operations that can be handled within the preset single-frame main thread execution time budget. It is determined by the correspondence between DOM operation time and load score in historical rendering tests. The calculated total rendering load value is compared with the preset rendering overhead threshold. If the total rendering load value is less than or equal to the preset rendering overhead threshold, the entire merged patch sequence is treated as an immediate update group, and the corresponding DOM modification operations are executed through the front-end rendering interface to refresh the monitoring screen.
[0045] If the total rendering load exceeds the preset rendering overhead threshold, the merged patch sequence is sorted in descending order based on the node weight values recorded in the patch object, and event-type patches are prioritized for inclusion in the high-weight immediate update group. If no event-type patches exist, the patch with the highest weight is included in the high-weight immediate update group. When the load coefficient of a single event-type patch exceeds the preset rendering overhead threshold, it is determined whether the event-type patch can be split into multiple sub-patches. If it can be split, it is executed in batches according to the sub-patches. If it cannot be split, the event-type patch is executed separately as a critical event exception patch, and this execution is recorded as an over-threshold priority alarm update. At the same time, the remaining patches are assigned to the low-weight delayed update group. When the load coefficient of a single event-type patch does not exceed the preset rendering overhead threshold, the load coefficient is accumulated one by one starting from the patch with the highest weight. The cutoff point of the high-weight immediate update group is determined under the condition that it does not exceed the preset rendering overhead threshold, and the remaining patches are assigned to the low-weight delayed update group.
[0046] High-weight immediate update groups are executed through the front-end rendering interface to prioritize the presentation of critical alarm information such as abnormal opening / closing status of isolating switches, incomplete opening / closing status, or mechanical malfunctions. Low-weight delayed update groups are registered as pending patch queues and added to the scheduling process of subsequent rendering cycles. In each subsequent rendering cycle, low-weight patches are executed in batches according to the remaining frame budget. If the budget for the current cycle is insufficient, it is postponed to the next rendering cycle. After the immediate update groups are executed, the differential comparison benchmark for the next sampling cycle is jointly maintained based on the virtual DOM state corresponding to the executed patches and the pending patch queue. After the low-weight delayed update groups are processed, the cache state of the corresponding nodes is updated synchronously and used as the old data object and old virtual DOM tree for differential comparison in the next sampling cycle.
[0047] If a new patch pointing to the same real DOM element and the same attribute field is generated in the next sampling period while the low-weight delayed update group has not yet been completed, the old patch in the pending patch queue will be replaced with the patch corresponding to the newer sampling period, or the two will be merged into an update patch based on the latest state value. The patches in the pending patch queue carry the sampling period version number. Before execution, their version number will be checked, and patches with a version lower than the current cached state version will not be executed.
[0048] This invention also proposes a remote visual monitoring system for a 10kV three-phase disconnector, comprising the following modules: The module is used to acquire real-time status data of the disconnect switch, construct a new virtual DOM tree based on the real-time status data, and attach static identifiers, time sequence identifiers or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes. The calculation module is used to determine the data change node based on the difference between the real-time status data and the data at the previous time, calculate the change weight of the data change node according to the additional identifier, and construct a weighted change graph based on the data change node and its parent node. The update module is used to perform a difference comparison operation between the new virtual DOM tree and the old virtual DOM tree at the previous moment based on the weighted change graph, to obtain a weighted update patch sequence, to merge patches for the same real DOM element in the weighted update patch sequence, to obtain a merged patch sequence, and to calculate the total rendering load according to the operation type of the patch. The decomposition module is used to, when the total rendering load does not exceed a preset rendering overhead threshold, treat the merged patch sequence as an immediate update group and execute the update immediately; when the total rendering load exceeds the preset rendering overhead threshold, decompose the merged patch sequence into a high-weight immediate update group and a low-weight delayed update group according to the patch weight, execute the high-weight immediate update group immediately, and schedule the low-weight delayed update group to be executed in subsequent rendering cycles.
[0049] As one possible implementation, acquiring the real-time status data of the disconnector switch includes: Issue data collection and query commands; Read the message byte stream returned by the communication port; Extract the values of specified bit segments corresponding to different physical quantities from the message byte stream; The specific numerical values after parsing and conversion are stored in the device status variable field as real-time status data.
[0050] As one possible implementation, the construction of a new virtual DOM tree based on the real-time state data, and the appending of static identifiers, time-series identifiers, or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes, includes: Instantiate a multi-level struct collection to construct a front-end view mapping; The real-time status data is extracted and populated into the display attribute bar of the corresponding element of the structure collection to construct a new virtual DOM tree; Read the tag discrimination character mapping table in the device configuration file and compare it with each padding attribute category; When an attribute is a static fixed parameter, it is assigned a static identifier; when an attribute is a parameter that evolves continuously over time, it is assigned a temporal identifier; when an attribute is a parameter that undergoes a state transition, it is assigned an event identifier. The set identifier is appended to the parameter layer of the respective associated virtual tree node.
[0051] As one possible implementation, the step of calculating the change weight of the data change node based on the additional identifier, and constructing a weighted change graph based on the data change node and its parent node, includes: For nodes with the event identifier, a corresponding dimensionless value is assigned as the floating-point change weight of each node according to the discrete state transition risk level. For nodes with the aforementioned time sequence identifier, dimensionless processing is performed based on the ratio of the data change amount within the current sampling period to the preset benchmark value, and the floating-point change weight of each node is calculated based on the weight conversion function. Iterate through and filter data structure nodes whose attribute values have changed relative to the previous time step and whose change weight is greater than 0 as data change nodes; Extract the parent node elements of the data change nodes layer by layer upwards until the root node is reached; The weighted change graph is obtained by summarizing the set of structural models that include the data change nodes and their parent nodes along the path.
[0052] As one possible implementation, the step of performing a difference comparison operation between the new virtual DOM tree and the old virtual DOM tree at the previous time step based on the weighted change graph to obtain a weighted update patch sequence includes: Read the old virtual DOM tree and the weighted change graph; Extract the label type and key value of the node to be processed, and obtain the structural hash value of the list of sibling nodes through hash calculation; When the structure hash values of the sibling child node lists of the new and old virtual DOM trees to be compared are consistent, the comparison of newly added, deleted, and moved nodes is removed, and only the modified node attributes are compared. When a node with the static identifier is matched and the parent node has no structural changes, the comparison of the node's own attributes is skipped and the comparison of the child nodes continues. The nodes with content differences are aggregated to generate a patch operation sequence, and the change weights are assigned to the patch parameters to obtain the weighted update patch sequence.
[0053] As one possible implementation, merging patches for the same real DOM element in the weighted update patch sequence to obtain a merged patch sequence and calculating the total rendering load based on the patch operation type includes: Traverse the weighted update patch sequence, find multiple attribute change patches that indicate the same real DOM element, and merge them into a batch command to obtain a merged patch sequence; The total rendering load is calculated based on the operation type and node level corresponding to each patch in the merged patch sequence.
[0054] The above description of the disclosed embodiments enables those skilled in the art to make or use this application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the general principles defined herein may be implemented in other embodiments without departing from the spirit or scope of this application. Therefore, this application is not to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims
1. A method for remote visual monitoring of a 10kV three-phase disconnector switch, characterized in that, include: Obtain real-time status data of the disconnect switch, construct a new virtual DOM tree based on the real-time status data, and attach static identifiers, time sequence identifiers or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes. Based on the difference between the real-time status data and the data at the previous moment, data change nodes are identified, the change weight of the data change nodes is calculated according to the additional identifier, and a weighted change graph is constructed based on the data change nodes and their parent nodes. Based on the weighted change graph, a difference comparison operation is performed between the new virtual DOM tree and the old virtual DOM tree at the previous moment to obtain a weighted update patch sequence. Patches on the same real DOM element in the weighted update patch sequence are merged to obtain a merged patch sequence, and the total rendering load is calculated according to the operation type of the patch. If the total rendering load does not exceed the preset rendering overhead threshold, the merged patch sequence is treated as an immediate update group and the update is executed immediately. If the total rendering load exceeds the preset rendering overhead threshold, the merged patch sequence is decomposed into a high-weight immediate update group and a low-weight delayed update group according to the patch weight. The high-weight immediate update group is executed immediately and the low-weight delayed update group is scheduled to be executed in a subsequent rendering cycle.
2. The method according to claim 1, characterized in that, The acquisition of real-time status data of the disconnector includes: Issue data collection and query commands; Read the message byte stream returned by the communication port; Extract the values of specified bit segments corresponding to different physical quantities from the message byte stream; The specific numerical values after parsing and conversion are stored in the device status variable field as real-time status data.
3. The method according to claim 1 or 2, characterized in that, The process of constructing a new virtual DOM tree based on the real-time status data, and attaching static identifiers, time-series identifiers, or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes, includes: Instantiate a multi-level struct collection to construct a front-end view mapping; The real-time status data is extracted and populated into the display attribute bar of the corresponding element of the structure collection to construct a new virtual DOM tree; Read the tag discrimination character mapping table in the device configuration file and compare it with each padding attribute category; When an attribute is a static fixed parameter, it is assigned a static identifier; when an attribute is a parameter that evolves continuously over time, it is assigned a temporal identifier; when an attribute is a parameter that undergoes a state transition, it is assigned an event identifier. The set identifier is appended to the parameter layer of the respective associated virtual tree node.
4. The method according to claim 1, characterized in that, The step of calculating the change weight of the data change node based on the additional identifier, and constructing a weighted change graph based on the data change node and its parent node, includes: For nodes with the event identifier, a corresponding dimensionless value is assigned as the floating-point change weight of each node according to the discrete state transition risk level. For nodes with the aforementioned time sequence identifier, dimensionless processing is performed based on the ratio of the data change amount within the current sampling period to the preset benchmark value, and the floating-point change weight of each node is calculated based on the weight conversion function. Iterate through and filter data structure nodes whose attribute values have changed relative to the previous time step and whose change weight is greater than 0 as data change nodes; Extract the parent node elements of the data change nodes layer by layer upwards until the root node is reached; The weighted change graph is obtained by summarizing the set of structural models that include the data change nodes and their parent nodes along the path.
5. The method according to claim 1, characterized in that, Based on the weighted change graph, a difference comparison operation is performed between the new virtual DOM tree and the old virtual DOM tree at the previous time step to obtain a weighted update patch sequence, including: Read the old virtual DOM tree and the weighted change graph; Extract the label type and key value of the node to be processed, and obtain the structural hash value of the list of sibling nodes through hash calculation; When the structure hash values of the sibling child node lists of the new and old virtual DOM trees to be compared are consistent, the comparison of newly added, deleted, and moved nodes is removed, and only the modified node attributes are compared. When a node with the static identifier is matched and the parent node has no structural changes, the comparison of the node's own attributes is skipped and the comparison of the child nodes continues. The nodes with content differences are aggregated to generate a patch operation sequence, and the change weights are assigned to the patch parameters to obtain the weighted update patch sequence.
6. The method according to claim 1, characterized in that, The process of merging patches for the same real DOM element in the weighted update patch sequence to obtain a merged patch sequence and calculating the total rendering load based on the patch operation type includes: Traverse the weighted update patch sequence, find multiple attribute change patches that indicate the same real DOM element, and merge them into a batch command to obtain a merged patch sequence; The total rendering load is calculated based on the operation type and node level corresponding to each patch in the merged patch sequence.
7. A remote visual monitoring system for a 10kV three-phase disconnector switch, characterized in that, include: The module is used to acquire real-time status data of the disconnect switch, construct a new virtual DOM tree based on the real-time status data, and attach static identifiers, time sequence identifiers or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes. The calculation module is used to determine the data change node based on the difference between the real-time status data and the data at the previous time, calculate the change weight of the data change node according to the additional identifier, and construct a weighted change graph based on the data change node and its parent node. The update module is used to perform a difference comparison operation between the new virtual DOM tree and the old virtual DOM tree at the previous moment based on the weighted change graph, to obtain a weighted update patch sequence, to merge patches for the same real DOM element in the weighted update patch sequence, to obtain a merged patch sequence, and to calculate the total rendering load according to the operation type of the patch. The decomposition module is used to, when the total rendering load does not exceed a preset rendering overhead threshold, treat the merged patch sequence as an immediate update group and execute the update immediately; when the total rendering load exceeds the preset rendering overhead threshold, decompose the merged patch sequence into a high-weight immediate update group and a low-weight delayed update group according to the patch weight, execute the high-weight immediate update group immediately, and schedule the low-weight delayed update group to be executed in subsequent rendering cycles.
8. The system according to claim 7, characterized in that, The acquisition of real-time status data of the disconnector includes: Issue data collection and query commands; Read the message byte stream returned by the communication port; Extract the values of specified bit segments corresponding to different physical quantities from the message byte stream; The specific numerical values after parsing and conversion are stored in the device status variable field as real-time status data.
9. The system according to claim 7, characterized in that, The process of constructing a new virtual DOM tree based on the real-time status data, and attaching static identifiers, time-series identifiers, or event identifiers to each node of the new virtual DOM tree according to the change characteristics of the data corresponding to the nodes, includes: Instantiate a multi-level struct collection to construct a front-end view mapping; The real-time status data is extracted and populated into the display attribute bar of the corresponding element of the structure collection to construct a new virtual DOM tree; Read the tag discrimination character mapping table in the device configuration file and compare it with each padding attribute category; When an attribute is a static fixed parameter, it is assigned a static identifier; when an attribute is a parameter that evolves continuously over time, it is assigned a temporal identifier; when an attribute is a parameter that undergoes a state transition, it is assigned an event identifier. The set identifier is appended to the parameter layer of the respective associated virtual tree node.
10. The system according to claim 7, characterized in that, The step of calculating the change weight of the data change node based on the additional identifier, and constructing a weighted change graph based on the data change node and its parent node, includes: For nodes with the event identifier, a corresponding dimensionless value is assigned as the floating-point change weight of each node according to the discrete state transition risk level. For nodes with the aforementioned time sequence identifier, dimensionless processing is performed based on the ratio of the data change amount within the current sampling period to the preset benchmark value, and the floating-point change weight of each node is calculated based on the weight conversion function. Iterate through and filter data structure nodes whose attribute values have changed relative to the previous time step and whose change weight is greater than 0 as data change nodes; Extract the parent node elements of the data change nodes layer by layer upwards until the root node is reached; The weighted change graph is obtained by summarizing the set of structural models that include the data change nodes and their parent nodes along the path.
