An element-oriented model simplification algorithm based on dynamic similarity

被引:2
|
作者
Hung, Y. H. [2 ]
Wu, C. H. [3 ]
Hong, C. W. [1 ]
机构
[1] Natl Tsing Hua Univ, Dept Power Mech Engn, Hsinchu 30013, Taiwan
[2] Natl Taiwan Normal Univ, Dept Ind Educ, Taipei, Taiwan
[3] Ind Technol Res Inst, Elect Prop & Control Dept, Hsinchu, Taiwan
关键词
system dynamics; model order reduction; model simplification; bond graph; PHYSICAL DOMAIN; REDUCTION; SYSTEMS;
D O I
10.1177/0959651811409490
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents an element-oriented model simplification algorithm (EO-MSA) in multi-physical domains. It aims to generate a simplified model to release computational loading while maintaining model fidelity. The dynamics of the multi-physical system can be constructed based on a unified bond graph approach. This EO-MSA approach eliminates those bond graph elements which influence the system behaviour insignificantly in the mathematical model. This study proposes two newly-defined indices, dynamic similarity (DS), and model similarity index (MSI), to evaluate the similarity of candidates which are order reduced. Ten error-dynamics modules are mathematically constructed and structurally classified for both the DS and the MSI. The reduced model with minimum MSI can be determined using this approach. Quarter-car simulation results demonstrate that this EO-MSA approach is capable of reducing system complexity while maintaining fidelity with satisfactory tolerance.
引用
收藏
页码:56 / 69
页数:14
相关论文
共 50 条
  • [21] A modeling method of flywheel rotor based on finite element and model simplification
    Zhou, Chuandi
    Liu, Yibing
    Zhu, Wancheng
    Zhang, Haosui
    ARCHIVE OF APPLIED MECHANICS, 2022, 92 (04) : 1185 - 1197
  • [22] A Dynamic Hierarchy for Large Models Based on Adaptive Segmentation and Fast Simplification Algorithm
    Wang, Jian
    He, Mingyi
    ICIEA: 2009 4TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, VOLS 1-6, 2009, : 2076 - 2079
  • [23] Element-oriented land-use classification of mining area by high spatial resolution remote sensing image
    Chen Q.-H.
    Liu Z.-M.
    Liu X.-G.
    Luo H.-X.
    Gao W.
    Wang H.-P.
    Diqiu Kexue - Zhongguo Dizhi Daxue Xuebao/Earth Science - Journal of China University of Geosciences, 2010, 35 (03): : 453 - 458
  • [24] Dynamic Feature Selection Based on Clustering Algorithm and Individual Similarity
    Dantas, Carine A.
    Nunes, Romulo O.
    Canuto, Anne M. P.
    Xavier-Junior, Joao C.
    ARTIFICIAL NEURAL NETWORKS AND MACHINE LEARNING, PT II, 2017, 10614 : 467 - 474
  • [25] Fuzzy Similarity Join Algorithm Based on Dynamic Double Prefixes
    Yu C.-Y.
    Wang W.-H.
    Wen X.-J.
    Zhao Y.-H.
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2022, 43 (03): : 321 - 327
  • [26] Algorithm for multivariate similarity localization based on dynamic fuzzy matching
    Qin, Ningning
    Wu, Yisong
    Yang, Le
    Xi'an Dianzi Keji Daxue Xuebao/Journal of Xidian University, 2021, 48 (04): : 27 - 35
  • [27] 3D MODEL SIMPLIFICATION ALGORITHM BASED ON DEGREE CENTRALITY
    Yan, Tang
    Xin, Fu
    Qiang, Chen
    PROCEEDINGS OF 2009 2ND IEEE INTERNATIONAL CONFERENCE ON BROADBAND NETWORK & MULTIMEDIA TECHNOLOGY, 2009, : 179 - 182
  • [28] Didactic Simulations for Electromagnetism Based on an Element Oriented Model
    Salmi, Khalid
    Magrez, Hamid
    Ziyyat, Abdelhak
    INTERNATIONAL JOURNAL OF ENGINEERING PEDAGOGY, 2019, 9 (05): : 24 - 40
  • [29] Modeling And Modification Of Converter Transformer Similarity Model Based On Finite Element And Similarity Theory
    Wang, Hao
    Zhang, Li
    Sun, Youliang
    Zhang, Zhuangzhuang
    Wang, Dong
    2022 4TH INTERNATIONAL CONFERENCE ON SMART POWER & INTERNET ENERGY SYSTEMS, SPIES, 2022, : 395 - 401
  • [30] Simplification of the dynamic model of a hydraulic rockbreaker for implementation in a model-based control scheme
    Tremblay, Louis-Francis Y.
    Arsenault, Marc
    Zeinali, Meysar
    TRANSACTIONS OF THE CANADIAN SOCIETY FOR MECHANICAL ENGINEERING, 2018, 42 (01) : 38 - 48