Haoyu Li
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
Haoyu Li has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Jingyu Wang
School of Astronautics, Northwestern Polytechnical University, Xi’an 710072, China
2 shared publications - Ke Zhang
School of Astronautics, Northwestern Polytechnical University, Xi’an 710072, China
2 shared publications - Minghu Tan
School of Astronautics, Northwestern Polytechnical University, Xi’an, China
2 shared publications - Bingbing Ma
School of Astronautics, Northwestern Polytechnical University, Xi’an, China
1 shared publication - Cheng Liang
School of Astronautics, Northwestern Polytechnical University, Xi’an 710072, China
1 shared publication - Dexin Li
College of Electronic Science and Technology, National University of Defense Technology (NUDT), Changsha, China
1 shared publication
Latest Publications
- Open Access
An Experience-Guided MAPPO Framework for Multi-UAV Cooperative Tracking in Continuous Action Spaces
A cooperative guidance law based on the experience-guided multi-agent proximal policy optimization (E-MAPPO) algorithm is proposed for multiple unmanned aerial vehicles (UAVs) to track dynamic points of interest in civilian applications, such as collaborative search and rescue and environmental monitoring. In multi-UAV cooperative tracking, accurate arrival-time coordination is important for improving collaborative task execution, but it remains challenging because of continuous action spaces, target maneuvering, uncertain time-to-go estimation, and inefficient exploration in multi-agent reinforcement learning. Specifically, a multi-UAV cooperative guidance environment is formulated, and the problem is modeled as a Markov decision process. To address the challenges of large action spaces and poor convergence in multi-agent reinforcement learning, an experience-guided MAPPO framework is introduced to enhance training efficiency and policy stability. Different from standard MAPPO, the proposed E-MAPPO introduces proportional-navigation-guided experience only during the early training stage to guide exploration, while the final policy is still optimized through the MAPPO objective. Subsequently, a composite reward function is designed by integrating distance-based heuristic terms with auxiliary guidance signals, thereby improving exploration efficiency and facilitating coordinated rendezvous and tracking of dynamic references. Comparative simulations with cooperative proportional navigation guidance (CPNG), sliding mode control (SMC), and standard MAPPO are conducted under different target motion scenarios. The results show that E-MAPPO reduces the average convergence step by 17.07% compared with MAPPO. In the straight-moving target scenario, E-MAPPO reduces the cooperative time error by 55.10% compared with CPNG and by 8.33% compared with MAPPO. In the S-type maneuvering target scenario, E-MAPPO reduces the cooperative time error by 55.81% compared with CPNG and by 9.52% compared with MAPPO. Monte Carlo experiments further verify its effectiveness and robustness. Additional robustness tests under Gaussian measurement noise, observation bias, and communication delay show that the proposed method maintains acceptable tracking accuracy and cooperative timing performance under different uncertainty conditions. In addition, the results indicate that the proposed method generalizes well to different types of maneuvering targets.
Open AccessAn Experience-Guided MAPPO Framework for Multi-UAV Cooperative Tracking in Continuous Action Spaces
A cooperative guidance law based on the experience-guided multi-agent proximal policy optimization (E-MAPPO) algorithm is proposed for multiple unmanned aerial vehicles (UAVs) to track dynamic points of interest in civilian applications, such as collaborative search and rescue and environmental monitoring. In multi-UAV cooperative tracking, accurate arrival-time coordination is important for improving collaborative task execution, but it remains challenging because of continuous action spaces, target maneuvering, uncertain time-to-go estimation, and inefficient exploration in multi-agent reinforcement learning. Specifically, a multi-UAV cooperative guidance environment is formulated, and the problem is modeled as a Markov decision process. To address the challenges of large action spaces and poor convergence in multi-agent reinforcement learning, an experience-guided MAPPO framework is introduced to enhance training efficiency and policy stability. Different from standard MAPPO, the proposed E-MAPPO introduces proportional-navigation-guided experience only during the early training stage to guide exploration, while the final policy is still optimized through the MAPPO objective. Subsequently, a composite reward function is designed by integrating distance-based heuristic terms with auxiliary guidance signals, thereby improving exploration efficiency and facilitating coordinated rendezvous and tracking of dynamic references. Comparative simulations with cooperative proportional navigation guidance (CPNG), sliding mode control (SMC), and standard MAPPO are conducted under different target motion scenarios. The results show that E-MAPPO reduces the average convergence step by 17.07% compared with MAPPO. In the straight-moving target scenario, E-MAPPO reduces the cooperative time error by 55.10% compared with CPNG and by 8.33% compared with MAPPO. In the S-type maneuvering target scenario, E-MAPPO reduces the cooperative time error by 55.81% compared with CPNG and by 9.52% compared with MAPPO. Monte Carlo experiments further verify its effectiveness and robustness. Additional robustness tests under Gaussian measurement noise, observation bias, and communication delay show that the proposed method maintains acceptable tracking accuracy and cooperative timing performance under different uncertainty conditions. In addition, the results indicate that the proposed method generalizes well to different types of maneuvering targets.
- Open Access
Infrared and Visible Image Fusion Network Based on Self-Compensating Lightweight Convolution
Deep learning has significantly improved the quality of infrared and visible image fusion. However, existing mainstream deep fusion networks often come with complex architectures and a large number of parameters. While general lightweight techniques can effectively reduce model complexity, they often weaken feature interactions during the lightweighting process, resulting in the loss of complementary texture and thermal information in fused images and making it difficult to balance fusion performance and model efficiency. To address these issues, this paper constructs an infrared and visible image fusion network based on a self-compensating lightweight convolution mechanism, named LWC-DenseFuse. The core of the network lies in a self-compensating lightweight convolution module, which goes beyond conventional convolution replacement and explicitly addresses feature degradation introduced by lightweight design. The module decouples spatial and channel correlations of standard convolution through depthwise convolution and pointwise convolution, while incorporating a channel attention mechanism to adaptively enhance salient features. Additionally, channel shuffle technology is employed to promote information exchange between groups, thereby enhancing feature interaction and compensating for the loss of critical information caused by lightweight design. To further improve the representation capability of the lightweight network during optimization, a staged training strategy with progressive loss weighting is introduced. Experimental evaluations demonstrate that the proposed fusion network significantly reduces the number of model parameters while ensuring real-time inference performance. Meanwhile, it effectively alleviates the performance degradation typically associated with lightweight architectures, as evidenced by improvements in information entropy and visual fidelity.
Open AccessInfrared and Visible Image Fusion Network Based on Self-Compensating Lightweight Convolution
Deep learning has significantly improved the quality of infrared and visible image fusion. However, existing mainstream deep fusion networks often come with complex architectures and a large number of parameters. While general lightweight techniques can effectively reduce model complexity, they often weaken feature interactions during the lightweighting process, resulting in the loss of complementary texture and thermal information in fused images and making it difficult to balance fusion performance and model efficiency. To address these issues, this paper constructs an infrared and visible image fusion network based on a self-compensating lightweight convolution mechanism, named LWC-DenseFuse. The core of the network lies in a self-compensating lightweight convolution module, which goes beyond conventional convolution replacement and explicitly addresses feature degradation introduced by lightweight design. The module decouples spatial and channel correlations of standard convolution through depthwise convolution and pointwise convolution, while incorporating a channel attention mechanism to adaptively enhance salient features. Additionally, channel shuffle technology is employed to promote information exchange between groups, thereby enhancing feature interaction and compensating for the loss of critical information caused by lightweight design. To further improve the representation capability of the lightweight network during optimization, a staged training strategy with progressive loss weighting is introduced. Experimental evaluations demonstrate that the proposed fusion network significantly reduces the number of model parameters while ensuring real-time inference performance. Meanwhile, it effectively alleviates the performance degradation typically associated with lightweight architectures, as evidenced by improvements in information entropy and visual fidelity.
- 28 April 2024
- Published by Elsevier in Neurocomputing
- Vol. 592
A hybrid optimization algorithm for multi-agent dynamic planning with guaranteed convergence in probability
- 28 April 2024
- Published by Elsevier in Neurocomputing
- Vol. 592
A hybrid optimization algorithm for multi-agent dynamic planning with guaranteed convergence in probability
- 28 July 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12756, 787-793
Exploring the dynamic optimal energy flow optimization of source-grid-load-storage integrated energy system (Withdrawal Notice)
With the large-scale access of new energy, the power system will show significant "double-sided randomness" and "doublepeak double-high" "three double" characteristics. To ensure the safe, stable and efficient operation of the power system, it is necessary to accelerate the integration of source-grid, load-storage and multi-energy complementary development, and to guarantee the smooth consumption of large-scale new energy through the construction of integrated energy system (IES). In the framework of integrated energy, the energy interaction between energy subsystems is more frequent. In order to obtain the information of interaction characteristics, response time scale and regulation rate of each link of source-grid load and storage, we focus on the dynamic optimal energy flow analysis of integrated energy system and analyze the dynamic optimal trend characteristics of source-grid load and storage with the goal of economy and high efficiency. Based on the integrated energy system containing a 6-node electric power system and a 6-node heating system, the multi-energy flow system is analyzed Finally, the dynamic response and regulation characteristics of the multi-energy flow system are analyzed based on a 6-node power system and a 6-node heating system, and the correctness and validity of the proposed model are verified.
- 28 July 2023
- Published by SPIE-Intl Soc Optical Eng
- Vol. 12756, 787-793
Exploring the dynamic optimal energy flow optimization of source-grid-load-storage integrated energy system (Withdrawal Notice)
With the large-scale access of new energy, the power system will show significant "double-sided randomness" and "doublepeak double-high" "three double" characteristics. To ensure the safe, stable and efficient operation of the power system, it is necessary to accelerate the integration of source-grid, load-storage and multi-energy complementary development, and to guarantee the smooth consumption of large-scale new energy through the construction of integrated energy system (IES). In the framework of integrated energy, the energy interaction between energy subsystems is more frequent. In order to obtain the information of interaction characteristics, response time scale and regulation rate of each link of source-grid load and storage, we focus on the dynamic optimal energy flow analysis of integrated energy system and analyze the dynamic optimal trend characteristics of source-grid load and storage with the goal of economy and high efficiency. Based on the integrated energy system containing a 6-node electric power system and a 6-node heating system, the multi-energy flow system is analyzed Finally, the dynamic response and regulation characteristics of the multi-energy flow system are analyzed based on a 6-node power system and a 6-node heating system, and the correctness and validity of the proposed model are verified.
- 28 October 2022
- Published by Elsevier in Information Sciences
- Vol. 616, 348-366
A novel system identification algorithm for nonlinear Markov jump system
- 28 October 2022
- Published by Elsevier in Information Sciences
- Vol. 616, 348-366
A novel system identification algorithm for nonlinear Markov jump system
- 4 October 2022
- Published by Springer Nature in Astrophysics and Space Science
- Vol. 367 (10) , 1-13
A multi-step method to calculate long-term quasi-periodic orbits around the Sun-Earth $L_{1}$/$L_{2}$- 4 October 2022
- Published by Springer Nature in Astrophysics and Space Science
- Vol. 367 (10) , 1-13
A multi-step method to calculate long-term quasi-periodic orbits around the Sun-Earth $L_{1}$/$L_{2}$- 30 June 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 114
MRRNet: Learning multiple region representation for video person re-identification
- 30 June 2022
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 114
MRRNet: Learning multiple region representation for video person re-identification
- Open Access
Lower Limb Locomotion Activity Recognition of Healthy Individuals Using Semi-Markov Model and Single Wearable Inertial Sensor
Lower limb locomotion activity is of great interest in the field of human activity recognition. In this work, a triplet semi-Markov model-based method is proposed to recognize the locomotion activities of healthy individuals when lower limbs move periodically. In the proposed algorithm, the gait phases (or leg phases) are introduced into the hidden states, and Gaussian mixture density is introduced to represent the complex conditioned observation density. The introduced sojourn state forms the semi-Markov structure, which naturally replicates the real transition of activity and gait during motion. Then, batch mode and on-line Expectation-Maximization (EM) algorithms are proposed, respectively, for model training and adaptive on-line recognition. The algorithm is tested on two datasets collected from wearable inertial sensors. The batch mode recognition accuracy reaches up to 95.16%, whereas the adaptive on-line recognition gradually obtains high accuracy after the time required for model updating. Experimental results show an improvement in performance compared to the other competitive algorithms.
Open AccessLower Limb Locomotion Activity Recognition of Healthy Individuals Using Semi-Markov Model and Single Wearable Inertial Sensor
Lower limb locomotion activity is of great interest in the field of human activity recognition. In this work, a triplet semi-Markov model-based method is proposed to recognize the locomotion activities of healthy individuals when lower limbs move periodically. In the proposed algorithm, the gait phases (or leg phases) are introduced into the hidden states, and Gaussian mixture density is introduced to represent the complex conditioned observation density. The introduced sojourn state forms the semi-Markov structure, which naturally replicates the real transition of activity and gait during motion. Then, batch mode and on-line Expectation-Maximization (EM) algorithms are proposed, respectively, for model training and adaptive on-line recognition. The algorithm is tested on two datasets collected from wearable inertial sensors. The batch mode recognition accuracy reaches up to 95.16%, whereas the adaptive on-line recognition gradually obtains high accuracy after the time required for model updating. Experimental results show an improvement in performance compared to the other competitive algorithms.