Feng Li
Feng Li has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Dongye Sun
School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
1 shared publication - Fang Liu
Beijing Jinghang Research Institute of Computing and Communication, China
1 shared publication - Fangfang Ma
Academy of System Engineering, Academy of Military Sciences, China
1 shared publication - Fei Dai
Army Engineering University of PLA, Nanjing 210007, China
1 shared publication - Gaofeng Cui
Beijing University of Posts and Telecommunications
1 shared publication - Jianhua Ma
Academy of Military Sciences
1 shared publication
Latest Publications
- 10 May 2025
- Published by Springer Nature
- p. 281-291
FedPA: Unbiased Prototype Alignment in Federated Learning to Mitigate Feature Skew
- 10 May 2025
- Published by Springer Nature
- p. 281-291
FedPA: Unbiased Prototype Alignment in Federated Learning to Mitigate Feature Skew
- 10 May 2025
- Published by Springer Nature
- p. 271-280
Intelligent Warehouse Based on Radio Frequency Identification and Recurrent Neural Network
- 10 May 2025
- Published by Springer Nature
- p. 271-280
Intelligent Warehouse Based on Radio Frequency Identification and Recurrent Neural Network
- 4 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (5) , 6958-6971
Completion Time Optimization With Coupled Uplink–Downlink Resource Allocation for Satellite Systems
Satellites with regenerative payload have become an important way to decrease the end-to-end data transmission latency and improve the resource utilization efficiency in satellite communication systems. However, most of existing works focus on individual uplink or downlink resource allocation without considering the coupling effects of uplink and downlink resource management. In this paper, the coupled uplink-downlink resource allocation with regenerative payloads is analyzed and formulated as a mixed-integer nonlinear programming problem to minimize the completion time of data transmission. To solve the complex problem, a two-stage algorithm is proposed. In the first stage, deep reinforcement learning is adopted to make decisions on the paired user scheduling and channel allocation for uplink and downlink transmission. With the fixed channel allocation decisions, the optimal downlink power allocation can be obtained via successive convex approximation at the second stage. Moreover, the proposed two-stage algorithm can be implemented with low computation complexity. Simulation results show that the proposed algorithm can effectively reduce the completion time of end-to-end data transmission.
- 4 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 60 (5) , 6958-6971
Completion Time Optimization With Coupled Uplink–Downlink Resource Allocation for Satellite Systems
Satellites with regenerative payload have become an important way to decrease the end-to-end data transmission latency and improve the resource utilization efficiency in satellite communication systems. However, most of existing works focus on individual uplink or downlink resource allocation without considering the coupling effects of uplink and downlink resource management. In this paper, the coupled uplink-downlink resource allocation with regenerative payloads is analyzed and formulated as a mixed-integer nonlinear programming problem to minimize the completion time of data transmission. To solve the complex problem, a two-stage algorithm is proposed. In the first stage, deep reinforcement learning is adopted to make decisions on the paired user scheduling and channel allocation for uplink and downlink transmission. With the fixed channel allocation decisions, the optimal downlink power allocation can be obtained via successive convex approximation at the second stage. Moreover, the proposed two-stage algorithm can be implemented with low computation complexity. Simulation results show that the proposed algorithm can effectively reduce the completion time of end-to-end data transmission.
- Open Access
- 4 May 2024
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 19 (3)
An improved ant colony algorithm based on Q-Learning for route planning of autonomous vehicle
In view of the problems existing in the path planning algorithms of unmanned vehicles, such as low search efficiency, slow convergence speed and easy to fall into the local optimal. Based on the characteristics of route planning for unmanned vehicles, this paper introduces Q-Learning into the traditional ant colony algorithm to enhance the learning ability of the algorithm in dynamic environment, so as to improve the overall efficiency of route search. By mapping pheromones into Q values in Q-learning, rapid search in complex environments is realized, and a collection-free path satisfying constraints is quickly found. The results of case analysis show that compared with the traditional ant colony algorithm and the improved ant colony algorithm considering reward and punishment factors, the improved ant colony algorithm based on Q-Learning can effectively reduce the number of iterations, shorten the path optimization time and path length and other performance indicators, and has many advantages in jumping out of the local optimal, improving the global search ability and improving the convergence speed, and has good adaptability and robustness in complex environments. It ensures the safety and stability of unmanned vehicles in complex environments.
- 4 May 2024
- Published by Agora University of Oradea in International Journal of Computers Communications & Control
- Vol. 19 (3)
Open AccessAn improved ant colony algorithm based on Q-Learning for route planning of autonomous vehicle
In view of the problems existing in the path planning algorithms of unmanned vehicles, such as low search efficiency, slow convergence speed and easy to fall into the local optimal. Based on the characteristics of route planning for unmanned vehicles, this paper introduces Q-Learning into the traditional ant colony algorithm to enhance the learning ability of the algorithm in dynamic environment, so as to improve the overall efficiency of route search. By mapping pheromones into Q values in Q-learning, rapid search in complex environments is realized, and a collection-free path satisfying constraints is quickly found. The results of case analysis show that compared with the traditional ant colony algorithm and the improved ant colony algorithm considering reward and punishment factors, the improved ant colony algorithm based on Q-Learning can effectively reduce the number of iterations, shorten the path optimization time and path length and other performance indicators, and has many advantages in jumping out of the local optimal, improving the global search ability and improving the convergence speed, and has good adaptability and robustness in complex environments. It ensures the safety and stability of unmanned vehicles in complex environments.
- Open Access
- 22 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 354-359
Optimization of Fair Materials Distribution Considering the Integrated Road Network
- 22 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 354-359
Open AccessOptimization of Fair Materials Distribution Considering the Integrated Road Network