Industrial cutting machine wireless communication method based on multi-channel redundant switching
By constructing composite tags and performing tag comparison in the wireless communication of industrial cutting machines, and dynamically adjusting the write address, the problem of data overlap during channel switching is solved, the stability and security of the system are improved, and command mis-execution and equipment failure are avoided.
Patent Information
- Application Number
- CN202511475862.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2025-10-16
- Publication Date
- 2026-02-03
- Estimated Expiration
- 2045-10-16
AI Technical Summary
Existing wireless communication technologies for industrial cutting machines based on multi-channel redundancy switching fail to effectively identify and prevent the risk of data overlap between channels during channel switching, leading to abnormal command data structures, parsing failures, or command mis-execution, which may cause systemic failures such as cutting path deviation, increased control delay, and workpiece damage.
By constructing a composite tag containing communication channel characteristic fields, communication identifiers, and instruction type fields, and embedding it in the data header of control instructions, precise source identification of each instruction is achieved. Before writing to the transmit/receive buffer, a tag comparison operation is performed to determine if there is a conflict risk, and writing is stopped if a conflict exists. The write permissions and address distribution of the communication channel are dynamically allocated, and by constructing a conflict tag feature set and interference distance rules, address segments with the lowest conflict risk are selected for writing.
It effectively solves the data overwrite problem during the BLE and UDP channel switching phase, improves the security and controllability of control command writing, enhances the stability and fault tolerance of industrial cutting control systems in multi-channel communication scenarios, and ensures the real-time and balanced allocation of communication resources.
Smart Images

