Bingyan LI

Mr. Bingyan LI


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
18 December 2025 in Electronics
Verified
Journal Article
Open access
PDF file
PWPeng Weixiong
Peng Weixiong
BLBingyan LI
Bingyan LI
PWPing Wang
Ping Wang
HHHuiping Huang
Huiping Huang
YZYangyang Zou
Yangyang Zou
XQXiaoli Qiao
Xiaoli Qiao
Depthwise Separable Convolution (DSC) is widely used due to its significant reduction in parameters and computational cost. However, the depthwise convolution process leads to a decrease in spatial information integration, limiting the network’s expressive power. To address this, we propose a novel Preference-Value Convolution (PVConv) to enhance DSC’s expressiveness. By integrating PVConv into DSC, we introduce the Preference-Value Depthwise Separable Convolution (PVDSC) structure. We integrate both DSC and PVDSC into the YOLOv8 framework and conduct experiments on a beverage container dataset containing visually similar object categories and background interference. Results show that, with minimal increase in parameters and computational cost, introducing preference values significantly improves detection accuracy, F1 score, and attention consistency, especially at high IoU thresholds (mAP@50:95), where object localization is greatly enhanced and certain metrics even surpass complex baseline models. Overall, PVConv significantly enhances the expressiveness of DSC-based networks while maintaining low computational overhead, with promising applications.

27 February 2026 in Electronics
Verified
Journal Article
Open access
PDF file
BLBingyan LI
Bingyan LI
PWPeng Weixiong
Peng Weixiong
HHHuiping Huang
Huiping Huang
WXWenzhi Xiao
Wenzhi Xiao
GLGongping Liu
Gongping Liu
XQXiaoli Qiao
Xiaoli Qiao
To address the challenges of dense structural layouts, limited path feasibility, and stringent assembly constraints in cable routing within complex compartments of aerospace equipment, this paper proposes a cable path planning method that integrates Bidirectional Crossing Line Pruning (BCLP) with an improved ant colony optimization (IACO) algorithm. First, a hierarchical activation strategy for key obstacles is realized by constructing primary and extended crossing lines. On this basis, the BCLP algorithm is introduced, combining global perspective with local reduction capability to significantly reduce the complexity of the search space. Second, in line with cable assembly process requirements, a composite heuristic function is formulated by integrating obstacle-crossing cost and bending penalty. Additionally, a multi-objective-driven pheromone update model is developed to enhance the routing process’ feasibility and convergence performance. Experimental results across various aerospace cabling simulation scenarios demonstrate that the proposed method achieves an average reduction of 19.6% in multi-objective process cost and a 68.5% improvement in convergence efficiency compared to traditional visual graph methods combined with standard ACO. The approach provides effective support for the automation and intelligent planning of cable layouts in complex environments, offering strong potential for engineering applications.