.png){kind=icon}
返回
Matrix-Binary Codes based Genetic Algorithm for path planning of mobile robot
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2017.12.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The paper presents the new variant of genetic algorithm using the binary codes through matrix for mobile robot navigation (MRN) in static and dynamic environment. The path planning strategy is established using the trace theory as the optimum controller, Sylvester Law of Inertia (SLI) and matrix simulation. The Matrix-Binary Codes based Genetic Algorithm (MGA) transforms the environment from chaos to array. Importantly, the paper proves the SLI by the real and experimental results for the statement any robotics randomized environment transforms into the array. Hence the model is presented as pre optimized robotics by SLI and post-optimized robotics by trace. The simulation result is presented by using MATLAB software and the result obtained by proposed controller is optimal with respect to path and time when compared to other intelligent navigational controller. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Genetic algorithm
Mobile robot navigation
Path planning
Obstacle avoidance
Matrix-Binary Code
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.9
论文数:
6.7K
被引数:
1.3W
机构
引用论文
An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robots.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
分享收藏分享收藏
查看更多内容