Yang Long
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yang Long has a total of 47 co-authors. Here are the top co-authors by number of shared publications:
- Da Qiu
School of Intelligent Systems Science and Engineering, Hubei Minzu University, Enshi 445000, China
4 shared publications - Binghua Shi
Hubei Key Laboratory of Digital Finance Innovation, Hubei University of Economics, Wuhan 430205, China
3 shared publications - Hang Gao
School of Intelligent Systems Science and Engineering, Hubei Minzu University, Enshi 445000, China
3 shared publications Da Qiu
Hubei Minzu University
2 shared publicationsJiao Deng
Hubei Minzu University
2 shared publicationsJiming Zhang
Hubei Minzu University
2 shared publications
Latest Publications
- Open Access
- 6 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 690-695
Fuzzy Nonlinear Active Disturbance Rejection Control for Quadrotor UAVs under Extreme Operating Conditions
- 6 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 690-695
Open AccessFuzzy Nonlinear Active Disturbance Rejection Control for Quadrotor UAVs under Extreme Operating Conditions
- Open Access
A Self-Adaptive K-SVD Denoising Algorithm for Fiber Bragg Grating Spectral Signals
In fiber Bragg grating (FBG) sensing demodulation systems, high-precision peak detection is a core requirement for demodulation algorithms. However, practical spectral signals are often susceptible to environmental noise interference, which leads to significant degradation in the accuracy of traditional demodulation methods. This study proposes a self-adaptive K-SVD (SAK-SVD) denoising algorithm based on adaptive window parameter optimization, establishing a closed-loop iterative feedback mechanism through dual iterations between dictionary learning and parameter adjustment. This approach achieves a synergistic enhancement of noise suppression and signal fidelity. First, a dictionary learning framework based on K-SVD is constructed for initial denoising, and the peak feature region is extracted by differentiating the denoised signals. By constructing statistics on the number of sign changes, an adaptive adjustment model for the window size is established. This model dynamically tunes the window parameters in dictionary learning for iterative denoising, establishing a closed-loop architecture that integrates denoising evaluation with parameter optimization. The performance of SAK-SVD is evaluated through three experimental scenarios, demonstrating that SAK-SVD overcomes the rigid parameter limitations of traditional K-SVD in FBG spectral processing, enhances denoising performance, and thereby improves wavelength demodulation accuracy. For denoising undistorted waveforms, the optimal mean absolute error (MAE) decreases to 0.300 pm, representing a 25% reduction compared to the next-best method. For distorted waveforms, the optimal MAE drops to 3.9 pm, achieving a 63.38% reduction compared to the next-best method. This study provides both theoretical and technical support for high-precision fiber-optic sensing under complex working conditions. Crucially, the SAK-SVD framework establishes a universal, adaptive denoising paradigm for fiber Bragg grating (FBG) sensing. This paradigm has direct applicability to Raman spectroscopy, industrial ultrasound-based non-destructive testing, and biomedical signal enhancement (e.g., ECG artefact removal), thereby advancing high-precision measurement capabilities across photonics and engineering domains.
Open AccessA Self-Adaptive K-SVD Denoising Algorithm for Fiber Bragg Grating Spectral Signals
In fiber Bragg grating (FBG) sensing demodulation systems, high-precision peak detection is a core requirement for demodulation algorithms. However, practical spectral signals are often susceptible to environmental noise interference, which leads to significant degradation in the accuracy of traditional demodulation methods. This study proposes a self-adaptive K-SVD (SAK-SVD) denoising algorithm based on adaptive window parameter optimization, establishing a closed-loop iterative feedback mechanism through dual iterations between dictionary learning and parameter adjustment. This approach achieves a synergistic enhancement of noise suppression and signal fidelity. First, a dictionary learning framework based on K-SVD is constructed for initial denoising, and the peak feature region is extracted by differentiating the denoised signals. By constructing statistics on the number of sign changes, an adaptive adjustment model for the window size is established. This model dynamically tunes the window parameters in dictionary learning for iterative denoising, establishing a closed-loop architecture that integrates denoising evaluation with parameter optimization. The performance of SAK-SVD is evaluated through three experimental scenarios, demonstrating that SAK-SVD overcomes the rigid parameter limitations of traditional K-SVD in FBG spectral processing, enhances denoising performance, and thereby improves wavelength demodulation accuracy. For denoising undistorted waveforms, the optimal mean absolute error (MAE) decreases to 0.300 pm, representing a 25% reduction compared to the next-best method. For distorted waveforms, the optimal MAE drops to 3.9 pm, achieving a 63.38% reduction compared to the next-best method. This study provides both theoretical and technical support for high-precision fiber-optic sensing under complex working conditions. Crucially, the SAK-SVD framework establishes a universal, adaptive denoising paradigm for fiber Bragg grating (FBG) sensing. This paradigm has direct applicability to Raman spectroscopy, industrial ultrasound-based non-destructive testing, and biomedical signal enhancement (e.g., ECG artefact removal), thereby advancing high-precision measurement capabilities across photonics and engineering domains.
- 19 June 2025
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 43 (7) , 2427-2441
An unmanned surface vehicle berthing planning based on bacteria foraging optimization algorithm considering energy consumption constraints
Unmanned surface vehicles (USVs) frequently encounter inadequate energy levels while navigating to their destinations, which complicates their successful berthing in intricate harbor environments. A bacterial foraging optimization algorithm (BFO) is proposed that takes energy consumption into account and incorporates multiple constraints (MC-BFO). The energy consumption model is redefined for wind environments, enhancing the sensitivity of USVs to wind conditions. Additionally, a reward function is integrated into the algorithm, and the fitness function is reconstructed to improve the goal orientation of the USV. This approach enables the USV to maintain a reasonable path length while pursuing low energy consumption, resulting in more practical navigation. Constraining the USV’s sailing posture for smoother paths and restricting the USV’s heading and speed near the berthage facilitate safe berthing. Finally, three distinct experimental environments are established to compare the paths generated by MC-BFO, BFO, and genetic algorithm under both downwind and upwind conditions, ensuring consistency in relevant parameters. Data on sailing posture, energy consumption, and path length are collected, generalized, and analyzed. The results indicate that MC-BFO effectively reduces energy consumption while maintaining an acceptable path length, resulting in smoother and more coherent paths compared to traditional segmented planning. In conclusion, this method significantly enhances the quality of the berthing path.
- 19 June 2025
- Published by Cambridge University Press (CUP) in Robotica
- Vol. 43 (7) , 2427-2441
An unmanned surface vehicle berthing planning based on bacteria foraging optimization algorithm considering energy consumption constraints
Unmanned surface vehicles (USVs) frequently encounter inadequate energy levels while navigating to their destinations, which complicates their successful berthing in intricate harbor environments. A bacterial foraging optimization algorithm (BFO) is proposed that takes energy consumption into account and incorporates multiple constraints (MC-BFO). The energy consumption model is redefined for wind environments, enhancing the sensitivity of USVs to wind conditions. Additionally, a reward function is integrated into the algorithm, and the fitness function is reconstructed to improve the goal orientation of the USV. This approach enables the USV to maintain a reasonable path length while pursuing low energy consumption, resulting in more practical navigation. Constraining the USV’s sailing posture for smoother paths and restricting the USV’s heading and speed near the berthage facilitate safe berthing. Finally, three distinct experimental environments are established to compare the paths generated by MC-BFO, BFO, and genetic algorithm under both downwind and upwind conditions, ensuring consistency in relevant parameters. Data on sailing posture, energy consumption, and path length are collected, generalized, and analyzed. The results indicate that MC-BFO effectively reduces energy consumption while maintaining an acceptable path length, resulting in smoother and more coherent paths compared to traditional segmented planning. In conclusion, this method significantly enhances the quality of the berthing path.
- 17 June 2025
- Published by Elsevier in Ocean Engineering
- Vol. 337
Joint optimization of dynamic berth allocation and energy supply for USVs based on an improved PSO algorithm
- 17 June 2025
- Published by Elsevier in Ocean Engineering
- Vol. 337
Joint optimization of dynamic berth allocation and energy supply for USVs based on an improved PSO algorithm
- Open Access
- 15 May 2025
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 13 (5) , 958
A Water Body Boundary Search Method Combining Chemotaxis Mechanism and High-Resolution Grid Based on Unmanned Surface Vehicles
To address the issues of poor environmental adaptability and high costs associated with traditional methods of measuring water body boundaries, this paper proposes an innovative path planning approach for water body boundary measurement based on Unmanned Surface Vehicles (USVs)—the Chemotactic Search Traversal (CST) algorithm. This method incorporates the chemotaxis operation mechanism of the Bacterial Foraging Optimization algorithm, integrating it with high-resolution grid maps to enable efficient traversal and accurate measurement of water body boundaries within large-scale grid environments. Simulation experiments demonstrate that the CST algorithm outperforms the Brute Force Algorithm (BFA), Roberts operator, Canny operator, Log operator, Prewitt operator, and Sobel operator in terms of optimal pathfinding, stability, and path smoothness. The feasibility and reliability of this algorithm in real water environments are validated through experiments conducted with actual USVs. These findings suggest that the CST algorithm not only enhances the accuracy and efficiency of water body boundary measurement but also offers a cost-effective and practical solution for measuring water body areas.
- 15 May 2025
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 13 (5) , 958
Open AccessA Water Body Boundary Search Method Combining Chemotaxis Mechanism and High-Resolution Grid Based on Unmanned Surface Vehicles
To address the issues of poor environmental adaptability and high costs associated with traditional methods of measuring water body boundaries, this paper proposes an innovative path planning approach for water body boundary measurement based on Unmanned Surface Vehicles (USVs)—the Chemotactic Search Traversal (CST) algorithm. This method incorporates the chemotaxis operation mechanism of the Bacterial Foraging Optimization algorithm, integrating it with high-resolution grid maps to enable efficient traversal and accurate measurement of water body boundaries within large-scale grid environments. Simulation experiments demonstrate that the CST algorithm outperforms the Brute Force Algorithm (BFA), Roberts operator, Canny operator, Log operator, Prewitt operator, and Sobel operator in terms of optimal pathfinding, stability, and path smoothness. The feasibility and reliability of this algorithm in real water environments are validated through experiments conducted with actual USVs. These findings suggest that the CST algorithm not only enhances the accuracy and efficiency of water body boundary measurement but also offers a cost-effective and practical solution for measuring water body areas.
- Open Access
A Bi-Level Capacity Optimization Method for Hybrid Energy Storage Systems Combining the IBWO and MVMD Algorithms
With the swift evolution of renewable energy technologies, the design and optimization of microgrids have emerged as vital components for fostering energy transition and promoting sustainable development. This study presents a bi-level capacity optimization model for microgrids, integrating wind–solar generation with hybrid electric–hydrogen energy storage systems to simultaneously enhance economic efficiency and system stability. The outer layer minimizes the annual total cost through the application of an Improved Beluga Whale Optimization (IBWO) algorithm, which is enhanced by strategies including the reverse elitism strategy, horizontal and vertical crossover operations, and a whirlwind scavenging strategy to improve performance. The inner layer builds on the optimized results from the outer layer, employing a Multivariable Variational Mode Decomposition (MVMD) algorithm to regulate the power output of the energy storage system. By integrating electric–hydrogen hybrid storage technology, the inner layer effectively mitigates power fluctuations. Furthermore, this study designs a modal decomposition-based charging and discharging scheduling strategy to ensures the system’s continuous and stable operation. Simulations performed on MATLAB 2018b and CPLEX 12.8 platforms indicate that the proposed dual-layer model decreases annual total expenses by 27.5% compared to a single-layer model while keeping grid-connected power variations within 10% of the installed capacity. This research provides innovative perspectives on microgrid optimization design and offers substantial technical support for ensuring stability and economic efficiency in intricate operational settings.
Open AccessA Bi-Level Capacity Optimization Method for Hybrid Energy Storage Systems Combining the IBWO and MVMD Algorithms
With the swift evolution of renewable energy technologies, the design and optimization of microgrids have emerged as vital components for fostering energy transition and promoting sustainable development. This study presents a bi-level capacity optimization model for microgrids, integrating wind–solar generation with hybrid electric–hydrogen energy storage systems to simultaneously enhance economic efficiency and system stability. The outer layer minimizes the annual total cost through the application of an Improved Beluga Whale Optimization (IBWO) algorithm, which is enhanced by strategies including the reverse elitism strategy, horizontal and vertical crossover operations, and a whirlwind scavenging strategy to improve performance. The inner layer builds on the optimized results from the outer layer, employing a Multivariable Variational Mode Decomposition (MVMD) algorithm to regulate the power output of the energy storage system. By integrating electric–hydrogen hybrid storage technology, the inner layer effectively mitigates power fluctuations. Furthermore, this study designs a modal decomposition-based charging and discharging scheduling strategy to ensures the system’s continuous and stable operation. Simulations performed on MATLAB 2018b and CPLEX 12.8 platforms indicate that the proposed dual-layer model decreases annual total expenses by 27.5% compared to a single-layer model while keeping grid-connected power variations within 10% of the installed capacity. This research provides innovative perspectives on microgrid optimization design and offers substantial technical support for ensuring stability and economic efficiency in intricate operational settings.
- Open Access
- 21 August 2024
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 12 (8) , 1446
Autonomous Underwater Vehicle Path Planning Based on Improved Salp Swarm Algorithm
Aiming at the problem of path planning for autonomous underwater vehicle (AUV) to cope with the influence of obstacles and eddies in complex marine environments, a path planning method based on an improved salp swarm algorithm (ISSA) is proposed. Firstly, the motion model of the AUV and eddy current model are constructed, including the relationship between position, velocity, attitude, and control inputs. Secondly, the improved SSA is proposed, which introduces the Levy flight strategy to enhance the algorithm’s optimization seeking ability and adds a nonlinear convergence factor to enhance the convergence ability of the algorithm. The stability and robustness of the improved algorithm are verified by test functions. Finally, the ISSA is applied to AUV path planning, which optimizes the AUV travel distance, improves the search efficiency and accuracy, and avoids the local optimum of the algorithm. The ISSA enhances the adaptive ability and robustness of the algorithm by introducing a dynamic adjustment strategy and feedback mechanism. Experimental verification is carried out using a simulated marine environment. The results show that the ISSA is better than the traditional algorithm in terms of path length as well as algorithm stability, and can effectively improve the navigation performance of AUV.
- 21 August 2024
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 12 (8) , 1446
Open AccessAutonomous Underwater Vehicle Path Planning Based on Improved Salp Swarm Algorithm
Aiming at the problem of path planning for autonomous underwater vehicle (AUV) to cope with the influence of obstacles and eddies in complex marine environments, a path planning method based on an improved salp swarm algorithm (ISSA) is proposed. Firstly, the motion model of the AUV and eddy current model are constructed, including the relationship between position, velocity, attitude, and control inputs. Secondly, the improved SSA is proposed, which introduces the Levy flight strategy to enhance the algorithm’s optimization seeking ability and adds a nonlinear convergence factor to enhance the convergence ability of the algorithm. The stability and robustness of the improved algorithm are verified by test functions. Finally, the ISSA is applied to AUV path planning, which optimizes the AUV travel distance, improves the search efficiency and accuracy, and avoids the local optimum of the algorithm. The ISSA enhances the adaptive ability and robustness of the algorithm by introducing a dynamic adjustment strategy and feedback mechanism. Experimental verification is carried out using a simulated marine environment. The results show that the ISSA is better than the traditional algorithm in terms of path length as well as algorithm stability, and can effectively improve the navigation performance of AUV.
- Open Access
- 3 June 2024
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 12 (6) , 939
USV Path Planning in a Hybrid Map Using a Genetic Algorithm with a Feedback Mechanism
Unmanned surface vehicles (USVs) often operate in real-world environments with long voyage distances and complex routes. The use of a single-grid map model presents challenges, such as the high computational costs for high-resolution maps and loss of environmental information for low-resolution maps. This article proposes an environmental modeling method using a hybrid map that combines topology units and grids. The approach involves calibrating key nodes based on the watershed skeleton line, constructing a topology map using these nodes, decomposing the original map into unit maps, converting each unit map into a grid map, and creating a hybrid map environment model that comprises topology maps, unit map sets, and grid map sets. Then, the article introduces an improved genetic algorithm, called Genetic Algorithm with Feedback (FGA), to address path planning in hybrid maps. Experimental results demonstrate that FGA has better computational efficiency than other algorithms in similar experimental environments. In hybrid maps, path planning with FGA reduces the path lengths and time consumption, and the paths are more logical, smooth, and continuous. These findings contribute to enhancing the quality of path planning and the practical value of USVs.
- 3 June 2024
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 12 (6) , 939
Open AccessUSV Path Planning in a Hybrid Map Using a Genetic Algorithm with a Feedback Mechanism
Unmanned surface vehicles (USVs) often operate in real-world environments with long voyage distances and complex routes. The use of a single-grid map model presents challenges, such as the high computational costs for high-resolution maps and loss of environmental information for low-resolution maps. This article proposes an environmental modeling method using a hybrid map that combines topology units and grids. The approach involves calibrating key nodes based on the watershed skeleton line, constructing a topology map using these nodes, decomposing the original map into unit maps, converting each unit map into a grid map, and creating a hybrid map environment model that comprises topology maps, unit map sets, and grid map sets. Then, the article introduces an improved genetic algorithm, called Genetic Algorithm with Feedback (FGA), to address path planning in hybrid maps. Experimental results demonstrate that FGA has better computational efficiency than other algorithms in similar experimental environments. In hybrid maps, path planning with FGA reduces the path lengths and time consumption, and the paths are more logical, smooth, and continuous. These findings contribute to enhancing the quality of path planning and the practical value of USVs.
- Open Access
- 27 May 2023
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 11 (6) , 1130
Research on a Horizon Line Detection Method for Unmanned Surface Vehicles in Complex Environments
A critical step in the visual navigation of unmanned surface vehicles (USVs) is horizon line detection, which can be used to adjust the altitude as well as for obstacle avoidance in complex environments. In this paper, a real-time and accurate detection method for the horizon line is proposed. Our approach first differentiates the complexity of navigational scenes using the angular second moment (ASM) parameters in the grey level co-occurrence matrix (GLCM). Then, the region of interest (ROI) is initially extracted using minimal human interaction for the complex navigation scenes, while subsequent frames are dynamically acquired using automatic feature point matching. The matched ROI can be maximally removed from the complex background, and the Zernike-moment-based edges are extracted from the obtained ROI. Finally, complete sea horizon information is obtained through a linear fitting of the lower edge points to the edge information. Through various experiments carried out on a classical dataset, our own datasets, and that of another previously published paper, we illustrate the significance and accuracy of this technique for various complex environments. The results show that the performance has potential applications for the autonomous navigation and control of USVs.
- 27 May 2023
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 11 (6) , 1130
Open AccessResearch on a Horizon Line Detection Method for Unmanned Surface Vehicles in Complex Environments
A critical step in the visual navigation of unmanned surface vehicles (USVs) is horizon line detection, which can be used to adjust the altitude as well as for obstacle avoidance in complex environments. In this paper, a real-time and accurate detection method for the horizon line is proposed. Our approach first differentiates the complexity of navigational scenes using the angular second moment (ASM) parameters in the grey level co-occurrence matrix (GLCM). Then, the region of interest (ROI) is initially extracted using minimal human interaction for the complex navigation scenes, while subsequent frames are dynamically acquired using automatic feature point matching. The matched ROI can be maximally removed from the complex background, and the Zernike-moment-based edges are extracted from the obtained ROI. Finally, complete sea horizon information is obtained through a linear fitting of the lower edge points to the edge information. Through various experiments carried out on a classical dataset, our own datasets, and that of another previously published paper, we illustrate the significance and accuracy of this technique for various complex environments. The results show that the performance has potential applications for the autonomous navigation and control of USVs.
- Open Access
- 24 February 2023
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 11 (3) , 489
Local Path Planning with Multiple Constraints for USV Based on Improved Bacterial Foraging Optimization Algorithm
The quality of unmanned surface vehicle (USV) local path planning directly affects its safety and autonomy performance. The USV local path planning might easily be trapped into local optima. The swarm intelligence optimization algorithm is a novel and effective method to solve the path-planning problem. Aiming to address this problem, a hybrid bacterial foraging optimization algorithm with a simulated annealing mechanism is proposed. The proposed algorithm preserves a three-layer nested structure, and a simulated annealing mechanism is incorporated into the outermost nested dispersal operator. The proposed algorithm can effectively escape the local optima. Convention on the International Regulations for Preventing Collisions at Sea (COLREGs) rules and dynamic obstacles are considered as the constraints for the proposed algorithm to design different obstacle avoidance strategies for USVs. The coastal port is selected as the working environment of the USV in the visual test platform. The experimental results show the USV can successfully avoid the various obstacles in the coastal port, and efficiently plan collision-free paths.
- 24 February 2023
- Published by MDPI AG in Journal of Marine Science and Engineering
- Vol. 11 (3) , 489
Open AccessLocal Path Planning with Multiple Constraints for USV Based on Improved Bacterial Foraging Optimization Algorithm
The quality of unmanned surface vehicle (USV) local path planning directly affects its safety and autonomy performance. The USV local path planning might easily be trapped into local optima. The swarm intelligence optimization algorithm is a novel and effective method to solve the path-planning problem. Aiming to address this problem, a hybrid bacterial foraging optimization algorithm with a simulated annealing mechanism is proposed. The proposed algorithm preserves a three-layer nested structure, and a simulated annealing mechanism is incorporated into the outermost nested dispersal operator. The proposed algorithm can effectively escape the local optima. Convention on the International Regulations for Preventing Collisions at Sea (COLREGs) rules and dynamic obstacles are considered as the constraints for the proposed algorithm to design different obstacle avoidance strategies for USVs. The coastal port is selected as the working environment of the USV in the visual test platform. The experimental results show the USV can successfully avoid the various obstacles in the coastal port, and efficiently plan collision-free paths.