{"title":"Real-time optimal trajectory planning for robotic manipulators with functional redundancy","authors":"P. From, J. Gravdahl","doi":"10.1109/ICIT.2009.4939528","DOIUrl":null,"url":null,"abstract":"In this paper we show that by allowing a small orientation error in the specifications of the end effector orientation for spray paint applications, both speed and performance can be substantially improved. In previous publications, we have shown how a continuous set of orientations can be represented as a positive definiteness test on a given matrix. This allows us to cast the problem into a convex optimisation problem where the optimal orientation for each time step is to be found. The orientation which allows the manipulator to follow a given path as fast as possible and with constant speed is considered the optimal orientation. In this paper we show how to solve this problem for every time step. The solution is computationally fast and can be implemented in real time. Numerical examples are presented to verify the efficiency of the approach.","PeriodicalId":405687,"journal":{"name":"2009 IEEE International Conference on Industrial Technology","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IEEE International Conference on Industrial Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2009.4939528","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper we show that by allowing a small orientation error in the specifications of the end effector orientation for spray paint applications, both speed and performance can be substantially improved. In previous publications, we have shown how a continuous set of orientations can be represented as a positive definiteness test on a given matrix. This allows us to cast the problem into a convex optimisation problem where the optimal orientation for each time step is to be found. The orientation which allows the manipulator to follow a given path as fast as possible and with constant speed is considered the optimal orientation. In this paper we show how to solve this problem for every time step. The solution is computationally fast and can be implemented in real time. Numerical examples are presented to verify the efficiency of the approach.