.png){kind=icon}
返回
An eikonal equation based path planning method using polygon decomposition and curve evolution
.png){kind=icon}
OA
AI
DOI：10.1016/j.dt.2019.12.005.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Path planning is a key technique of autonomous navigation for robots, and the velocity field is an important part. Constructing velocity field in a complex workspace is still challenging. In this paper, an inner normal guided segmentation algorithm in a complex polygon is proposed to decompose the complex workspace in this paper. The artificial potential field model based on probability theory is then used to calculate the potential field of the decomposed workspace, and the velocity field is obtained by utilizing the potential field of this workspace. Path optimization is implemented by curve evolution, during which the internal force generated in the smoothing process of the initial path by a mean filter and the external force is obtained from the gradient of the workspace potential field. The parameter selection principle is deduced by analyzing the influence of several parameters on the path length and smoothness. Simulation results show that the designed polygon decomposition algorithm can effectively segment complex workspace and that the path optimization algorithm can shorten and smoothen paths. Copyright (C) 2020 China Ordnance Society. Publishing Services by Elsevier B.V. on behalf of KeAi Communications Co. Ltd.
Keyword:
Level set
Path planning
Artificial potential field
Polygon decomposition
Path optimization
Curve evolution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.9K
被引数:
6.4K
机构
引用论文
.png){kind=icon}
A hierarchical global path planning approach for mobile robots based on multi-objective particle swarm optimization基于多目标粒子群优化的移动机器人分层全局路径规划方法OAAI
OAAI分享收藏分享收藏
查看更多内容