.png){kind=icon}
返回
Multi-objective path planning in discrete space
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2012.07.023.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Finding a path for a robot which is near to natural looking paths is a challenging problem in motion planning. This paper suggests two single and multi-objective optimization models focusing on length and clearance of the path in discrete space. Considering the complexity of the models and potency of evolutionary algorithms we apply a genetic algorithm with NSGA-II framework for solving the problems addressed in the models. The proposed algorithm uses an innovative family of path refiner operators, in addition to the standard genetic operators. The new operators intensify explorative power of the algorithm in finding Pareto-optimal fronts in the complicated path planning problems such as narrow passages and clutter spaces. Finally, we compare efficiency of the refiner operators and the algorithm with PSO and A* algorithms in several path planning problems. (C) 2012 Elsevier B.V. All rights reserved.
Keyword:
Path planning
Multi-objective optimization
Genetic algorithm
Computational geometry
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.6
论文数:
1.4W
被引数:
4.8W
机构
引用论文
Monodisperse single-crystal mesoporous magnetite nanoparticles induced by nanoscale gas bubbles
PREAI
分享收藏分享收藏Natural killer cell activity during the course of disease in patients with Hodgkin's disease.png)
Cancer
OAAI
CancerIF0
OAAI分享收藏One‐Pot Synthetic Approach for Magnetically Separable Graphene Nanocomposite for Dye Degradation
PREAI
分享收藏Multiple objective genetic algorithms for path-planning optimization in autonomous mobile robots自主移动机器人路径规划优化的多目标遗传算法SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏 没有更多内容
没有更多内容