复杂系统建模与仿真(英文)最新文献

Automatic Multiblock Mesh Generation for 3D-Wing Aerodynamic Analysis 三维机翼气动分析的自动多块网格生成

IF 3.5

复杂系统建模与仿真(英文) Pub Date : 2026-06-01 Epub Date: 2026-07-03 DOI: 10.23919/CSMS.2025.0017

Yanchao Yu;Ni Li;Guanghong Gong

{"title":"Automatic Multiblock Mesh Generation for 3D-Wing Aerodynamic Analysis","authors":"Yanchao Yu;Ni Li;Guanghong Gong","doi":"10.23919/CSMS.2025.0017","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0017","url":null,"abstract":"In aerodynamic design, high-quality multiblock mesh generation serves as the cornerstone for accurate lift-drag analysis of wings. However, conventional computational fluid dynamics (CFD) workflows offered by industrial software reveals critical limitations in labor-intensive manual operations. While automatic meshing in 2D wing cross-section is well-established, its extension to 3D wing meshing faces unresolved challenges, including excessive block generation, complex feature alignment, and incomplete simulation-ready pipelines. This paper presents an automatic multiblock mesh generation framework specifically targeting these commercial software shortcomings for 3D wing analysis. Our methodology addresses three persistent challenges: (1) a parameterization-based tip surface meshing method with optimized cell quality, (2) an extrusion-based wing body meshing approach ensuring precise feature alignment at joints and leading edges, and (3) an end-to-end pipeline from geometric pre-processing to CFD-ready multiblock mesh generation. Experiments demonstrate the framework's ability to produce high-quality meshes with minimal manual intervention, streamlining the workflow for aerodynamic simulations.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 2","pages":"151-163"},"PeriodicalIF":3.5,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11595080","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148443423","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Enhanced Artificial Electric Field Algorithm and Its Application in Structural Optimization Problems 增强型人工电场算法及其在结构优化问题中的应用

IF 3.5

复杂系统建模与仿真(英文) Pub Date : 2026-06-01 Epub Date: 2025-07-07 DOI: 10.23919/CSMS.2025.0011

Xinyu Lei;Jiatang Cheng

{"title":"Enhanced Artificial Electric Field Algorithm and Its Application in Structural Optimization Problems","authors":"Xinyu Lei;Jiatang Cheng","doi":"10.23919/CSMS.2025.0011","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0011","url":null,"abstract":"Artificial electric field algorithm (AEFA) is a meta-heuristic optimization technique recently developed that has demonstrated efficacy in scientific research and engineering applications. However, it exhibits limitations such as premature convergence jointly with constrained search capability, particularly in complex optimization scenarios. To rectify these defects, this article proposes an enhanced artificial electric field algorithm (EAEFA) by incorporating a hybrid position updating strategy. To fully utilize all agents in the population, simultaneously improving the exploration and exploitation capabilities of AEFA, EAEFA divides its swarm into two groups. The elite group uses Levy flight for better solution precision, while the non-elite group combines a spiral update approach and the intrinsic update method in AEFA for a more thorough exploration of the search space. This combination effectively balances the exploration and exploitation trade-off to facilitate a robust search. Meanwhile, a stagnation interrupt strategy is employed if EAEFA confronts stagnation or premature convergence. Whereafter, the proposed EAEFA is evaluated over thirteen classical benchmark test functions and CEC2014 benchmark test suits. Numerical results unequivocally demonstrate that the proposed algorithm has exceptional performance surpassing recent variants of AEFA and eight well-known existing meta-heuristic methods. Moreover, EAEFA's success in solving four real-world engineering design problems showcases its practical applicability.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 2","pages":"113-150"},"PeriodicalIF":3.5,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11072547","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148443426","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

End-to-End Scheduling of Single-Arm Cluster Tools with Multiple Wafer Types 多晶圆类型单臂集群工具的端到端调度

IF 3.5

复杂系统建模与仿真(英文) Pub Date : 2026-06-01 Epub Date: 2025-06-02 DOI: 10.23919/CSMS.2025.0012

