A Convex Optimization Method to Time-Optimal Trajectory Planning With Jerk Constraint for Industrial Robotic Manipulators

混蛋 凸性 数学优化 弹道 凸优化 数学 控制理论(社会学) 最优化问题 计算机科学 平滑度 正多边形 人工智能 控制(管理) 加速度 数学分析 物理 几何学 经典力学 天文 金融经济学 经济
作者
Chen Ji,Zhongqiang Zhang,Guanggui Cheng,Minxiu Kong,Ruifeng Li
出处
期刊:IEEE Transactions on Automation Science and Engineering [Institute of Electrical and Electronics Engineers]
卷期号:21 (4): 7629-7646 被引量:33
标识
DOI:10.1109/tase.2023.3346693
摘要

This paper proposes a convex time-optimal trajectory planning method for industrial robotic manipulators with jerk constraints. To achieve smooth and efficient trajectories, the square of the pseudo velocity profile is constructed using a cubic uniform B-spline, and a linear relationship is defined with the control points of the B-spline to preserve convexity in the pseudo states. Bi-linear and non-convex jerk constraints are introduced in the optimization problem, and a convex restriction method is applied to achieve convexity. The proposed method is evaluated through three case studies: two contour following tasks and a pick-and-place task. Comparative optimization results demonstrate that the proposed method achieves time optimality and trajectory smoothness simultaneously in the reformulated and jerk-restricted optimization problem. The proposed method provides a practical approach to address the non-convexity of jerk constraints in trajectory optimization for industrial robotic manipulators. Note to Practitioners —This work was motivated by the challenge of generating smooth and time-optimal trajectories for industrial manipulators while considering jerk and dynamic constraints. Existing approaches typically use multi-objective methods that treat jerk constraints as soft constraints. In contrast, this work proposes a B-spline-based convex optimization method that treats jerk constraints as hard constraints. Three case studies are conducted, involving butterfly-type, door-type and ‘OPTEC’-type paths, with the UR5 cooperative robot. The numerical and experimental results demonstrate that the proposed method sacrifices some time optimality to achieve trajectory smoothness and computational efficiency due to the convex restriction reformulation of the jerk constraints. Moreover, the proposed method is applicable to general industrial manipulators. Supplementary video is available at https://youtu.be/gVz5IuPKD-o.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
小猫王子完成签到,获得积分10
刚刚
JamesPei的应助被多情的涔采纳,获得10
1秒前
wzl完成签到 ,获得积分10
1秒前
深情元正发布了新的文献求助10
1秒前
1秒前
柱柱子同学完成签到,获得积分10
1秒前
小丹小丹完成签到 ,获得积分10
1秒前
normankasimodo完成签到,获得积分10
1秒前
2秒前
奋斗青完成签到,获得积分10
2秒前
MW完成签到,获得积分10
2秒前
六花发布了新的文献求助10
2秒前
Rui发布了新的文献求助10
2秒前
coffeecat完成签到,获得积分10
3秒前
Jagger关注了科研通微信公众号
3秒前
4秒前
xjl完成签到,获得积分10
4秒前
888发布了新的文献求助20
5秒前
5秒前
DDD完成签到,获得积分10
6秒前
6秒前
6秒前
大个的应助被独特的大雁采纳,获得10
6秒前
7秒前
丘比特的应助被陈椅子的求学采纳,获得10
7秒前
科研通AI6.2的应助被陈伟采纳,获得10
7秒前
Zzhuuuuu发布了新的文献求助10
7秒前
7秒前
雾雪零尘发布了新的文献求助10
7秒前
杨小羊完成签到,获得积分10
8秒前
粼粼完成签到,获得积分10
8秒前
Cathy完成签到 ,获得积分10
8秒前
8秒前
奋斗夏彤完成签到,获得积分10
9秒前
9秒前
9秒前
清晨发布了新的文献求助10
9秒前
Mortimer完成签到,获得积分10
9秒前
33完成签到 ,获得积分10
10秒前
chenghong发布了新的文献求助10
10秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Les Mantodea De Guyane 2000
Narrative Disclosure and Earnings Performance: Evidence from R&D Disclosures 1050
Preparation and Properties of Cu-Plated Graphene/Cu Composites 1000
Essays on African writing: A re-evaluation 1000
内視鏡下経鼻経蝶形骨洞手術術後SIADHに対する予防的水制限の安全性と有効性の検討 1000
Problems and Solutions for Integer and Combinatorial Optimization: Building Skills in Discrete Optimization 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8004145
求助须知:如何正确求助?哪些是违规求助? 9455840
关于积分的说明 21157754
捐赠科研通 7576977
什么是DOI,文献DOI怎么找? 3381867
关于科研通互助平台的介绍 2514701
邀请新用户注册赠送积分活动 2416635