返回
An adaptive genetic algorithm for robot motion planning in 2D complex environments
DOI:10.1016/j.compeleceng.2014.12.014.png)
摘要
En 中文
In this paper, an adaptive genetic algorithm (GA) for robot motion planning in 2D complex environments is proposed. Since the robot motion planning problem is generally an NP-hard problem, metaheuristics such as GA are proper approaches to solve it. Therefore, a new adaptive method based on GA is proposed to solve this problem. In order to overcome the local-trap problem and avoid premature convergence, a novel selection operator is designed. In our model, in each iteration, if necessary, the selective pressure is updated by using feedback information from the standard deviation of fitness function values. This adaptive model helps the proposed method better maintain the diversity of individuals and escape from the local optima. We experimentally compare the proposed method to three other state-of-the-art GA-based approaches. The experimental results confirm that our proposed algorithm outperforms the related methods in terms of solution quality and finding an optimum path. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Motion planning
Mobile robot
Adaptive selection operator
Genetic algorithm (GA)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
引用论文
Parallel Elite Genetic Algorithm and Its Application to Global Path Planning for Autonomous Robot Navigation并行精英遗传算法及其在自主机器人导航全局路径规划中的应用

