{"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}
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.