Preference-Based Multiobjective Optimization of Nonresonant Wireless Charging System

被引:0
|
作者
Liu, Hao [1 ]
Li, Zhenjie [2 ]
Chen, Henglin [1 ]
机构
[1] Zhejiang Univ, Coll Elect Engn, Hangzhou 310027, Peoples R China
[2] Northeast Forestry Univ, Coll Comp & Control Engn, Harbin 150040, Peoples R China
基金
中国国家自然科学基金;
关键词
Coils; Resistance; Couplings; Estimation; Optical wavelength conversion; Mathematical models; Magnetic resonance; Orthogonal method; preference-based multiobjective optimization; resistance estimation; target region-based NSGAII (T-NSGAII); wireless charging system (WCS); FERRITE CORE; COIL;
D O I
10.1109/TPEL.2024.3416993
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Desensitizing the misalignment and achieving low loss can improve the performance of wireless charging systems (WCS). A preference-based multiobjective optimization and resistance estimation algorithm based on the orthogonal table and multiple linear regression is used to achieve this. First, the working principle of a nonresonant WCS is analyzed to illustrate the relationship between WCS performance and mutual inductance along with coil resistance. Then, based on the orthogonal method and F-test, the parameters affecting the coil resistance are determined, and an estimation model for the coil resistance is established. Third, preference region and Latin hypercube sampling (LHS) are added to the nondominated sorting genetic algorithm II (NSGAII) method to enhance individual density within the preferred region without increasing the number of individuals and optimize the antimisalignment ability and coil resistance based on the model above of nested coils as an example using the proposed method. Compared to the NSGAII method, the mutual inductance fluctuation within 120 mm is reduced by 58% under similar conditions. Finally, the simulation and experimental results demonstrate that the proposed resistance estimation method has acceptable accuracy, and the proposed optimization method can optimize the horizontal antimisalignment ability of nested coils, and thus constant voltage/constant current charging is achieved.
引用
收藏
页码:13962 / 13974
页数:13
相关论文
共 50 条
  • [31] Preference-based constrained optimization with CP-nets
    Boutilier, C
    Brafman, RI
    Domshlak, C
    Hoos, HH
    Poole, D
    COMPUTATIONAL INTELLIGENCE, 2004, 20 (02) : 137 - 157
  • [32] Preference-Based Search and Multi-Criteria Optimization
    Ulrich Junker
    Annals of Operations Research, 2004, 130 : 75 - 115
  • [33] Preference-Based Evolutionary Multi-objective Optimization
    Li, Zhenhua
    Liu, Hai-Lin
    PROCEEDINGS OF THE 2012 EIGHTH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS 2012), 2012, : 71 - 76
  • [34] Preference-based Pareto optimization in certain and noisy environments
    Trautmann, Heike
    Mehnen, Joern
    ENGINEERING OPTIMIZATION, 2009, 41 (01) : 23 - 38
  • [35] Preference-based search and multi-criteria optimization
    Junker, U
    ANNALS OF OPERATIONS RESEARCH, 2004, 130 (1-4) : 75 - 115
  • [36] Preference-based Adaptive Genetic Algorithm for Multiobjective Advanced Planning and Scheduling Problem
    Yang, J.
    Tang, W.
    2009 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS 1-4, 2009, : 1935 - +
  • [37] Preference-based Teaching
    Gao, Ziyuan
    Ries, Christoph
    Simon, Hans U.
    Zilles, Sandra
    JOURNAL OF MACHINE LEARNING RESEARCH, 2017, 18 : 1 - 32
  • [38] Improved Version of a Multiobjective Quantum-inspired Evolutionary Algorithm with Preference-based Selection
    Ryu, Si-Jung
    Lee, Ki-Baek
    Kim, Jong-Hwan
    2012 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2012,
  • [39] Preference-based unawareness
    Schipper, Burkhard C.
    MATHEMATICAL SOCIAL SCIENCES, 2014, 70 : 34 - 41
  • [40] Direct Preference-based Policy Optimization without Reward Modeling
    An, Gaon
    Lee, Junhyeok
    Zuo, Xingdong
    Kosaka, Norio
    Kim, Kyung-Min
    Song, Hyun Oh
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023), 2023,