4.7 Article

Polynomial joint angle arm robot motion planning in complex geometrical obstacles

期刊

APPLIED SOFT COMPUTING
卷 13, 期 2, 页码 1099-1109

出版社

ELSEVIER
DOI: 10.1016/j.asoc.2012.09.025

关键词

Arm robot motion planning; Genetic algorithm; Kinodynamic constraint; Particle Swarm Optimization

向作者/读者索取更多资源

This paper addresses a point-to-point of an arm robot motion planning in complex geometrical obstacle. It will govern a two-layer optimization strategy utilizing sixth degree polynomial as joint angle path. At the beginning of the motion planning process, the path planning starts with the optimization objective to minimize the joint angle travelling distance under collision detection rules as constraint. After the best path has been met, the associated time will be searched with the optimization objective to minimize the total travelling time and the torque under the maximum velocity, the maximum acceleration, the maximum jerk, and the maximum torque constraints. The performance of a Genetic Algorithm (GA) and a Particle Swarm Optimization (PSO) will be investigated in searching the feasible sixth degree polynomial joint angle path and the total travelling time that gives the optimal trajectories under kinodynamic constraints. A 3-Degree-Of-Freedom (3-DOF) planar robot will be utilized to simulate the proposed scenario. (C) 2012 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据