Virtual Five-Axis Flank Milling of Jet Engine Impellers—Part II: Feed Rate Optimization of Five-Axis Flank Milling
Bibliographic record
Abstract
This paper presents process optimization for the five-axis flank milling of jet engine impellers based on the mechanics model explained in Part I. The process is optimized by varying the feed automatically as the tool-workpiece engagements, i.e., the process, vary along the tool path. The feed is adjusted by limiting feed-dependent peak outputs to a set of user-defined constraints. The constraints are the tool shank bending stress, tool deflection, maximum chip load (to avoid edge chipping), and the torque limit of the machine. The linear and angular feeds of the tool are optimized by two different methods—a multiconstraint based virtual adaptive control of the process and a nonlinear root-finding algorithm. The five-axis milling process is simulated in a virtual environment, and the resulting process outputs are stored at each position along the tool path. The process is recursively fitted to a first-order process with a time-varying gain and a fixed time constant, and a simple proportional-integral controller is adaptively tuned to operate the machine at threshold levels by manipulating the feed rate. As an alternative to the virtual adaptive process control, the feed rate is optimized by a nonlinear root-finding algorithm. The virtual cutting process is modeled as a black box function of feed and the optimum feed is solved for iteratively, respecting tool stress, tool deflection, torque, and chip load constraints. Both methods are shown to produce almost identical optimized feed rate profiles for the roughing tool path discussed in Paper I. The new feed rate profiles are shown to considerably reduce the cycle time of the impeller while avoiding process faults that may damage the part or the machine.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".