论文部分内容阅读
本文研究了在两种移动环境下的多个机器人的走步策略．通过使用遗传算法来求解在两个目标节点间，机器人总体往返次数最多的最佳走步规则，同时考虑调度效率，以期选择更为经济的调度环境．
This paper studies the walking strategy of multiple robots in two mobile environments. By using genetic algorithm to solve the optimal walking rule with the largest number of round trips between two target nodes, the scheduling efficiency is considered at the same time, in order to choose a more economical scheduling environment.