Bin Li;Jinghui Zhong;Wei-Li Liu;Hu Jin

{"title":"End-to-End Scheduling of Single-Arm Cluster Tools with Multiple Wafer Types","authors":"Bin Li;Jinghui Zhong;Wei-Li Liu;Hu Jin","doi":"10.23919/CSMS.2025.0012","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0012","url":null,"abstract":"The rapid advancement in circuit manufacturing technology has enabled the reduction in circuit width. Consequently, a single wafer can now accommodate more chips, allowing for smaller lot sizes to meet diverse customer needs. Manufacturers aim to use a single production line to simultaneously produce multiple types of wafers for various customizations. However, this presents two challenges: (1) Different types of wafers require different processing routes, necessitating a highly adaptable scheduling algorithm for producing various wafer types in the same production line; (2) producing multiple wafer types involves several state transitions, whereas existing research primarily focuses on single-state transitions. To address these challenges, we propose an end-to-end scheduling method for single-arm cluster tools handling multiple wafer types (ESM-SMWT). First, ESM-SMWT employs a genetic algorithm to optimize the sequence in which wafers enter the cluster tool, improving the utilization of shared and parallel processing modules. Next, integer programming is used to achieve end-to-end scheduling, from the processing of the first wafer at the start of a lot to the completion of the last wafer. Additionally, the new robotic arm strategy we propose significantly reduces the number of robotic arm activities. Through theoretical proofs and extensive experiments, the practical effectiveness of ESM-SMWT is validated.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 2","pages":"164-178"},"PeriodicalIF":3.5,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11021633","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148443424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Novel Hybrid Algorithm for Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time 具有序列依赖建立时间的混合流水车间调度问题的一种新的混合算法

IF 3.5

复杂系统建模与仿真(英文) Pub Date : 2026-06-01 Epub Date: 2026-07-03 DOI: 10.23919/CSMS.2025.0019

Huiting Xue;Zeshuai Jiang;Leilei Meng;Biao Zhang;Wenqiang Zou;Yaping Ren;Saif Ullah

{"title":"Novel Hybrid Algorithm for Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup Time","authors":"Huiting Xue;Zeshuai Jiang;Leilei Meng;Biao Zhang;Wenqiang Zou;Yaping Ren;Saif Ullah","doi":"10.23919/CSMS.2025.0019","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0019","url":null,"abstract":"This paper focuses on the hybrid flow shop scheduling problem with sequence-dependent setup time (HFSP-SDST) with minimizing the makespan. To address this problem, this paper designs a hybrid migrating birds optimization (HMBO) algorithm that integrates migrating birds optimization (MBO) algorithm, variable neighborhood descent search (VND) algorithm, problem-based local search (LS) algorithm, and constraint programming (CP) model. Specifically, HMBO consists of three primary stages. The first stage employs a hybrid algorithm (MBOVND) that integrates MBO and VND with permutation encoding and decoding. Because the solution space of permutation encoding and decoding cannot cover the full solutions of HFSP-SDST, LS and CP are used to enlarge the solution space of MBOVND in the second and third stages respectively. Specifically, LS algorithm is used in the second stage to explore the solutions that are not in the solution space of MBOVND, and CP model is used in the third phase to further enlarge the solution space of MBOVND and LS algorithm. The efficacy of the proposed VND, LS, CP, and HMBO are verified. Experimental results demonstrate that VND, LS, and CP are effective to improve the solving ability of MBO, and HMBO improves 89 out of the 120 best-known solutions for the benchmark instances.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 2","pages":"195-211"},"PeriodicalIF":3.5,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11595009","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148443407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimal Design of Bus Transit Networks Incorporating BRT-Lane-Sharing 考虑brt -车道共享的公交网络优化设计

IF 3.5

复杂系统建模与仿真(英文) Pub Date : 2026-06-01 Epub Date: 2026-07-03 DOI: 10.23919/CSMS.2025.0021

Zhuang Qian;Yindong Shen;Yichuan Ding

