Advanced Lumped Parameter Thermal Network for Modeling of Cooling Solutions in Electric Vehicle Motor Applications
Bibliographic record
Abstract
Electric motors used in electric vehicles (EVs) are robust, efficient machines capable of delivering a wide spectrum of torque across their drive cycle. Throughout their operation, inevitable losses are incurred within the power system, primarily in the form of heat energy, which is directly proportional to the square of the current. Managing this heat energy necessitates suitable cooling methods to effectively counteract the generated heat during operation. Thermal analysis serves as a predictive tool to anticipate and address these thermal challenges and is often executed through finite element analysis (FEA). However, the utilization of FEA comes with extended computation times, prompting the exploration of alternative thermal analysis methods like the lumped parameter thermal network (LPTN). Unlike FEA, LPTNs do not face significant reconstruction time issues during the design stage, presenting an advantage in the development of motors. Presented is an enhancement to the conventional LPTN design while broadening the scope of the motor design process by introducing an LPTN cooling model. The objective is to implement this model in the early stages of electromagnetic design, particularly focusing on cooled housing development. Additionally, a case study involving a 13 kW induction motor (IM) was conducted through experimental testing to validate the proposed LPTN model.
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.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".