Fei Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Fei Liu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Hongyong Yang
School of Information and Electrical Engineering, Ludong University, Yantai 264025, China
2 shared publications Li Liu
School of Information and Electrical Engineering Ludong University Yantai China
2 shared publications- Li Liu
Ludong University
2 shared publications - Li Tang
School of Physics and Optoelectronic Engineering, Ludong University, Yantai 264025, China
2 shared publications Yilin Han
School of Information and Electrical Engineering Ludong University Yantai China
2 shared publications- Zhilin Fan
School of Information and Electrical Engineering Ludong University Yantai China
2 shared publications
Latest Publications
- 31 August 2022
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 37 (12) , 11275-11298
Reinforcement learning method for target hunting control of multi‐robot systems with obstacles
- 31 August 2022
- Published by Wiley in International Journal of Intelligent Systems
- Vol. 37 (12) , 11275-11298
Reinforcement learning method for target hunting control of multi‐robot systems with obstacles
- Open Access
- 18 April 2022
- Published by Wiley in Journal of Sensors
- Vol. 2022, 1-9
Multirobot Adaptive Task Allocation of Intelligent Warehouse Based on Evolutionary Strategy
To solve the dynamic and real-time problem of multirobot task allocation in intelligent warehouse system under parts-to-picker mode, this paper presents a combined solution based on adaptive task pool strategy and Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES) algorithm. In the first stage of the solution, a variable task pool is used to store dynamically added tasks, which can dynamically divide continuous and large-scale task allocation problems into small-scale subproblems to solve them to meet dynamic requirements. And an adaptive control strategy is used to automatically adjust the total number of tasks in the task pool to achieve a trade-off among throughput, energy consumption, and waiting time, which has better adaptability than manually adjusting the size of the task pool. In the second stage of the solution, when the task pool is full, tasks in the task pool will be assigned to robots. For the task allocation problem, this paper regards it as an optimization problem and uses the CMA-ES algorithm to find the optimal task assignment solution for all the robots. By comparing with fixed threshold method under 56 different task pool sizes, the experimental results show that the throughput can be close to reaching the optimal level, and the average distance traveled by robots to handle each unit is lower using adaptive threshold method; so, adaptive task pool solution has better adaptability and can find the optimal task pool size by itself. This method can satisfy the dynamic and real-time requirements and can be effectively applied to the intelligent warehouse system.
- 18 April 2022
- Published by Wiley in Journal of Sensors
- Vol. 2022, 1-9
Open AccessMultirobot Adaptive Task Allocation of Intelligent Warehouse Based on Evolutionary Strategy
To solve the dynamic and real-time problem of multirobot task allocation in intelligent warehouse system under parts-to-picker mode, this paper presents a combined solution based on adaptive task pool strategy and Covariance Matrix Adaptation Evolutionary Strategy (CMA-ES) algorithm. In the first stage of the solution, a variable task pool is used to store dynamically added tasks, which can dynamically divide continuous and large-scale task allocation problems into small-scale subproblems to solve them to meet dynamic requirements. And an adaptive control strategy is used to automatically adjust the total number of tasks in the task pool to achieve a trade-off among throughput, energy consumption, and waiting time, which has better adaptability than manually adjusting the size of the task pool. In the second stage of the solution, when the task pool is full, tasks in the task pool will be assigned to robots. For the task allocation problem, this paper regards it as an optimization problem and uses the CMA-ES algorithm to find the optimal task assignment solution for all the robots. By comparing with fixed threshold method under 56 different task pool sizes, the experimental results show that the throughput can be close to reaching the optimal level, and the average distance traveled by robots to handle each unit is lower using adaptive threshold method; so, adaptive task pool solution has better adaptability and can find the optimal task pool size by itself. This method can satisfy the dynamic and real-time requirements and can be effectively applied to the intelligent warehouse system.
- Open Access
- 1 January 2021
- Published by Wiley in Journal of Sensors
- Vol. 2021 (1)
ImprovedQ‐Learning Method for Multirobot Formation and Path Planning with Concave Obstacles
Aiming at the formation and path planning of multirobot systems in an unknown environment, a path planning method for multirobot formation based on improvedQ‐learning is proposed. Based on the leader‐following approach, the leader robot uses an improvedQ‐learning algorithm to plan the path and the follower robot achieves a tracking strategy of gravitational potential field (GPF) by designing a cost function to select actions. Specifically, to improve the Q‐learning,Q‐value is initialized by environmental guidance of the target’s GPF. Then, the virtual obstacle‐filling avoidance strategy is presented to fill non‐obstacles which is judged to tend to concave obstacles with virtual obstacles. Besides, the simulated annealing (SA) algorithm whose controlling temperature is adjusted in real time according to the learning situation of theQ‐learning is applied to improve the action selection strategy. The experimental results show that the improvedQ‐learning algorithm reduces the convergence time by 89.9% and the number of convergence rounds by 63.4% compared with the traditional algorithm. With the help of the method, multiple robots have a clear division of labor and quickly plan a globally optimized formation path in a completely unknown environment.
- 1 January 2021
- Published by Wiley in Journal of Sensors
- Vol. 2021 (1)
Open AccessImprovedQ‐Learning Method for Multirobot Formation and Path Planning with Concave Obstacles
Aiming at the formation and path planning of multirobot systems in an unknown environment, a path planning method for multirobot formation based on improvedQ‐learning is proposed. Based on the leader‐following approach, the leader robot uses an improvedQ‐learning algorithm to plan the path and the follower robot achieves a tracking strategy of gravitational potential field (GPF) by designing a cost function to select actions. Specifically, to improve the Q‐learning,Q‐value is initialized by environmental guidance of the target’s GPF. Then, the virtual obstacle‐filling avoidance strategy is presented to fill non‐obstacles which is judged to tend to concave obstacles with virtual obstacles. Besides, the simulated annealing (SA) algorithm whose controlling temperature is adjusted in real time according to the learning situation of theQ‐learning is applied to improve the action selection strategy. The experimental results show that the improvedQ‐learning algorithm reduces the convergence time by 89.9% and the number of convergence rounds by 63.4% compared with the traditional algorithm. With the help of the method, multiple robots have a clear division of labor and quickly plan a globally optimized formation path in a completely unknown environment.
- 11 November 2020
- Published by Springer Nature
- p. 137-146
Group Movement of Multi-agent Systems with Diverse Delays
- 11 November 2020
- Published by Springer Nature
- p. 137-146
Group Movement of Multi-agent Systems with Diverse Delays
- 6 August 2017
- Published by Springer Nature
- p. 517-523
A Realtime Object Detection Algorithm Based on Limited Computing Resource
- 6 August 2017
- Published by Springer Nature
- p. 517-523
A Realtime Object Detection Algorithm Based on Limited Computing Resource
- 6 August 2017
- Published by Springer Nature
- p. 185-192
The Calibration Method of Humanoid Robot Based on Double Support Constraints
- 6 August 2017
- Published by Springer Nature
- p. 185-192
The Calibration Method of Humanoid Robot Based on Double Support Constraints