{"title":"Optimal Design of Bus Transit Networks Incorporating BRT-Lane-Sharing","authors":"Zhuang Qian;Yindong Shen;Yichuan Ding","doi":"10.23919/CSMS.2025.0021","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0021","url":null,"abstract":"BRT-lane-sharing, which allows regular buses to operate on Bus Rapid Transit (BRT) lanes without disrupting scheduled BRT operations, has gained prominence. It is helpful to increase the utilization of BRT lanes and enhance the efficiency of the bus transit system. However, the current approaches for designing bus transit networks and setting frequencies do not incorporate BRT-lane-sharing, thereby neglecting its potential benefits, including improved speeds, easier transfers, and cost savings. This paper proposes a pioneering study for the Bus Transit Network Design and Frequency Setting (BTNDFS) problem incorporating BRT-lane-sharing. A novel road network description is presented, specifically tailored to accommodate BRT-lane-sharing through the introduction of BRT nodes and BRT-lane arcs. Furthermore, a bi-level model is built for the BTNDFS problem incorporating BRT-lane-sharing. To solve this model, a Priority-Based Genetic Algorithm (PBGA) is proposed, in which a priority-based chromosome is defined, whilst priority-based crossover and mutation operators are devised. Experimental results on the standard Mandl's benchmark instances indicate that the PBGA outperforms other metaheuristic approaches, with outcomes closely approximating optimal solutions. Further experiments are carried out on a real-world network featuring BRT-lane-sharing in the city of Linyi. The results show that the proposed model and the PBGA can reduce costs for passengers and operators, while simultaneously increasing the utilization of BRT lanes.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 2","pages":"212-226"},"PeriodicalIF":3.5,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11595083","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148443422","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Robust Scheduling of the EV Charging Station with Dynamic Subsidies Under Price and Demand Uncertainties 价格和需求不确定性下具有动态补贴的电动汽车充电站鲁棒调度

IF 3.5

复杂系统建模与仿真(英文) Pub Date : 2026-06-01 Epub Date: 2025-06-02 DOI: 10.23919/CSMS.2025.0013

Yuling Ren;Wei Liu;Mao Tan;Yongxin Su;Kang Li

{"title":"Robust Scheduling of the EV Charging Station with Dynamic Subsidies Under Price and Demand Uncertainties","authors":"Yuling Ren;Wei Liu;Mao Tan;Yongxin Su;Kang Li","doi":"10.23919/CSMS.2025.0013","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0013","url":null,"abstract":"The online scheduling of electric vehicle (EV) charging stations faces significant challenges due to the volatility of real-time electricity prices and the uncertainty of charging demand caused by stochastic EV arrivals. Furthermore, the participation degree of station operators is pivotal to the effective execution of the grid's demand response. To effectively capture the complex variability of electricity prices, a novel ensemble prediction-probability mapping framework is proposed to probabilistically characterize real-time peak-valley price features. Unlike traditional methods that rely on predetermined price prediction curves, the framework quantifies price uncertainty through probability interval values, offering a more robust and adaptive decision-making process. To respond to these real-time electricity signals, a risk-aware dynamic price subsidy mechanism is designed to provide differentiated incentives, aligning station operators' economic interests with grid load-balancing objectives. A hybrid ambiguity set that integrates both moment-based and distance-based information is developed to accurately characterize the uncertain charging demand. Additionally, a distribution robust optimization (DRO) model with this ambiguity set is proposed to mitigate conservatism in worst-case scenarios. The model is reformulated as a finite-dimensional convex program to ensure that the set remains sufficiently expressive without becoming intractable. Experimental results demonstrate real-time response in dynamic EV-grid interaction scenarios, validating the robustness and cost-risk balance of the proposed method against price and demand uncertainties.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 2","pages":"179-194"},"PeriodicalIF":3.5,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11021635","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148443408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

NURBS Values Based on Multi-Objective Particle Swarm Optimization Algorithm for Optimal Power Flow Problem in Power System 基于NURBS值的多目标粒子群优化算法求解电力系统最优潮流问题

