Machine Tool Control With Buffered Curve Table Reloading
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing machine tool control systems face processing speed reductions due to preprocessing tasks taking longer than main processing tasks, leading to potential delays and reduced efficiency, especially when numerical control blocks require significant processor load or large descriptions.
Innovation Solution
Implementing a method that uses a buffered curve table, where sections of the curve table are stored in a second buffer memory and reloaded as needed, decoupling preprocessing tasks from main processing tasks and allowing continuous processing of main run cycles with reduced memory requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If preprocessing tasks are executed to generate numerical control blocks, then the interpolation buffer can be filled, but processing speed is reduced when preprocessing takes longer than main processing
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing coupling values in a curve table during preprocessing tasks. This allows the main processing tasks to simply retrieve pre-computed values rather than performing complex calculations in real-time, ensuring the interpolation buffer remains full while maintaining high processing speed.
Solution Approach 2:
The patent segments the processing into distinct phases: preprocessing tasks generate and store coupling values in a curve table, while main processing tasks retrieve and use these values. This segmentation allows independent optimization of each phase, with preprocessing running when processor capacity is available and main processing executing at high speed without preprocessing delays.
2Productivity
If a complete curve table is stored in buffer memory, then all main processing cycles can be executed without reloading, but memory requirements increase
Solution Approach 1:
The patent implements dynamic buffer management where the curve table is reloaded in sections based on processing status. The buffer memory size is optimized to hold only the currently needed portion of the curve table, and reloading occurs dynamically when sections are consumed, balancing continuous processing capability with minimized memory usage.
Solution Approach 2:
The system performs preliminary actions by pre-loading curve table sections into buffer memory before they are needed for processing. This allows the main processing tasks to execute continuously without waiting for reloading operations, while the buffer size remains optimized to hold only necessary data sections.
Data Source
Figure 1
Figure 2
AI summary
A method for controlling a machine tool is described, which enables time and memory savings. A part program (T) is processed by executing pre-tasks (V) and main tasks (H). Two guide values are stored in a first buffer (P1), where each guide value (x) corresponds to a position for a guide axis (X), and each position is assigned to a cycle of the main tasks (H). A part (K1) of a curve table contains a rule that assigns a first coupling value for a coupling axis (Y) to the first of the guide values (x). This part (K1) is stored in a second buffer (P2), and then the cycle to which the first guide value is assigned is executed. After execution, the rule is discarded, and another part (K2) of the curve table is generated, containing a further rule that assigns a second coupling value to the second of the guide values (x).The remaining part of the curve table is then stored in the second buffer memory (P2).