TY - GEN
T1 - Task Allocation Method of Multi-Logistics Robots Based on Autoencoder-Embedded Genetic Algorithm
AU - Ma, Qian
AU - Lin, Chengran
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - This work considers a task allocation problem of multi-logistics robots in closed campus environments. To find its high-quality solution in a reasonable time, an autoencoder-embedded genetic algorithm is proposed. In it, genetic algorithm is selected as the basic solution framework. In order to deal with the difficulty of constructing 'building blocks' in a high-dimensional solution space, an autoencoder network is introduced to compress a high-dimensional solution into a low-dimensional one. Then, genetic algorithm can construct its 'building blocks' in the resulting informative and low-dimensional solution space. Hence, a parallel framework involving two co-evaluated subpopulations is constructed. Genetic algorithm works in both the original solution space and the low-dimensional one generated by the autoencoder network. Simulation results based on some instances and comparisons with some existing algorithms demonstrate the effectiveness and robustness of the proposed algorithm.
AB - This work considers a task allocation problem of multi-logistics robots in closed campus environments. To find its high-quality solution in a reasonable time, an autoencoder-embedded genetic algorithm is proposed. In it, genetic algorithm is selected as the basic solution framework. In order to deal with the difficulty of constructing 'building blocks' in a high-dimensional solution space, an autoencoder network is introduced to compress a high-dimensional solution into a low-dimensional one. Then, genetic algorithm can construct its 'building blocks' in the resulting informative and low-dimensional solution space. Hence, a parallel framework involving two co-evaluated subpopulations is constructed. Genetic algorithm works in both the original solution space and the low-dimensional one generated by the autoencoder network. Simulation results based on some instances and comparisons with some existing algorithms demonstrate the effectiveness and robustness of the proposed algorithm.
UR - https://www.scopus.com/pages/publications/85174394479
U2 - 10.1109/CASE56687.2023.10260342
DO - 10.1109/CASE56687.2023.10260342
M3 - 会议稿件
AN - SCOPUS:85174394479
T3 - IEEE International Conference on Automation Science and Engineering
BT - 2023 IEEE 19th International Conference on Automation Science and Engineering, CASE 2023
PB - IEEE Computer Society
T2 - 19th IEEE International Conference on Automation Science and Engineering, CASE 2023
Y2 - 26 August 2023 through 30 August 2023
ER -