IF 3.5

复杂系统建模与仿真(英文) Pub Date : 2026-06-01 Epub Date: 2025-06-02 DOI: 10.23919/CSMS.2025.0010

Zhen Zhang;Huifeng Zhang;Chongwei Li;Biaolong Su;Shengxuan Weng;Dong Xia

{"title":"NURBS Values Based on Multi-Objective Particle Swarm Optimization Algorithm for Optimal Power Flow Problem in Power System","authors":"Zhen Zhang;Huifeng Zhang;Chongwei Li;Biaolong Su;Shengxuan Weng;Dong Xia","doi":"10.23919/CSMS.2025.0010","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0010","url":null,"abstract":"The research on Optimal Power Flow (OPF) problems in power systems has undergone significant development, yet a significant gap persists in effectively addressing the multi-objective nature of these problems, particularly within the context of modern power systems characterized by increasing renewable energy integration. This study posits that the incorporation of the Non-Uniform Rational B-Spline (NURBS) curve concept into the Multi-Objective Particle Swarm Optimization (MOPSO) algorithm can significantly enhance its performance in resolving OPF problems. This paper introduces a novel methodology, termed NURBS-MOPSO, which capitalizes on the geometric structure of the Pareto front to facilitate co-evolution among subpopulations of particles. This approach aims to optimize the OPF problem within power systems, with the objectives of minimizing generation costs, reducing pollution emissions, balancing line loads, and maintaining node voltage stability simultaneously. Comprehensive simulations are conducted on the IEEE 30-bus and 57-bus systems, demonstrating the superior performance of the proposed algorithm.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 2","pages":"99-112"},"PeriodicalIF":3.5,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11021637","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148443409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Visual Perception Robustness: Evolution, Challenges, and Frontiers for Image Restoration under Adverse Road Traffic Conditions 视觉感知鲁棒性：不利道路交通条件下图像恢复的进化、挑战和前沿

复杂系统建模与仿真(英文) Pub Date : 2026-03-01 Epub Date: 2026-03-20 DOI: 10.23919/CSMS.2025.0022

Zheng Zeng;Wentao Fan;Hongguang Zhu;Heming Zhang

{"title":"Visual Perception Robustness: Evolution, Challenges, and Frontiers for Image Restoration under Adverse Road Traffic Conditions","authors":"Zheng Zeng;Wentao Fan;Hongguang Zhu;Heming Zhang","doi":"10.23919/CSMS.2025.0022","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0022","url":null,"abstract":"Ensuring robust visual perception under adverse weather conditions is a critical prerequisite for the safety and reliability of autonomous driving systems. Camera-based perception, despite providing rich semantic information, suffers significant degradation in rain, fog, snow, and low-light scenarios, thus presenting a key bottleneck to all-weather, all-scenario autonomy. This paper systematically reviews the evolution of image restoration techniques for road traffic environments, tracing the progression from traditional physical-model based approaches to data-driven deep learning paradigms. The domain gap between synthetic training datasets and real-world applications is identified. Misalignment between restoration metrics and downstream perception performance is also highlighted, revealing that improvements in image quality do not necessarily translate into enhanced perception outcomes. The review advocates for a paradigm shift toward perception-oriented, semantically-guided, and unsupervised domain-adaptive joint frameworks, which integrates image restoration and perception in an end-to-end manner, utilizes semantic priors for region-specific enhancement, and employs self-supervised signals to fully exploit unlabeled real-world data. At last, this work concludes with prospects for future research, emphasizing the necessity of bridging the restoration-perception gap, extending solutions to more complex degradations and tasks, and leveraging foundation models as intelligent controllers for robust visual systems in autonomous driving.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 1","pages":"75-87"},"PeriodicalIF":0.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11449565","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

MOPCGRL: Multi-Objective Procedural Content Generation via Reinforcement Learning MOPCGRL：基于强化学习的多目标过程内容生成

