返回
Path Planning Algorithm for Multi-Locomotion Robot Based on Multi-Objective Genetic Algorithm with Elitist Strategy
DOI:10.3390/mi13040616.png)
摘要
En 中文
The multi-locomotion robot (MLR), including bionic insect microrobot, bionic animal robot and so on, should choose different locomotion modes according to the obstacles it faces. However, under different locomotion modes, the power consumption, moving speed, and falling risk of MLR are different, and in most cases, they are mutually exclusive. This paper proposes a path planning algorithm for MLR based on a multi-objective genetic algorithm with elitist strategy (MLRMOEGA), which has four optimization objectives: power consumption, time consumption, path falling risk, and path smoothness. We propose two operators: a map analysis operator and a population diversity expansion operator, to improve the global search ability of the algorithm and solve the problem so that it is easy to fall into the local optimal solution. We conduct simulations on MATLAB, and the results show that the proposed algorithm can effectively optimize the objective function value compared with the traditional genetic algorithm under the equal weight of the four optimization objectives, and, under alternative weights, the proposed algorithm can effectively generate the corresponding path of the decision maker's intention under the weight of preference. Compared with the traditional genetic algorithm, the global search ability is improved effectively.
Keyword:
multi-locomotion robot
path planning
genetic algorithm
elitist strategy
multi-objective optimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
1.4W
被引数:
2.9W
机构
引用论文
Isolation of the dengue virus envelope glycoprotein from membranes of infected cells by concanavalin A affinity chromatography通过刀豆蛋白A亲和层析从感染细胞膜中分离登革病毒包膜糖蛋白
Multi-objective path planning of an autonomous mobile robot using hybrid PSO-MFB optimization algorithm基于混合PSO-MFB优化算法的自主移动机器人多目标路径规划
Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms
SOFT COMPUTING
IF2.5

