{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T02:39:50Z","timestamp":1771641590424,"version":"3.50.1"},"reference-count":21,"publisher":"Emerald","issue":"6","license":[{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IR"],"published-print":{"date-parts":[[2019,11,14]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>The purpose of this paper is to propose a precise time-optimal path tracking approach for robots under kinematic and dynamic constraints to improve the work efficiency of robots and guarantee tracking accuracy.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>In the proposed approach, the robot path is expressed by a scalar path coordinate and discretized into N points. The motion between two neighbouring points is assumed to be uniformly accelerated motion, so the time-optimal trajectory that satisfies constraints is obtained by using equations of uniformly accelerated motion instead of numerical integration. To improve dynamic model accuracy, the Coulomb and viscous friction are taken into account (while most publications neglect these effects). Furthermore, an iterative learning algorithm is designed to correct model-plant mismatch by adding an iterative compensation item into the dynamic model at each discrete point before trajectory planning.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>An experiment shows that compared with the sequential convex log barrier method, the proposed numerical integration-like (NI-like) approach has less computation time and a smoother planning trajectory. Compared with the experimental results before iteration, the torque deviation, tracking error and trajectory execution time are reduced after 10 iterations.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>As the proposed approach not only yields a time-optimal solution but also improves tracking performance, this approach can be used for any repetitive robot tasks that require more rapidity and less tracking error, such as assembly.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/ir-03-2019-0063","type":"journal-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T03:57:03Z","timestamp":1565063823000},"page":"763-778","source":"Crossref","is-referenced-by-count":10,"title":["Time-optimal path tracking for robots a numerical integration-like approach combined with an iterative learning algorithm"],"prefix":"10.1108","volume":"46","author":[{"given":"Lin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiadong","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanbiao","family":"Zou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"key":"key2022112510141959200_ref001","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1109\/CDC.1984.272176","article-title":"Bettering operation of dynamic systems by learning: a new control theory for servomechanism or mechatronics systems","volume-title":"The 23rd IEEE Conference on Decision and Control","year":"1984"},{"issue":"3","key":"key2022112510141959200_ref002","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1177\/027836498500400301","article-title":"Time-optimal control of robotic manipulators along specified paths","volume":"4","year":"1985","journal-title":"The International Journal of Robotics Research"},{"issue":"3","key":"key2022112510141959200_ref003","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/MCS.2006.1636313","article-title":"A survey of iterative learning control","volume":"26","year":"2006","journal-title":"IEEE Control Systems Magazine"},{"issue":"1","key":"key2022112510141959200_ref004","first-page":"141","article-title":"Force control approaches research for robotic machining based on particle swarm optimization and adaptive iteration algorithms","volume":"45","year":"2017","journal-title":"Industrial Robot: An International Journal"},{"issue":"5","key":"key2022112510141959200_ref005","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1002\/(SICI)1097-4563(200005)17:5<233::AID-ROB1>3.0.CO;2-Y","article-title":"Smooth and time\u2010optimal trajectory planning for industrial manipulators along specified paths","volume":"17","year":"2000","journal-title":"Journal of Robotic Systems"},{"key":"key2022112510141959200_ref006","first-page":"1064","article-title":"Adaptive control of manipulators through repeated trials","volume-title":"Proccedings of American Control Conference","year":"1984"},{"key":"key2022112510141959200_ref007","volume-title":"Introduction to Robotics: mechanics and Control","year":"1989"},{"issue":"6","key":"key2022112510141959200_ref008","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1109\/TRO.2013.2277565","article-title":"Time-Optimal path following for robots with convex-concave constraints using sequential convex programming","volume":"29","year":"2013","journal-title":"IEEE Transactions on Robotics"},{"issue":"2","key":"key2022112510141959200_ref009","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1108\/01439911211201636","article-title":"Smooth and near time\u2010optimal trajectory planning of industrial robots for online applications","volume":"39","year":"2012","journal-title":"Industrial Robot: An International Journal"},{"issue":"3","key":"key2022112510141959200_ref010","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1115\/1.3426492","article-title":"The near-minimum-time control of open-loop articulated kinematic chains","volume":"93","year":"1971","journal-title":"Journal of Dynamic Systems, Measurement, and Control"},{"key":"key2022112510141959200_ref011","first-page":"1","article-title":"Nearly optimal path following with jerk and torque rate limits using dynamic programming","year":"2018","journal-title":"IEEE Transactions on Robotics"},{"issue":"2","key":"key2022112510141959200_ref012","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1109\/JRA.1987.1087090","article-title":"A concept for manipulator trajectory planning","volume":"3","year":"1987","journal-title":"IEEE Journal on Robotics and Automation"},{"issue":"6","key":"key2022112510141959200_ref013","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1109\/TRO.2014.2351113","article-title":"A general, fast, and robust implementation of the time-optimal path parameterization algorithm","volume":"30","year":"2014","journal-title":"IEEE Transactions on Robotics"},{"issue":"1","key":"key2022112510141959200_ref014","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1115\/1.2896505","article-title":"Computation of path constrained time optimal motions with dynamic singularities","volume":"114","year":"1992","journal-title":"Journal of Dynamic Systems, Measurement, and Control"},{"issue":"6","key":"key2022112510141959200_ref015","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1109\/TAC.1986.1104317","article-title":"A dynamic programming approach to trajectory planning of robotic manipulators","volume":"31","year":"1986","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"1","key":"key2022112510141959200_ref016","first-page":"118","article-title":"Improving the efficiency of time-optimal path-following algorithms","volume":"5","year":"2002","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"11","key":"key2022112510141959200_ref017","doi-asserted-by":"crossref","first-page":"5200","DOI":"10.1109\/TII.2018.2851963","article-title":"An efficient iterative learning approach to time-optimal path tracking for industrial robots","volume":"14","year":"2018","journal-title":"IEEE Transactions on Industrial Informatics"},{"issue":"7","key":"key2022112510141959200_ref018","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1016\/j.automatica.2004.01.026","article-title":"Adaptive iterative learning control for robot manipulators","volume":"40","year":"2004","journal-title":"Automatica"},{"issue":"10","key":"key2022112510141959200_ref019","doi-asserted-by":"crossref","first-page":"2318","DOI":"10.1109\/TAC.2009.2028959","article-title":"Time-optimal path tracking for robots: a convex optimization approach","volume":"54","year":"2009","journal-title":"IEEE Transactions on Automatic Control"},{"issue":"9","key":"key2022112510141959200_ref020","doi-asserted-by":"crossref","first-page":"2116","DOI":"10.1017\/S0263574715000247","article-title":"Time-optimal path tracking for robots under dynamics constraints based on convex optimization","volume":"34","year":"2016","journal-title":"Robotica"},{"issue":"3","key":"key2022112510141959200_ref021","doi-asserted-by":"crossref","first-page":"47","DOI":"10.3901\/JME.2010.03.047","article-title":"Time-optimal and jerk-continuous trajectory planning algorithm for manipulators","volume":"46","year":"2010","journal-title":"Journal of Mechanical Engineering"}],"container-title":["Industrial Robot: the international journal of robotics research and application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IR-03-2019-0063\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IR-03-2019-0063\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T21:38:40Z","timestamp":1753393120000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/ir\/article\/46\/6\/763-778\/433775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,6]]},"references-count":21,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2019,8,6]]},"published-print":{"date-parts":[[2019,11,14]]}},"alternative-id":["10.1108\/IR-03-2019-0063"],"URL":"https:\/\/doi.org\/10.1108\/ir-03-2019-0063","relation":{},"ISSN":["0143-991X","0143-991X"],"issn-type":[{"value":"0143-991X","type":"print"},{"value":"0143-991X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,6]]}}}