Figure CN120957201B_ABST
Abstract
Description
TECHNICAL FIELD
[0001] The present application relates to the technical field of wireless communication of industrial cutting machines, and particularly relates to a wireless communication method of industrial cutting machines based on multi-channel redundant switching. BACKGROUND
[0002] Industrial cutting machines are high-power equipment widely used in material processing fields such as metal and stone. With the development of industrial automation and intelligent manufacturing, the control mode of industrial cutting machines is gradually changing from traditional wired control to wireless communication. Wireless communication of industrial cutting machines usually refers to the completion of control instruction issuing, state data acquisition and operation log returning between the main control system and the cutting execution mechanism through wireless signals. Due to the characteristics of strong electromagnetic interference, dense equipment and high real-time and reliable communication requirements in industrial field, a communication architecture based on multi-channel redundant switching has emerged. Multi-channel redundant switching refers to the simultaneous integration of multiple wireless communication channels (such as CAN bus, Bluetooth BLE, UDP, TCP, etc.) in the system, and according to the dynamic evaluation results of channel quality, priority scheduling and real-time switching between multiple channels are performed to realize high-reliable transmission of control instructions and monitoring data. This method can quickly switch to a backup channel when a certain channel performance decreases or is interfered, ensuring stable operation of the equipment, and is particularly suitable for high-speed, high-precision and uninterrupted operation requirements of industrial cutting scenes.
[0003] The existing wireless communication technology of industrial cutting machines based on multi-channel redundant switching usually adopts the mode of multiple communication protocols working together to realize remote control and data interaction of industrial cutting machines. The core is to improve the stability and real-time performance of the communication system through parallel management and dynamic switching of multiple communication channels (such as CAN, BLE, UDP, TCP, etc.). This technology usually includes the following key links: first, the system sets data type division and priority scheduling strategy for different channels, for example, high real-time instructions are transmitted through CAN or BLE, state data is transmitted through UDP, and logs and large data files are transmitted through TCP; second, the communication module monitors the quality indicators of each channel in real time, such as packet loss rate, delay, throughput, etc., and evaluates the channel state based on a scoring algorithm; when the quality of the main channel decreases below the set threshold, the system automatically switches to the suboptimal channel to realize seamless redundant transmission of instructions and data; in addition, the communication system also involves forward error correction, breakpoint resume, CRC check and other protection mechanisms to improve data integrity and security, so as to ensure that the industrial cutting machine can realize wireless communication and remote control continuously and reliably in complex industrial environments.
[0004] The existing technology has the following deficiencies:
[0005] In the wireless communication process of industrial cutting machines, communication structures based on multi-channel redundancy switching typically configure BLE and UDP channels as primary and backup channels to redundantly transmit critical control commands, and share a physical transmit / receive buffer at the underlying level to reduce hardware resource consumption. When the communication quality of the BLE channel deteriorates and triggers the switching mechanism, the system immediately retransmits the control commands through the UDP channel. However, during the switching process, because there may still be control command data that has not been completely cleared in the BLE channel, and the system does not perform source identification and isolation management of the data written to each channel in the buffer, the new command data of the UDP channel may physically overlap with the residual data of the BLE channel when it is written to the buffer, resulting in partial overwriting of the command data and the generation of abnormal data frames. Existing wireless communication technologies for industrial cutting machines based on multi-channel redundancy switching cannot identify and prevent the risk of data overlap between channels based on the "data write source when different channels share the transmit / receive buffer during the channel switching phase". This is mainly because existing designs do not introduce channel-level data identification or conflict checking mechanisms, which can cause abnormal command data structures, parsing failures, or command malfunctions, further leading to cutting path deviation, increased control delay, and in severe cases, systemic failures such as cutter head malfunction and workpiece damage.
[0006] The information disclosed in the background section is only intended to enhance the understanding of the background of this disclosure, and therefore may include information that does not constitute prior art known to those skilled in the art. Summary of the Invention
[0007] The purpose of this invention is to provide a wireless communication method for industrial cutting machines based on multi-channel redundancy switching, so as to solve the problems in the background art mentioned above.
[0008] To achieve the above objectives, the present invention provides the following technical solution: a wireless communication method for industrial cutting machines based on multi-channel redundancy switching, specifically including the following steps:
[0009] S1. Combine and encode the channel characteristic field, communication identifier and instruction type of the communication channel used to transmit control instructions to generate a composite tag and write it into the data header of the control instruction.
[0010] S2. Before writing control commands to the transmit / receive buffer, perform a tag comparison operation on the target buffer address based on the composite tag in the control command to determine whether there is a source conflict risk at the address. If there is, stop the current writing.
[0011] S3. After writing is aborted, perform buffer address reallocation operation. Based on the preset interference distance rule, select the address segment with the lowest risk of conflict with the composite tag from the current buffer as the new writing target of the control command.
[0012] S4. After writing the control command to the new address, construct index data containing channel label, address segment, command type and transmission status, which is used by the receiving end to perform label consistency retrieval before parsing the control command.
[0013] S5. Based on the collision frequency, channel scoring trend, and buffer usage density, perform parameter adjustment operations based on weighted thresholds to dynamically allocate the write permissions, address distribution, and collision remapping parameters of the communication channel.
[0014] Preferably, S1 specifically includes:
[0015] The channel type number, frequency allocation code, maximum transmission unit bytes, current instantaneous bit error rate, and channel rating level of the communication channel used to transmit control commands are converted into a unified format to generate channel feature fields.
[0016] The channel feature field, communication identifier, and instruction type of control command are sequentially concatenated to form the initial encoding structure, and a check field is generated through double parity check to form a composite tag.
[0017] The composite tag is embedded in the fixed tag area of the data header of the control command, and the frame start flag and length description field are written at the end of the tag area to complete the writing operation of the composite tag.
[0018] Preferably, S2 specifically includes:
[0019] Extract the composite tag embedded in the data header from the control command, and parse it into a communication channel feature field, a communication identifier field, and a command type field to generate a tag hash code;
[0020] Based on the target buffer address to be written to by the control command, retrieve the tag record unit corresponding to that address, and load the hash code of the data source and the write status information of the last time the data was written to that address;
[0021] The current tag hash code is compared with the historical tag hash codes in the tag record unit at the field level, and the source conflict risk of the target address is determined based on the comparison result.
[0022] When a source conflict risk is detected, the writing of control commands is stopped, and address locking and conflict event logging operations are performed.
[0023] Preferably, the current tag hash code is compared with the historical tag hash codes in the tag record unit at the field level, and the source conflict risk of the target address is determined based on the comparison result. The specific judgment logic is as follows:
[0024] Compare the communication channel feature field of the current control command with the communication channel feature field in the historical tag hash code. If they match, continue to compare whether the write cycle bit of the current control command and the write cycle bit in the historical record are in the same write time slot.
[0025] When the communication channel feature fields are inconsistent, compare whether the instruction type field of the current control instruction is consistent with the instruction type field in the historical tag hash code, and determine whether the difference between the timestamp of the current control instruction and the timestamp of the historical record is less than the preset time threshold.
[0026] When the communication channel feature fields are consistent and the write cycle bit is in the same write time slot, or when the instruction type fields are consistent and the timestamp difference is less than the preset time threshold, it is determined that there is a risk of source conflict in the target buffer address.
[0027] Preferably, S3 specifically includes:
[0028] After writing is aborted, the tag hash code corresponding to the control command to abort writing is extracted. Combined with the comparison result generated in the tag comparison operation, a conflict tag feature set containing the communication channel field, command type field and writing cycle bit is constructed.
[0029] Based on the conflict label feature set, a preliminary mapping operation with preset interference distance rules is performed to divide the buffer logical address into multiple mutually exclusive write regions and assign a conflict tolerance score to each address segment;
[0030] Based on the conflict tolerance score, buffer activity and expected write cycle conflict probability, the candidate address segment set is filtered and the target address segment with the highest priority is located.
[0031] Write the control command to the address within the target address segment based on the perturbation offset of the tag hash code tail, and update the corresponding write record in the buffer address mapping table.
[0032] Preferably, a preliminary mapping operation based on a preset interference distance rule is performed according to the conflict label feature set, specifically as follows:
[0033] Based on the communication channel field, instruction type field, and write cycle bit in the conflict label feature set, they are encoded into fixed-length fields and combined into a fixed-length vector in a unified order. Each field in the fixed-length vector is multiplied by a set weight, summed, and normalized to obtain the corresponding logical coordinate value. The logical coordinate value is used as the theoretical write center position of the corresponding control instruction in the buffer address space. A conflict buffer shield is generated based on the interference weight and the standard minimum write interval. The address segment corresponding to the buffer shield is marked as a high-interference area and assigned a low conflict tolerance score for subsequent address filtering operations.
[0034] Preferably, based on the conflict tolerance score, buffer activity, and expected write cycle conflict probability, the candidate address segment set is filtered, and the highest priority target address segment is located, specifically:
[0035] A three-dimensional evaluation matrix is constructed, which includes conflict tolerance score, buffer activity and predicted write conflict probability, and a scoring item is established for logical address segments in all idle states.
[0036] Normalization is performed on each scoring item, and a comprehensive priority index for each address segment is calculated accordingly to quantify the risk level of the current instruction write.
[0037] Sort according to priority index value, and combine the write density map in the current time slot with the spatial distribution curve of written tags to eliminate high-frequency write center area and overlapping boundary section;
[0038] From the remaining address segments after removal, select the address segment with the lowest overall priority index and a balanced spatial distribution as the target write location for the current control instruction.
[0039] Preferably, S4 specifically includes:
[0040] Extract four fields from the control command: channel label, address segment, command type, and transmission status, and combine them in a preset structural order to construct a complete index data structure.
[0041] The index data structure is archived hierarchically according to channel label and instruction type, and the address range and transmission status are recorded using key-value mapping. At the same time, its arrangement order in the storage structure is dynamically adjusted according to the access frequency.
[0042] Generate a synchronization data digest containing a channel tag hash digest, address start position, instruction type encoding, and transmission status bitmap identifier, and push it to the receiving end through a high-priority channel to activate the consistency retrieval process;
[0043] After the receiving end completes the consistency verification, it registers the index data in the local index log in the form of a snapshot, and generates structural fingerprint information for subsequent tracking, backtracking and data reconstruction.
[0044] Preferably, S5 specifically includes:
[0045] Collect the conflict feedback status of the communication channel during the communication cycle, construct a conflict behavior model and generate an address conflict heat map, and assign different conflict risk levels based on the number of segment conflicts.
[0046] The scoring parameters of the communication channels are statistically analyzed over multiple periods to form a scoring trend curve, and a channel priority matrix is constructed to adjust the write permissions and access configurations of each channel.
[0047] Calculate the usage density of the logical address segment in the buffer and spatially overlay it with the label conflict heatmap to generate a risk weight factor model to guide the priority allocation of address resources;
[0048] A multi-factor weighting function is constructed and compared with a set threshold. Based on the scoring results, the channel access permissions, address segment allocation rules and label conflict remapping configuration are dynamically adjusted to achieve dynamic control of the write scheduling strategy.
[0049] The technical effects and advantages provided by the present invention in the above technical solution are as follows:
[0050] 1. This invention effectively solves the problem of overlapping control command writes and data overwriting caused by the sharing of transmit and receive buffers between BLE and UDP channels during handover. By constructing a composite tag containing communication channel characteristic fields, communication identifiers, and command type fields, and embedding it in the control command data header, precise source identification of each command is achieved. Before writing control commands into the transmit and receive buffer, the system performs a tag comparison operation on the target address range, making field-level judgments based on the source hash code and conflict rules. If a conflict risk exists, writing is stopped and an address locking operation is performed to avoid cross-channel write confusion. Simultaneously, the system dynamically filters write addresses by constructing a conflict tag feature set, performing interference distance rule mapping, and combining conflict tolerance scoring with a multi-factor optimization strategy. This achieves isolated writing in the physical space of the buffer, effectively reducing the probability of spatial overlap of control data during high-frequency handover and enhancing the security and controllability of the writing process.
[0051] 2. This invention constructs an index data structure by processing information such as channel tags, address segments, command types, and transmission status generated after control commands are written. Combined with a channel priority matrix, conflict heatmap, and buffer density model, it forms a closed-loop process including index pushing, tag consistency verification, and dynamic adjustment, thereby achieving tag-level pre-identification and parsing protection at the receiving end. The system further constructs a multi-factor weighted scheduling mechanism based on conflict frequency, channel scoring trends, and spatial density to dynamically adjust the write permissions and mapping parameters of communication channels. This avoids resource contention caused by continuous writing of high-risk channels into the same segment, ensuring the real-time and balanced allocation of communication resources. Through the synergy of the above multi-layered protection mechanisms and adaptive adjustment strategies, the stability, fault tolerance, and system security of the industrial cutting control system in multi-channel communication scenarios are significantly improved, demonstrating strong engineering application value and promising prospects for widespread adoption. Attached Figure Description
[0052] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments recorded in this invention. For those skilled in the art, other drawings can be obtained based on these drawings.
[0053] Figure 1 This is a flowchart illustrating a wireless communication method for industrial cutting machines based on multi-channel redundancy switching according to the present invention. Detailed Implementation
[0054] Exemplary embodiments will now be described more fully with reference to the accompanying drawings. However, these exemplary embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, they are provided so that the description of this disclosure will be more complete and fully convey the concept of the exemplary embodiments to those skilled in the art.
[0055] This invention provides, for example Figure 1 The method for wireless communication of an industrial cutting machine based on multi-channel redundancy switching, as shown, specifically includes the following steps:
[0056] S1. Combine and encode the channel characteristic field, communication identifier and instruction type of the communication channel used to transmit control instructions to generate a composite tag and write it into the data header of the control instruction.
[0057] In this embodiment, S1 is implemented as follows:
[0058] The system collects parameter information of the communication channel currently used to issue control commands, including channel type number, frequency allocation code, maximum transmission unit bytes, current instantaneous bit error rate, and channel rating. These parameters are read directly from the communication stack via the driver interface, and the raw data is converted into unsigned integer fields using a unified format. These fields are then compressed into a six-byte data structure using bitwise operations, forming the channel feature field. This field is unique and can be used for collision identification, enabling rapid matching in subsequent processing chains.
[0059] The communication identifier assigned to this channel during the current communication process is obtained. This identifier is two bytes long and, combined with the control command type code to be generated, forms a three-segment structure. The control command type code is a fixed-length two-byte field used to identify the action category to which the control command belongs, such as a start command, speed adjustment command, or path planning command. The above three fields are concatenated in sequence to form a ten-byte initial encoding structure. To ensure that no information loss occurs during network protocol conversion or cross-layer transmission, a double parity check is used to redundantly expand the ten-byte content and generate a two-byte check field, forming the final composite tag data body.
[0060] The generated composite tag is embedded in the data header of the control command to be sent. During frame construction, a fixed 16-byte tag area is reserved as the header of the data frame, and the tag area is fixed at the beginning of the data buffer in physical memory layout. After the control command is loaded, the 10-byte tag body and the 2-byte checksum field are written byte by byte into the tag area, and a 4-byte frame start flag and length description field are padded at the end to ensure that the receiving end can accurately extract the tag content and perform consistency verification. The tag area writing operation is performed in real time during communication channel activation to ensure the consistency of the tag binding relationship with the current channel.
[0061] Before processing control commands at the receiving end, a structure parsing operation is performed on the tag area fields. The receiving logic first extracts the tag area content from the data header and breaks it down into a channel field, an identifier field, a type field, and a checksum field according to a preset format. The channel field in the tag is compared with the set of active channels in the current communication session using a lookup table to determine if the command matches the receiving channel. If they match, execution continues; otherwise, it proceeds to the exception handling channel. This method ensures that each control command has a traceable source identifier, effectively supporting subsequent buffer conflict prediction and write isolation strategies, and achieving high-security data flow control in channel switching scenarios.
[0062] The so-called "preset format" refers to a standardized field layout and bit width configuration specification defined during system initialization to ensure accurate communication channel identification and standardized tag parsing operations when constructing the data header of control commands. Based on the design requirements of the composite tag structure, this format consists of a communication channel field, a communication identifier field, a command type field, and a check field arranged in a fixed order. Each field occupies a specific bit width and uses a fixed-length format, allowing the receiving end to extract and parse each field sequentially using offset positioning. For example, the communication channel field occupies the first 4 bytes, used to identify the channel type number and frequency code; the communication identifier field occupies 2 bytes, representing a unique identifier for this communication session; the command type field is set to 2 bytes, used to define the functional category of the control command; and the check field is 2 bytes, constructed using double parity checking to verify the integrity of the aforementioned content. This preset format is written into the tag parsing configuration table during communication module initialization. After receiving the control command, the receiving end performs offset segmentation and format decoding on the tag area content according to this configuration table to ensure accurate reconstruction of the meaning of each field. Taking a control command as an example, its tag area content is "0x12AB34CD567890EF". After parsing according to the preset format, we can obtain: 0x12AB34CD is the channel field (representing BLE channel, number 07, frequency number 1F), 0x5678 is the communication identifier (session number 22136), and 0x90EF is the command type and verification field (the command is path control, and the verification code is valid). With the help of this preset format, the system not only realizes the standardized identification of the source of the control command, but also provides structural guarantees for tag consistency retrieval in conflict prediction, buffer isolation, and multi-channel handover.
[0063] S2. Before writing control commands to the transmit / receive buffer, perform a tag comparison operation on the target buffer address based on the composite tag in the control command to determine whether there is a source conflict risk at the address. If there is, stop the current writing.
[0064] In this embodiment, S2 is implemented as follows:
[0065] The composite tag data is extracted from the control command to be issued. This composite tag is a structured information block embedded in the command header, consisting of three distinct fields: a communication channel characteristic field, a communication identifier field, and a command type field. The parsed three fields are concatenated into a continuous binary code using a standard field concatenation sequence. This code is then processed by a hash algorithm to generate a unique tag hash code. This hash code has fixed length, high collision resolution, and reversible source information parsing capability, serving as the basis for subsequent comparison and identification.
[0066] In the specific implementation, to achieve rapid identification and comparison of the source of control commands, the three fields extracted from the composite tag—communication channel characteristic field, communication identifier field, and command type field—need to be sequentially concatenated to form a continuous raw binary data stream. This data stream serves as the input for hash processing, generating a tag hash code through a hash algorithm. A hash algorithm is an algorithm that maps input data of arbitrary length to a fixed-length output value. In this implementation, a 64-bit fixed-length hash scheme based on the SHA-256 algorithm is selected, which has high distribution and low collision rate. The hash code refers to the fixed-length digital signature obtained by irreversibly calculating the concatenated raw tag data using the aforementioned hash algorithm, used to identify the source identity of the command. The purpose of this processing is twofold: firstly, to compress the tag fields and improve comparison efficiency; and secondly, to achieve fast indexing and low-latency address mapping through the compressed hash code, thereby improving the data scheduling capability of the communication processing system. For example, if the communication channel characteristic field is "11001001", the communication identifier field is "10110011", and the instruction type field is "00010110", the concatenation results in "110010011011001100010110". Inputting this into a hash function generates a 64-bit hash code such as "3A7F5C21E9B847D2". This hash code serves as a unique index to the buffer address comparison process, ensuring that each instruction has a unique source, a clear structure, and fast comparison. This design not only meets the requirements for accurate conflict judgment in high-speed industrial scenarios but also possesses algorithmic controllability and structural scalability.
[0067] Based on the target buffer address of the data frame to be written, the buffer status index table is invoked to locate the physical address segment to which the address belongs. Each physical address segment corresponds to a tag record unit in the index table. This record unit contains the hash code of the data source last written to that address segment, the write timestamp, the data frame structure length, the remaining processing cycle flag, and the write status identifier. The system loads the current tag record of the target address into the processing register for field-level comparison with the tag hash code of the current instruction.
[0068] In practical applications, to accurately identify the target buffer address of the data frame to be written, the buffer status index table is first retrieved based on the logical location value of the address in the buffer using an address mapping function. This index table employs an address segment partitioning structure, dividing the entire buffer into several physical address segments of fixed byte length, with each segment corresponding to a tag record unit. Each tag record unit includes: a hash code of the data source successfully written to this address segment, used to identify the original communication channel and its type; a write timestamp, used to record the absolute time reference value of the data write; a data frame structure length, used to verify whether the current data frame is consistent with the historical frame size; a remaining processing cycle flag, used to indicate whether the data in this address segment has been parsed downstream; and a write status flag, used to indicate whether the current address segment is in a writable, locked, or read-only state. After loading the above fields, the complete tag record of the target address segment is imported into a dedicated processing register area. This area supports field-level comparison and instruction-level decision logic execution, thus providing data support for subsequent accurate matching of tag hash codes and conflict determination.
[0069] The system performs field-by-field parsing and comparison of the hash code of the current control command's tag with the historical tag hash codes in the target address segment record. The comparison order prioritizes communication channel characteristic fields, followed by command type fields for precise matching. If the communication channel fields match, it indicates that the current command and the previous write command originated from the same channel; the system further compares whether the write cycle bit overlaps with the current timeslot. If the communication channel fields differ, but the command type field is the same as the previous record, and the timestamp is within the allowable error range, it is determined to be a high-probability conflict segment. If the comparison result satisfies any conflict rule, the system marks the result as "address conflict risk exists."
[0070] In the actual execution process, the purpose of parsing and comparing the tag hash code of the current control command with the historical tag hash codes recorded in the target buffer address segment field by field is to accurately identify potential write conflicts, thereby avoiding command data overwriting or chaos caused by multiple channels in a shared buffer environment. This comparison adopts a structured field priority strategy, first comparing the communication channel characteristic field, because this field can clearly identify the channel source of the control command. In a multi-channel redundancy switching architecture, it is common for different channels to be active at the same time. Buffer conflicts are only likely to occur when the channels are the same and the write cycles overlap. For example, if the communication channel field of the current instruction tag is "BLE-07" and the communication channel field of the historical tag record in the target address range is also "BLE-07", it indicates that the channels are consistent. If both write cycle bits are "1101", it means there is a possibility of simultaneous writing, which needs to be marked as a conflict risk. Conversely, if the channel fields are different, such as the current one being "UDP-03", but the instruction type field is the same as the historical tag, and the timestamp difference is less than the 2-millisecond threshold, it can be determined as a high-probability contention write. This type usually indicates that the primary and backup channels concurrently trigger the same type of instruction, which is very easy to overwrite when the address mapping is consistent. Through the above comparison logic, conflict prediction can be completed in the stage before data writing, which significantly improves the data security and communication stability of the system and avoids instruction confusion or execution errors in the device under high-frequency redundancy switching.
[0071] Upon confirming an address conflict risk, the current control instruction's write operation is immediately halted. This halt triggers an address locking instruction via the write execution control flow, setting the current target address segment to read-only and preventing the instruction from entering the buffer queue. Simultaneously, a conflict event record is generated, including the current instruction's tag hash code, historical tag data of the occupied address segment, conflict determination type, and decision time. This record is then reported to the conflict handling thread for subsequent address reallocation. This halting action is immediate and unique, ensuring that any control instructions with overlapping sources or times will not disturb the buffer until an alternative address is confirmed.
[0072] S3. After writing is aborted, perform buffer address reallocation operation. Based on the preset interference distance rule, select the address segment with the lowest risk of conflict with the composite tag from the current buffer as the new writing target of the control command.
[0073] In this embodiment, S3 is implemented as follows:
[0074] The tag hash code corresponding to the control command that aborted the write operation is extracted, and combined with the comparison result formed during the conflict identification phase, a current conflict tag feature set is constructed. This feature set includes a structural combination of the communication channel field, command type field, and write cycle bits, used for risk index modeling in the buffer address mapping table, forming the basis for predicting the conflict distribution trend. This process is executed collaboratively by the tag parsing logic and the conflict mapping interface to ensure that the subsequent write position of this command is controllable.
[0075] In practice, the current conflict tag feature set is constructed by deconstructing the composite tag carried by the write abort control command field by field. First, the tag hash code is extracted from the control command and reverse-parsed to restore the communication channel field (e.g., "BLE-07"), command type field (e.g., "PATH_CTRL"), and write cycle bit (e.g., "1011"). Then, these three fields are recombine in a fixed order into a structured triple and used as a feature vector input to the conflict modeling function. The modeling function uses a weighting strategy to assign weights to the three fields, such as a weight of 0.5 for the communication channel field, a weight of 0.3 for the command type field, and a weight of 0.2 for the write cycle bit, thus forming the basic vector for conflict trend calculation. For example, for a command from the BLE channel, of type path control, with a cycle bit of 1011, its conflict tag feature set can be represented as: vector ["BLE-07", "PATH_CTRL", "1011"], and weighted representation is formed by combining the weights. This feature set is then used to calculate the vector distance between the feature set and the historical tag features in the buffer address mapping table, in order to assess the risk of conflict of the current instruction in different address segments, thereby providing an accurate risk judgment basis for subsequent address reallocation.
[0076] Based on the constructed conflict label feature set, the system performs a preliminary mapping operation using a preset interference distance rule. This rule uses the combination of label fields as coordinates to divide the current buffer logical address segment into multiple mutually exclusive write regions and defines a minimum distance threshold between each region. This is used to control the minimum write interval between any two instruction writes with similar label features in physical space, thereby reducing the probability of overlapping access. Each segment is dynamically assigned a conflict tolerance score to assist in the subsequent filtering process.
[0077] In the specific implementation, to perform the preliminary mapping operation of the preset interference distance rule based on the constructed conflict tag feature set, the three fields of the current control command's tag feature set—communication channel field, command type field, and write cycle bit—must first be encoded in a unified order, with each field occupying a fixed length (e.g., 8 bits, 6 bits, 4 bits), combined into a fixed-length vector. Then, a weighted folding operation is performed on this tag vector, for example, the communication channel field is multiplied by a weight of 0.5, the command type field by 0.3, and the write cycle bit by 0.2, and the sum is normalized to a logical coordinate value. This coordinate value serves as the theoretical write centroid of the current tag in the buffer address space, used to mark the center point of the highly sensitive area. Based on this coordinate value, the system extends a symmetrical address interval forward and backward, the length of which is determined by the interference weight of the current tag and the global minimum write interval, forming the conflict buffer shielding band for that tag. For example, suppose a control command from a UDP channel, of type "trajectory control," with a period of "1110," is mapped to coordinates 352 after the above encoding and weighting, with an interference weight of 0.75 and a minimum write interval of 16 bytes. The corresponding interference mapping area for this command is buffer logical address numbers 344 to 360, marked as a high-interference region. In the mapping result, this segment will be given a "low" write conflict tolerance score and automatically excluded in the candidate address filtering. This method ensures that commands are prioritized to stay away from historical write hotspots or conflict-concentrated areas before address reallocation, thereby reducing the risk of data overwriting and improving the security of write switching.
[0078] The term "encoding in a unified order" refers to the system's requirement, before executing preset interference distance rules, to structurally arrange and numerically convert the three core fields of the tag feature set of the control command—the communication channel field, the command type field, and the write cycle bit—according to a predetermined order and bit width standard. This is necessary for subsequent vectorization processing and weighted folding operations. This order is pre-set during system initialization based on the sensitivity level of the tag fields to collision impacts. The communication channel field is typically placed first because it has the greatest impact on the collision buffer space; followed by the command type field, and finally the write cycle bit field. Before encoding, each field must be converted to an unsigned integer value according to a format specification and padded with binary bits according to the allocated bit width (e.g., 8 bits, 6 bits, 4 bits) to form a fixed-length vector. For example, the communication channel field "BLE-07" is encoded as the decimal value 103, corresponding to "01100111" in binary; the command type field "path control" is assigned number 25 and encoded as "011001"; the write cycle bit "1110" retains its original bit value. The resulting vector is “01100111-011001-1110”, with a complete structure and consistent order. This encoding order not only ensures the semantic consistency between fields in the vector space, but also provides a reliable foundation for constructing logical coordinates through weighted summation, thereby achieving accurate mapping of sensitive areas in the buffer space and delineation of conflict shielding zones.
[0079] The preset interference distance rule is a quantitative distance restriction strategy designed based on tag semantic similarity and the risk of spatiotemporal overlap in write behavior. It aims to prevent the physical write locations of similar tag characteristic instructions from being adjacent. This rule compresses the weighted similarity of the communication channel field, instruction type field, and write cycle bit into an interference weight. This weight is then multiplied by the standard minimum write interval benchmark to obtain the dynamic minimum write distance. For example, for a tag with a weight of 0.8, if the basic minimum write interval is 8 bytes, the corresponding interference distance threshold for that tag is 6 bytes, meaning that new instructions cannot be written to positions less than 6 bytes away from historically highly similar instructions. The rule also introduces a conflict history feedback factor; if a certain type of tag has experienced coverage anomalies in a specific area, its interference distance threshold will automatically increase, achieving adaptive protection.
[0080] After completing the logical segment division and scoring assignment, a target segment selection operation based on a multi-factor strategy is performed. The system uses conflict tolerance score, current buffer activity, and expected write cycle conflict probability as composite reference factors to prioritize all writable regions. Specifically, the selection process prioritizes regions with the lowest conflict score, combining the write density of the current time slot and the distribution curve of written tags to eliminate hotspot areas and overlapping edges, ultimately forming a set of candidate address segments and identifying the optimal candidate address segment.
[0081] In actual execution, the selection of target segments is achieved by constructing a three-dimensional evaluation matrix that includes a conflict tolerance score, a buffer activity index, and a predicted write conflict probability. The system first establishes a separate scoring item for each logical address segment in an "idle" state. The conflict tolerance score is derived from the distance mapping result of preceding interference, the buffer activity index is calculated by accumulating the write frequency of the segment over the most recent several cycles, and the predicted write conflict probability is based on a probability model constructed using tag feature similarity and timestamp density. Subsequently, the three scoring items are normalized, and a comprehensive priority index is calculated for each segment. A lower priority index indicates a lower write risk. Specifically, the segment with the lowest priority index is prioritized. Simultaneously, the segment write density map in the current time slot and the spatial distribution curve of written tags are combined to eliminate high-frequency write centers (i.e., hotspot areas) and the boundaries of adjacent segments (i.e., overlapping zones). For example, if segment A has a conflict tolerance score of 0.2, an activity level of 0.7, a conflict probability of 0.4, and a comprehensive priority index of 0.43, while segment B has corresponding values of 0.3, 0.3, and 0.3, with a comprehensive index of 0.3, then the system prioritizes segment B for inclusion in the candidate set. Among all candidates, the system ultimately identifies the address with the lowest write frequency and the most balanced spatial location as the optimal candidate segment for the current instruction's data write operation. Through this multi-factor evaluation and ranking mechanism, precise elimination and optimal retention of candidate segments can be achieved, thereby effectively avoiding instruction write conflicts and improving buffer space utilization efficiency.
[0082] After the target address segment is determined, the control command generates a new write address within that segment. This address is offset from the start of the segment and incorporates the tail portion of the tag hash code as a perturbation factor to disrupt the write path, preventing the formation of periodic spatial patterns. This perturbation mechanism is reversible, ensuring that the receiving end can still accurately parse the command source and write path. Subsequently, the control command is formally written into the buffer, and the new write record is registered in the buffer address mapping table, ensuring that subsequent parsing and conflict management operations are traceable.
[0083] In the specific implementation process, after filtering the target address segment, the new write address is calculated by introducing a perturbation offset based on the starting address of that segment. This perturbation offset is obtained by parsing the last 4 bits of the tag hash code corresponding to the current control instruction into an offset value between 0 and 15, and adding this offset value to the starting address to form a non-aligned write start point. This disrupts the linear arrangement of consecutive instructions in the buffer and avoids periodic spatial patterns. For example, when the starting address of the target address segment is 1024 and the tag hash code ends with "1101", the perturbation offset is 13, and the final write address is 1037. This perturbation method can be used by the receiving end to recover the write position by reversing the hash tail and the starting address index, ensuring the reversibility of the write path and the consistency of source tracing. After the write is completed, the system immediately registers the write address, tag hash code, write timestamp, and data length in the address mapping table, forming a complete traceability record, providing a structured reference for subsequent data parsing, error location, and conflict analysis. This mechanism enhances the randomness of write locations while maintaining traceability and manageability, effectively balancing security and system controllability.
[0084] After the write operation is completed, a dynamic conflict density update operation is performed to record the conflict response records of the newly written address segment in the current time slot. If the segment is identified as a conflict-prone area, the system dynamically adjusts the interference distance weight of the area in real time according to the dynamic adjustment rules and marks it as a cooling area, prohibiting its reallocation for a short period. Conversely, low-conflict segments are marked as high-priority areas and have scheduling priority in subsequent instruction writes. This dynamic allocation process is continuously triggered after each reallocation, achieving self-balancing of conflict risk distribution and dynamic optimization of buffer space utilization efficiency.
[0085] In the specific implementation, the dynamic conflict density update operation is performed by statistically analyzing the conflict determination feedback records received by each address segment in the current buffer within the same write cycle. After each control command is written, the system immediately queries whether the address segment has been determined as "conflict sensitive" or has experienced a write failure event by other channels in the current time slot, and aggregates all relevant events with the segment number as the key value to calculate the number of conflict responses. If the number of conflict responses of an address segment in a single cycle exceeds a preset threshold (e.g., 3 times), the segment is identified as a conflict-prone area, and the system increases its corresponding interference distance weight from the default value (e.g., 8 bytes) to a multiplier (e.g., 16 bytes), and marks the segment as "cooling down" in the address mapping table, prohibiting it from being written to again in subsequent cycles. Conversely, if a segment has no conflict records for three consecutive cycles, its interference distance weight will be reverted to the baseline value and it will be marked as a "priority active area," having priority scheduling rights in the next round of address screening. For example, if address segment number 512 is attempted to be written to by other channels for two consecutive cycles and the tag matching fails, the system automatically marks it as a cooling-off zone and removes it from the candidate set during the address reallocation in the next cycle. This dynamic allocation mechanism is automatically triggered after each write operation. By continuously learning the buffer conflict distribution and feedback frequency, it achieves proactive avoidance of conflict hotspots and optimized updates to resource distribution, thereby improving the stability and efficiency of the entire industrial cutting communication system during multi-channel switching.
[0086] S4. After writing the control command to the new address, construct index data containing channel label, address segment, command type and transmission status, which is used by the receiving end to perform label consistency retrieval before parsing the control command.
[0087] In this embodiment, S4 is implemented as follows:
[0088] After the control command is written, four key fields required for building the index data are immediately extracted from the information carried by the command: channel tag, address segment, command type, and transmission status. The channel tag is extracted by deconstructing the composite tag of the control command, containing a communication channel identifier, channel feature code, and source identifier. These three elements are grouped into a fixed-length field group to uniquely identify the channel source of the command. The address segment is formed by combining the first and last addresses of the logical address of the buffer occupied by the current control command, recording the write position of the data in the form of a continuous address block. The command type field is directly read from the structure of the control command; its value indicates the type of operation command the current control command belongs to and serves as a path identifier in the parsing process. The transmission status is collected in real time from the previous writing process, including status indicators such as whether the write was successful, whether a complete verification was completed, and whether an address mapping record has been generated. These four fields are then combined in an ordered manner according to a preset structure to construct a complete and comprehensive index data structure, providing a complete data foundation for subsequent synchronization and retrieval.
[0089] A hierarchical archiving write operation is performed on the constructed index data structure to support rapid retrieval and segmented parsing of different types of control commands at the receiving end. In this step, the index data is first initially classified according to the channel identifier in the channel tag and written to the corresponding channel path entry. Under each channel entry, it is further subdivided according to the command type field, forming a type archiving sublayer. Each type sublayer contains several address segment registration entries, recording the currently written logical address range and its corresponding transmission status information. To improve retrieval speed, all index entries are organized using a key-value mapping method, where the key is a prefix fragment of the tag hash code, and the value is the address record node of the command in the index table. Furthermore, to prevent the index data table from experiencing a decrease in retrieval efficiency due to increased communication frequency, the sorting order of data items in the storage structure is dynamically adjusted according to the address access frequency during the writing process, implementing a popularity-based self-balancing distribution strategy for the index. Through this structured and popularity-driven archiving strategy, it is ensured that index data can be quickly located between different channels and command types, while maintaining high data writing and reading efficiency.
[0090] After the index data is constructed and archived, a synchronization data digest is immediately generated and pushed to the receiving end via a high-priority channel to activate the tag consistency retrieval logic. This synchronization data digest is a compressed structure composed of key fields extracted from the complete index data. It includes a hash digest of the channel tag, the starting address of the current write, the corresponding instruction type encoding, and a bitmap identifier of the current transmission status. The synchronization data digest uses a fixed-length format to ensure the receiving end can immediately identify the position of each field when receiving data packets. Upon receiving the synchronization digest, the receiving end decodes the channel tag using a mapping table and compares it with the locally cached index data for tag consistency. If a match is found, the instruction data reception process begins; if the tags are inconsistent or the status field is abnormal, a parsing pause operation is triggered to prevent erroneous parsing from causing control logic deviations. This mechanism not only improves the recognition accuracy in channel switching scenarios but also enables control instruction parsing to have a "synchronize first, receive later" distributed access characteristic, achieving a pre-guarantee of multi-channel access consistency at the system architecture level.
[0091] After the receiving end completes consistency verification and enters the data receiving process, the system officially registers the constructed index data as a retrieval record in the local index log for subsequent tracking, backtracking, and dynamic reconstruction. The registration operation is performed in snapshot form, including five items: index data construction time, full channel label value, detailed address segment mapping, instruction type bitcode, and transmission status code. A cryptographic hash is then performed on the overall structure to generate a fingerprint. This fingerprint serves as the basis for verifying the integrity of the index data and is also used to quickly locate relevant records during log retrieval. If subsequent issues such as receiver parsing anomalies, instruction execution interruptions, or channel switching failures occur, the debugging system can use the index log fingerprint retrieval mechanism to locate the index structure used at the time of the failure, reconstruct the data path, or restore the original label information, improving the system's maintainability and fault tolerance. This log registration strategy, combined with the complete index construction process, not only enhances the system's data transparency and tracking capabilities but also provides a robust means of ensuring data integrity in high-frequency communication scenarios.
[0092] S5. Based on the collision frequency, channel scoring trend, and buffer usage density, perform parameter adjustment operations based on weighted thresholds to dynamically allocate the write permissions, address distribution, and collision remapping parameters of the communication channel.
[0093] In this embodiment, S5 is implemented as follows:
[0094] Information on the frequency of conflicts generated during communication is collected, and a dynamic conflict behavior model based on time slot windows is constructed. This step involves statistically analyzing the write feedback status of all communication channels in each communication cycle, recording whether signals such as address tag conflict determination, write failure, tag inconsistency, or CRC anomalies are triggered. Whenever a valid conflict feedback occurs, the write address segment of that communication behavior is registered as a conflict point, and the conflict count is accumulated in the conflict history table using the address segment as the key. The system maps all conflict behaviors in the current cycle to the buffer space structure, forming a two-dimensional conflict heatmap, with address offset as the horizontal axis and conflict count as the vertical axis, visually presenting the conflict distribution density. To improve the model's predictive ability, a method based on sliding window averaging and time weighting factors is further used to distinguish between bursty and periodic conflict behaviors. For example, if an address segment is identified as a conflict hotspot in three consecutive cycles, it is assigned a higher conflict risk level and marked as a high-sensitivity segment. This conflict behavior model not only serves as the input parameter for subsequent weighted scoring but also determines the availability screening criteria during buffer address reallocation.
[0095] The system analyzes the channel scoring trends of various communication channels over multiple transmission cycles, extracts stability weights, and constructs a channel priority matrix. The channel scoring trends are based on periodic evaluations of the quality parameters of each communication channel, including quantitative factors such as packet loss rate, average latency, fluctuation range, and retransmission count. At the end of each transmission cycle, each channel reports its quality parameters to the scoring engine. After standardization, a set of multi-dimensional scoring results is generated and then fused into a single score value using a weighting function. The system constructs a time series curve from these scoring results, extracting statistical features such as the average score, maximum score, range, and coefficient of variation to characterize the channel's stability performance during continuous communication. If a channel's scoring trend remains high for a long period with low fluctuation, it is considered to be in a "high stability priority" state; if the score value repeatedly crosses the threshold with excessive fluctuation, it is judged to be in a "low reliability redundancy" state. Based on this, a channel priority matrix is constructed. The write permission level, retry limit, and conflict tolerance coefficient obtained by each channel in write resource allocation will be dynamically adjusted using this priority as a reference value, achieving responsive utilization of communication channel stability.
[0096] Based on joint modeling of buffer space usage density and tag conflict heatmaps, high-risk areas in the address allocation structure are identified and suppression factors are introduced. Buffer usage density is determined by statistically analyzing the cumulative number of writes to each logical address segment over several recent transmission cycles; address segments with higher usage density have a higher probability of overlap and interference. The system segments the entire buffer space according to a fixed block partitioning method, and then assigns a write density score to each segment. Simultaneously, the identified high-frequency conflict segments are spatially overlaid with the density score map to calculate a risk weight factor for each address segment. This factor combines the address access frequency, historical conflict counts, and the tag overlap index of the current cycle for weighted overlay processing, forming a dynamic address risk model. Before writing, this model automatically excludes high-risk address segments and assigns priority weights to low-density but stable areas, thereby improving the balance of address distribution. In particular, for areas with high tag density but no conflicts yet, a "warning limit bit" is set to prevent continuous writing from forming potential hotspots.
[0097] A multi-factor weighted function based on collision frequency, channel score trend, and buffer density is constructed to perform threshold comparison and dynamically adjust write parameter strategies. This weighted function uses collision frequency as the primary criterion, with channel score and address density as secondary factors, each assigned dynamically adjustable weights. These are then fused to obtain a comprehensive performance score. If this score is lower than the current system's set write safety threshold, the system triggers a series of write parameter reconstruction operations: firstly, the maximum concurrent write count for high-collision channels is reduced, and the address segments accessible by that channel are adjusted to low-density regions; secondly, stable channels are given priority access to high-bandwidth address segments, and their instruction retransmission fault tolerance bit width is increased; simultaneously, key configuration items in the remapping strategy, such as interference distance limits, tag matching strictness, and address isolation radius, are adjusted, ultimately constructing a new write scheduling mapping table. For example, when a sharp drop in the UDP channel score is detected in the current period, and the target address segment is a high-risk area, the system reduces the UDP channel's write privileges by one level and forces its writes to be redirected to a sparsely conflicted region, while simultaneously enabling collision masking logic in the tag filtering rules. This process enables multi-dimensional allocation of communication resources, making channel usage more aligned with the current actual performance state, avoiding buffer anomalies caused by write aggregation, and achieving optimal scheduling under dynamic control objectives.
[0098] The above embodiments can be implemented, in whole or in part, by software, hardware, firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, as a computer program product. A computer program product includes one or more computer instructions or computer programs. When the computer instructions or computer programs are loaded or executed on a computer, all or part of the processes or functions according to the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. Computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, computer instructions can be transmitted from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means (e.g., infrared, wireless, microwave, etc.). A computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more sets of available media. Available media can be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., DVDs), or semiconductor media. Semiconductor media can be solid-state drives.
[0099] It should be understood that in the various embodiments of this application, the order of the above-mentioned processes does not imply the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of this application.
[0100] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.
[0101] In the several embodiments provided in this application, it should be understood that the disclosed systems and methods can be implemented in other ways. For example, the embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interfaces, devices, or units, and may be electrical, mechanical, or other forms.
[0102] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.
[0103] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.
[0104] The above are merely specific embodiments of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.
Claims
1. A wireless communication method for industrial cutting machines based on multi-channel redundancy switching, characterized in that, Specifically, the following steps are included: S1. Combine and encode the channel characteristic field, communication identifier and instruction type of the communication channel used to transmit control instructions to generate a composite tag and write it into the data header of the control instruction. S2. Before writing control commands to the transmit / receive buffer, perform a tag comparison operation on the target buffer address based on the composite tag in the control command to determine whether there is a source conflict risk at the address. If there is, stop the current writing. S3. After writing is aborted, perform buffer address reallocation operation. Based on the preset interference distance rule, select the address segment with the lowest risk of conflict with the composite tag from the current buffer as the new writing target of the control command. S4. After writing the control command to the new address, construct index data containing channel label, address segment, command type and transmission status, which is used by the receiving end to perform label consistency retrieval before parsing the control command. S5. Based on the collision frequency, channel scoring trend, and buffer usage density, perform parameter adjustment operations based on weighted thresholds to dynamically allocate the write permissions, address distribution, and collision remapping parameters of the communication channel.
2. The wireless communication method for industrial cutting machines based on multi-channel redundancy switching according to claim 1, characterized in that, S1 specifically includes: The channel type number, frequency allocation code, maximum transmission unit bytes, current instantaneous bit error rate, and channel rating level of the communication channel used to transmit control commands are converted into a unified format to generate channel feature fields. The channel feature field, communication identifier, and instruction type of control command are sequentially concatenated to form the initial encoding structure, and a check field is generated through double parity check to form a composite tag. The composite tag is embedded in the fixed tag area of the data header of the control command, and the frame start flag and length description field are written at the end of the tag area to complete the writing operation of the composite tag.
3. The wireless communication method for industrial cutting machines based on multi-channel redundancy switching according to claim 1, characterized in that, S2 specifically includes: Extract the composite tag embedded in the data header from the control command, and parse it into a communication channel feature field, a communication identifier field, and a command type field to generate a tag hash code; Based on the target buffer address to be written to by the control command, retrieve the tag record unit corresponding to that address, and load the hash code of the data source and the write status information of the last time the data was written to that address; The current tag hash code is compared with the historical tag hash codes in the tag record unit at the field level, and the source conflict risk of the target address is determined based on the comparison result. When a source conflict risk is detected, the writing of control commands is stopped, and address locking and conflict event logging operations are performed.
4. The wireless communication method for industrial cutting machines based on multi-channel redundancy switching according to claim 3, characterized in that, The current tag hash code is compared with the historical tag hash codes in the tag record unit at the field level, and the source conflict risk of the target address is determined based on the comparison result. The specific judgment logic is as follows: Compare the communication channel feature field of the current control command with the communication channel feature field in the historical tag hash code. If they match, continue to compare whether the write cycle bit of the current control command and the write cycle bit in the historical record are in the same write time slot. When the communication channel feature fields are inconsistent, compare whether the instruction type field of the current control instruction is consistent with the instruction type field in the historical tag hash code, and determine whether the difference between the timestamp of the current control instruction and the timestamp of the historical record is less than the preset time threshold. When the communication channel feature fields are consistent and the write cycle bit is in the same write time slot, or when the instruction type fields are consistent and the timestamp difference is less than the preset time threshold, it is determined that there is a risk of source conflict in the target buffer address.
5. The wireless communication method for industrial cutting machines based on multi-channel redundancy switching according to claim 3, characterized in that, S3 specifically includes: After writing is aborted, the tag hash code corresponding to the control command to abort writing is extracted. Combined with the comparison result generated in the tag comparison operation, a conflict tag feature set containing the communication channel field, command type field and writing cycle bit is constructed. Based on the conflict label feature set, a preliminary mapping operation with preset interference distance rules is performed to divide the buffer logical address into multiple mutually exclusive write regions and assign a conflict tolerance score to each address segment; Based on the conflict tolerance score, buffer activity and expected write cycle conflict probability, the candidate address segment set is filtered and the target address segment with the highest priority is located. Write the control command to the address within the target address segment based on the perturbation offset of the tag hash code tail, and update the corresponding write record in the buffer address mapping table.
6. The wireless communication method for industrial cutting machines based on multi-channel redundancy switching according to claim 5, characterized in that, A preliminary mapping operation based on the conflict label feature set and a preset interference distance rule is performed, specifically as follows: Based on the communication channel field, instruction type field, and write cycle bit in the conflict label feature set, they are encoded into fixed-length fields and combined into a fixed-length vector in a unified order. Each field in the fixed-length vector is multiplied by a set weight, summed, and normalized to obtain the corresponding logical coordinate value. The logical coordinate value is used as the theoretical write center position of the corresponding control instruction in the buffer address space. A conflict buffer shield is generated based on the interference weight and the standard minimum write interval. The address segment corresponding to the buffer shield is marked as a high-interference area and assigned a low conflict tolerance score for subsequent address filtering operations.
7. The wireless communication method for industrial cutting machines based on multi-channel redundancy switching according to claim 6, characterized in that, Based on conflict tolerance scores, buffer activity, and expected write cycle conflict probability, the candidate address segment set is filtered, and the highest priority target address segment is located, specifically: A three-dimensional evaluation matrix is constructed, which includes conflict tolerance score, buffer activity and predicted write conflict probability, and a scoring item is established for logical address segments in all idle states. Normalization is performed on each scoring item, and a comprehensive priority index for each address segment is calculated accordingly to quantify the risk level of the current instruction write. Sort according to priority index value, and combine the write density map in the current time slot with the spatial distribution curve of written tags to eliminate high-frequency write center area and overlapping boundary section; From the remaining address segments after removal, select the address segment with the lowest overall priority index and a balanced spatial distribution as the target write location for the current control instruction.
8. The wireless communication method for industrial cutting machines based on multi-channel redundancy switching according to claim 1, characterized in that, S4 specifically includes: Extract four fields from the control command: channel label, address segment, command type, and transmission status, and combine them in a preset structural order to construct a complete index data structure. The index data structure is archived hierarchically according to channel labels and instruction types, and the address range and transmission status are recorded using key-value mapping. At the same time, its arrangement order in the storage structure is dynamically adjusted according to the access frequency. Generate a synchronization data digest containing a channel tag hash digest, address start position, instruction type encoding, and transmission status bitmap identifier, and push it to the receiving end through a high-priority channel to activate the consistency retrieval process; After the receiving end completes the consistency verification, it registers the index data in the local index log in the form of a snapshot, and generates structural fingerprint information for subsequent tracking, backtracking and data reconstruction.
9. The wireless communication method for industrial cutting machines based on multi-channel redundancy switching according to claim 1, characterized in that, S5 specifically includes: Collect the conflict feedback status of the communication channel during the communication cycle, construct a conflict behavior model and generate an address conflict heat map, and assign different conflict risk levels based on the number of segment conflicts. The scoring parameters of the communication channels over multiple periods are statistically analyzed to form a scoring trend curve, and a channel priority matrix is constructed to adjust the write permissions and access configurations of each channel. Calculate the usage density of the logical address segment in the buffer and spatially overlay it with the label conflict heatmap to generate a risk weight factor model to guide the priority allocation of address resources; A multi-factor weighting function is constructed and compared with a set threshold. Based on the scoring results, the channel access permissions, address segment allocation rules and label conflict remapping configuration are dynamically adjusted to achieve dynamic control of the write scheduling strategy.
Citation Information
Patent Citations
Optimizations for an unbounded transactional memory (utm) system
CN102460376A
System and method for executing caching in hash storage
CN117591006A