中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
a sampling-based optimized algorithm for task-constrained motion planning

文献类型:期刊论文

作者Mi K(糜凯)1,2; Zhang HJ(张好剑)1,2; Zheng J(郑军)2; Hu JH(胡建华)2; Zhuang DX(庄登祥)1,2; Wang YK(王云宽)2; Zhuang, Dengxiang; Zhang, Haojian; Wang, Yunkuan; Zheng, Jun
刊名International Journal of Advanced Robotic Systems
出版日期2019-05
卷号16期号:3页码:15
关键词Redundant manipulators task space constraints path planning sampling based asymptotically optimization
英文摘要

We consider a motion planning problem with task space constraints in a complex environment for redundant manipulators. For this problem, we propose a motion planning algorithm that combines kinematics control with rapidly exploring random sampling methods. Meanwhile, we introduce an optimization structure similar to dynamic programming into the algorithm. The proposed algorithm can generate an asymptotically optimized smooth path in joint space, which continuously satisfies task space constraints and avoids obstacles. We have confirmed that the proposed algorithm is probabilistically complete and asymptotically optimized. Finally, we conduct multiple experiments with path length and tracking error as optimization targets and the planning results reflect the optimization effect of the algorithm.

源URL[http://ir.ia.ac.cn/handle/173211/39191]  
专题自动化研究所_智能制造技术与系统研究中心_智能机器人团队
通讯作者Zheng J(郑军); Zheng, Jun
作者单位1.中国科学院大学
2.中国科学院自动化研究所
推荐引用方式
GB/T 7714
Mi K,Zhang HJ,Zheng J,et al. a sampling-based optimized algorithm for task-constrained motion planning[J]. International Journal of Advanced Robotic Systems,2019,16(3):15.
APA Mi K.,Zhang HJ.,Zheng J.,Hu JH.,Zhuang DX.,...&Hu, Jianhua.(2019).a sampling-based optimized algorithm for task-constrained motion planning.International Journal of Advanced Robotic Systems,16(3),15.
MLA Mi K,et al."a sampling-based optimized algorithm for task-constrained motion planning".International Journal of Advanced Robotic Systems 16.3(2019):15.

入库方式: OAI收割

来源:自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。