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 被引量:5
标识
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
1秒前
Lexi完成签到 ,获得积分10
4秒前
老李应助科研通管家采纳,获得10
6秒前
6秒前
老李应助科研通管家采纳,获得10
6秒前
6秒前
老李应助科研通管家采纳,获得10
6秒前
6秒前
老李应助科研通管家采纳,获得10
6秒前
6秒前
老李应助科研通管家采纳,获得10
7秒前
NexusExplorer应助科研通管家采纳,获得10
7秒前
乐空思应助科研通管家采纳,获得100
7秒前
Ping应助科研通管家采纳,获得10
7秒前
老李应助科研通管家采纳,获得10
7秒前
Chinium完成签到 ,获得积分10
10秒前
kmy完成签到 ,获得积分10
12秒前
郭濹涵完成签到 ,获得积分10
13秒前
YaHaa完成签到,获得积分10
14秒前
温文尔雅完成签到,获得积分0
15秒前
虎妞完成签到 ,获得积分10
18秒前
jiashan完成签到,获得积分10
20秒前
22秒前
碧蓝的迎梦完成签到,获得积分10
25秒前
Yang完成签到,获得积分10
26秒前
好运春风发布了新的文献求助10
28秒前
丁香落完成签到,获得积分10
32秒前
yy完成签到 ,获得积分10
38秒前
111完成签到,获得积分10
41秒前
赘婿应助单身的笑旋采纳,获得10
42秒前
liyan完成签到 ,获得积分10
44秒前
科目三应助成功上岸采纳,获得10
45秒前
王李俊完成签到 ,获得积分10
45秒前
大轩完成签到 ,获得积分10
47秒前
小蜜蜂完成签到,获得积分10
48秒前
51秒前
赵赵完成签到 ,获得积分10
52秒前
oyly完成签到 ,获得积分10
52秒前
53秒前
小乐完成签到 ,获得积分10
55秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Molecular Biology of Cancer: Mechanisms, Targets, and Therapeutics 3000
Kinesiophobia : a new view of chronic pain behavior 3000
Les Mantodea de guyane 2500
CCRN 的官方教材 《AACN Core Curriculum for High Acuity, Progressive, and Critical Care Nursing》第8版 1000
Feldspar inclusion dating of ceramics and burnt stones 1000
What is the Future of Psychotherapy in a Digital Age? 801
热门求助领域 (近24小时)
化学 材料科学 生物 医学 工程类 计算机科学 有机化学 物理 生物化学 纳米技术 复合材料 内科学 化学工程 人工智能 催化作用 遗传学 数学 基因 量子力学 物理化学
热门帖子
关注 科研通微信公众号,转发送积分 5966804
求助须知:如何正确求助?哪些是违规求助? 7255978
关于积分的说明 15975413
捐赠科研通 5103985
什么是DOI,文献DOI怎么找? 2741531
邀请新用户注册赠送积分活动 1705841
关于科研通互助平台的介绍 1620473