复杂系统建模与仿真(英文) Pub Date : 2026-03-01 Epub Date: 2026-03-20 DOI: 10.23919/CSMS.2025.0034

Yi Yuan;Qingquan Zhang;Bo Yuan;Matthew Barthet;Ahmed Khalifa;Georgios N. Yannakakis;Huanhuan Chen;Jialin Liu

{"title":"MOPCGRL: Multi-Objective Procedural Content Generation via Reinforcement Learning","authors":"Yi Yuan;Qingquan Zhang;Bo Yuan;Matthew Barthet;Ahmed Khalifa;Georgios N. Yannakakis;Huanhuan Chen;Jialin Liu","doi":"10.23919/CSMS.2025.0034","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0034","url":null,"abstract":"Online content generation enables automatic and adaptive creation of diverse and playable game content for maximizing player experience or testing Artificial Intelligence (AI) algorithms. Multiple diversity metrics have been formulated on different content facets in the literature, while some of them conflict with one another. Existing work addresses this multi-dimensional diversity nature by converting those metrics into one term that is further used to direct the training of content generators. However, each generator is trained to meet the preference specified by the weights and fails to fully interpret the relationships among these metrics or provide different trade-offs. This paper proposes a multi-objective procedural content generation via reinforcement learning to train a set of generators that create diverse game content in an online manner while balancing the trade-off between multiple diversity metrics with playability as a constraint. Our framework is compared with state-of-the-art approaches on the commonly used Mario-AI benchmark. Results show that our framework is capable of increasing the diversity of the generator distribution while accelerating the convergence during the early stages of model training. Our approach enables researchers, designers, and practitioners to gain a better understanding of the relationship among conflicting diversity metrics, allowing them to generate content more efficiently and accurately tailored to specific needs.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 1","pages":"57-74"},"PeriodicalIF":0.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11449568","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

LMACNet: Lightweight Multi-Scale Attention Convolutional Network for Glass Insulator Defects LMACNet：玻璃绝缘子缺陷的轻量级多尺度注意卷积网络

复杂系统建模与仿真(英文) Pub Date : 2026-03-01 Epub Date: 2025-06-02 DOI: 10.23919/CSMS.2025.0009

Mingsen Li;Yongfeng Zhang;Xianlong Lv

{"title":"LMACNet: Lightweight Multi-Scale Attention Convolutional Network for Glass Insulator Defects","authors":"Mingsen Li;Yongfeng Zhang;Xianlong Lv","doi":"10.23919/CSMS.2025.0009","DOIUrl":"https://doi.org/10.23919/CSMS.2025.0009","url":null,"abstract":"Glass insulator defect detection faces challenges such as noise data interference, small defect targets, and low accuracy. Current most methods aimed at enhancing the accuracy of insulator defect detection inevitably increase model complexity, requiring additional computational resources. To address this issue, this paper proposes a Lightweight Multi-scale Attention Convolutional Network (LMACNet). A general Spatial-Channel Cross Attention (SCCA) is proposed to perform cross-spatial learning on multi-scale features. SCCA-Mobile Inverted Bottleneck Convolution (SCCA-MBConv) is designed for lightweight feature extraction. Additionally, we improved the Cross Stage Partial Bottleneck with 2 convolutions (C2f) module to enhance multi-scale feature fusion and high-level semantic feature learning. Specifically, an auxiliary network is designed to train the lightweight model, alleviating the information bottleneck and ensuring sufficient gradient flow. Extensive experiments were conducted on the public Vietnam Public Merged dataset of Broken Glass Insulator (VPMBGI) dataset and a custom dataset, the results demonstrate that LMACNet achieves detection performance comparable to other related detection models, while having a parameter count of only 2.54×10<sup>6</sup> and requiring 3.01×10<sup>9</sup> operations. LMACNet exhibits efficiency and practicality.","PeriodicalId":65786,"journal":{"name":"复杂系统建模与仿真(英文)","volume":"6 1","pages":"24-39"},"PeriodicalIF":0.0,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11021634","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147557537","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0