Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/118607
DC FieldValueLanguage
dc.contributorDepartment of Industrial and Systems Engineering-
dc.contributorMainland Development Office-
dc.creatorSu, X-
dc.creatorYin, Z-
dc.creatorZhang, Y-
dc.creatorSong, Z-
dc.creatorZhao, H-
dc.date.accessioned2026-04-30T06:19:25Z-
dc.date.available2026-04-30T06:19:25Z-
dc.identifier.issn0093-9994-
dc.identifier.urihttp://hdl.handle.net/10397/118607-
dc.language.isoenen_US
dc.publisherInstitute of Electrical and Electronics Engineersen_US
dc.subjectMulti-condition optimizationen_US
dc.subjectMulti-objective optimization (MOO)en_US
dc.subjectPermanent magnet vernier motors (PMVM)en_US
dc.subjectStaged sequential optimizationen_US
dc.subjectSurrogate modelen_US
dc.titleSurrogate-model-driven staged sequential multi-condition optimization method of permanent magnet vernier motorsen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.doi10.1109/TIA.2025.3634058-
dcterms.abstractPermanent magnet vernier motors (PMVM) exhibit great potential in direct-drive application scenarios. As no-load and on-load performance both affect their overall operational smoothness and reliability, both conditions must be considered during optimization to meet the specific application requirements. However, the high-order harmonics of PMVM make the electromagnetic calculation more time-consuming than permanent magnet synchronous motors (PMSM). Therefore, in this article, a surrogate-model-driven staged sequential multicondition and multi-objective optimization (MOO) method for PMVM is proposed, aiming to comprehensively optimize the motor performance under both no-load and on-load conditions with reduced computational cost. (1) Unlike traditional methods that involve redundant calculations for both no-load and on-load cases, this article employs a surrogate model-driven staged sequential optimization strategy to sequentially optimize the noload and on-load performance. This method optimizes the on-load condition electromagnetic performance while maintaining nearoptimal no-load performance, thereby achieving multi-condition optimization with reduced computational resources. (2) The optimization results are validated using the finite element method (FEM) and PMVM prototype experimental verification. The optimization results indicate that the proposed optimization method achieves 10% reduction of the computational cost compared with the traditional surrogate-driven optimization method, confirming the effectiveness of the proposed method for PMVM optimization. The saved computational cost varies with the complexity of the motor topology. The proposed optimization method can be extended to the optimization problems of different types of motors with more complex motor topologies, considering multiple operating conditions or multiphysics optimization.-
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationIEEE transactions on industry applications, Date of Publication: 17 November 2025, Early Access, https://doi.org/10.1109/TIA.2025.3634058-
dcterms.isPartOfIEEE transactions on industry applications-
dcterms.issued2025-
dc.identifier.scopus2-s2.0-105022448031-
dc.identifier.eissn1939-9367-
dc.description.validate202604 bcjz-
dc.description.oaNot applicableen_US
dc.identifier.SubFormIDG001595/2026-01en_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThis work is supported by the National Natural Science Foundation of China (No. 52407066), the Guangdong Basic and Applied Basic Research Foundation (No. 2024A1515010882), and Guangzhou Municipal Education Bureau 2024 Yangcheng Scholar Project (No. 2024312044).en_US
dc.description.pubStatusEarly releaseen_US
dc.date.embargo0000-00-00 (to be updated)en_US
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Open Access Information
Status embargoed access
Embargo End Date 0000-00-00 (to be updated)
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.