一种改进的六轴机器人沿规定路径约束的最优轨迹规划方法

Z. Xiong, Liping Chen, J. Ding
{"title":"一种改进的六轴机器人沿规定路径约束的最优轨迹规划方法","authors":"Z. Xiong, Liping Chen, J. Ding","doi":"10.1109/ICARCE55724.2022.10046474","DOIUrl":null,"url":null,"abstract":"Optimal Control Problem (OCP) is a kind of classical problem with the state space equations, containing the optimal trajectory planning problem of robotic manipulators with complicated path constraints. The optimal control method (OCM) which contains direct and indirect methods is efficient to solve this kind of problems. The Pontryagin maximum principle is the core of the indirect method which includes tedious mathematical derivations, and is hard to work with the complex mechanical system. As the result, the direct methods represented by direct collocation method (DCM) are widely used in the engineering field. They transform the original optimal control problem to nonlinear programming problems (NLP), so that the general NLP solver can be used. There are mainly three different methods based on the above direct methods, including convex optimization (CO) methods, numerical integration (NI) methods and dynamic programming (DP) methods. This paper proposes a brand new idea which can streamline the problem description compared to the CO method, extend the general objective function compared to the NI method, and reduce the cost of storage compared to the DP method, and provides a feasible local optimal solution for the problem. In addition, the simulation experiment satisfies the kinodynamic constraints properly, and the validity of the proposed method is confirmed.","PeriodicalId":416305,"journal":{"name":"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Optimal Trajectory Planning Method of Six-axis Robotic Manipulators along Prescribed Path Constraints\",\"authors\":\"Z. Xiong, Liping Chen, J. Ding\",\"doi\":\"10.1109/ICARCE55724.2022.10046474\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Optimal Control Problem (OCP) is a kind of classical problem with the state space equations, containing the optimal trajectory planning problem of robotic manipulators with complicated path constraints. The optimal control method (OCM) which contains direct and indirect methods is efficient to solve this kind of problems. The Pontryagin maximum principle is the core of the indirect method which includes tedious mathematical derivations, and is hard to work with the complex mechanical system. As the result, the direct methods represented by direct collocation method (DCM) are widely used in the engineering field. They transform the original optimal control problem to nonlinear programming problems (NLP), so that the general NLP solver can be used. There are mainly three different methods based on the above direct methods, including convex optimization (CO) methods, numerical integration (NI) methods and dynamic programming (DP) methods. This paper proposes a brand new idea which can streamline the problem description compared to the CO method, extend the general objective function compared to the NI method, and reduce the cost of storage compared to the DP method, and provides a feasible local optimal solution for the problem. In addition, the simulation experiment satisfies the kinodynamic constraints properly, and the validity of the proposed method is confirmed.\",\"PeriodicalId\":416305,\"journal\":{\"name\":\"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICARCE55724.2022.10046474\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Automation, Robotics and Computer Engineering (ICARCE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARCE55724.2022.10046474","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最优控制问题(OCP)是一类经典的状态空间方程问题,包含了具有复杂路径约束的机械臂最优轨迹规划问题。最优控制方法(OCM)是解决这类问题的有效方法,它包含了直接方法和间接方法。庞特里亚金极大值原理是间接方法的核心,间接方法的数学推导繁琐,难以处理复杂的机械系统。因此,以直接配点法(DCM)为代表的直接法在工程领域得到了广泛的应用。他们将原来的最优控制问题转化为非线性规划问题(NLP),从而可以使用一般的NLP求解器。在上述直接方法的基础上主要有三种不同的方法,即凸优化(CO)方法、数值积分(NI)方法和动态规划(DP)方法。本文提出了一种全新的思想,它比CO方法简化了问题描述,比NI方法扩展了一般目标函数,比DP方法减少了存储成本,并为问题提供了一个可行的局部最优解。仿真实验较好地满足了动力学约束,验证了所提方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved Optimal Trajectory Planning Method of Six-axis Robotic Manipulators along Prescribed Path Constraints
Optimal Control Problem (OCP) is a kind of classical problem with the state space equations, containing the optimal trajectory planning problem of robotic manipulators with complicated path constraints. The optimal control method (OCM) which contains direct and indirect methods is efficient to solve this kind of problems. The Pontryagin maximum principle is the core of the indirect method which includes tedious mathematical derivations, and is hard to work with the complex mechanical system. As the result, the direct methods represented by direct collocation method (DCM) are widely used in the engineering field. They transform the original optimal control problem to nonlinear programming problems (NLP), so that the general NLP solver can be used. There are mainly three different methods based on the above direct methods, including convex optimization (CO) methods, numerical integration (NI) methods and dynamic programming (DP) methods. This paper proposes a brand new idea which can streamline the problem description compared to the CO method, extend the general objective function compared to the NI method, and reduce the cost of storage compared to the DP method, and provides a feasible local optimal solution for the problem. In addition, the simulation experiment satisfies the kinodynamic constraints properly, and the validity of the proposed method is confirmed.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信