{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T06:40:33Z","timestamp":1782715233487,"version":"3.54.5"},"reference-count":39,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T00:00:00Z","timestamp":1704326400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Dual-robot system has been widely applied to the field of handling and palletizing for its high efficiency and large workspace. It is one of the key problems of the trajectory planning to determine the collision avoidance method of the dual-robot system. In the present study, a collision avoidance trajectory planning method for the dual-robot system was proposed on the basis of a modified artificial potential field (APF) algorithm. The interference and collision criterion of the dual-robot system was given firstly, which was established based on the method of kinematic analysis in robotics. And then, in consideration of the problem of excessive virtual potential field force induced by using the traditional APF algorithm in the process of dual-robot trajectory planning, a modified APF algorithm was proposed. Finally, the modified APF algorithm was used for motion control of a dual-robot palletizing process, and the collision avoidance performance of the proposed collision avoidance algorithm was studied through a dual-robot palletizing simulation and experiment. The results have shown that with the proposed collision avoidance trajectory planning algorithm, the two robots in dual-robot system can maintain a safe distance at all times during palletizing process. Compared with the traditional APF and rapidly-exploring random tree (RRT) algorithm, the trajectory solution time of the modified APF algorithm is greatly reduced. And the modified APF algorithm\u2019s convergence time is 14.2% shorter than that of the traditional APF algorithm.<\/jats:p>","DOI":"10.1017\/s0263574723001807","type":"journal-article","created":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T07:04:41Z","timestamp":1704351881000},"page":"846-863","source":"Crossref","is-referenced-by-count":25,"title":["Collision avoidance trajectory planning for a dual-robot system: using a modified APF method"],"prefix":"10.1017","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3354-5296","authenticated-orcid":false,"given":"Dong","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Li","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun Kang","family":"Dai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2024,1,4]]},"reference":[{"key":"S0263574723001807_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2014.12.098"},{"key":"S0263574723001807_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-022-08809-w"},{"key":"S0263574723001807_ref37","doi-asserted-by":"publisher","DOI":"10.3390\/app11052114"},{"key":"S0263574723001807_ref39","doi-asserted-by":"publisher","DOI":"10.3390\/s21020333"},{"key":"S0263574723001807_ref17","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20109"},{"key":"S0263574723001807_ref35","volume-title":"IEEE International Conference on Robotics and Automation (ICRA)","author":"Kosuge","year":"1990"},{"key":"S0263574723001807_ref10","doi-asserted-by":"publisher","DOI":"10.1177\/1729881417728021"},{"key":"S0263574723001807_ref25","first-page":"637","article-title":"Distributed path planning of a multi-robot system based on the neighborhood APF approach","volume":"95","author":"Fethi","year":"2018","journal-title":"Simul. Trans. Soc. Mod. Simul."},{"key":"S0263574723001807_ref34","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6710"},{"key":"S0263574723001807_ref1","doi-asserted-by":"publisher","DOI":"10.3389\/fnbot.2017.00047"},{"key":"S0263574723001807_ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s00170-020-06124-w"},{"key":"S0263574723001807_ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2994304"},{"key":"S0263574723001807_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s12555-018-0236-1"},{"key":"S0263574723001807_ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1014617010456"},{"key":"S0263574723001807_ref24","doi-asserted-by":"crossref","first-page":"4670","DOI":"10.1109\/TII.2019.2941916","article-title":"Obstacle avoidance and tracking control of redundant robotic manipulator: An RNN-based metaheuristic approach","volume":"16","author":"Ameer","year":"2020","journal-title":"IEEE Trans. Ind. Inform."},{"key":"S0263574723001807_ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2981688"},{"key":"S0263574723001807_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s12206-010-0312-9"},{"key":"S0263574723001807_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.mechatronics.2012.05.001"},{"key":"S0263574723001807_ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2018.2886798"},{"key":"S0263574723001807_ref27","doi-asserted-by":"publisher","DOI":"10.1177\/1729881418799562"},{"key":"S0263574723001807_ref28","doi-asserted-by":"crossref","first-page":"26059","DOI":"10.1109\/ACCESS.2021.3056397","article-title":"A motion planning algorithm for redundant manipulators using rapidly exploring randomized trees and APFs","volume":"9","author":"Anoush","year":"2021","journal-title":"IEEE Access"},{"key":"S0263574723001807_ref29","doi-asserted-by":"publisher","DOI":"10.3390\/app10030935"},{"key":"S0263574723001807_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s12555-019-0076-7"},{"key":"S0263574723001807_ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2006.878789"},{"key":"S0263574723001807_ref26","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500106"},{"key":"S0263574723001807_ref31","doi-asserted-by":"publisher","DOI":"10.3390\/electronics10151850"},{"key":"S0263574723001807_ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s12555-017-0757-z"},{"key":"S0263574723001807_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11465-021-0638-2"},{"key":"S0263574723001807_ref23","doi-asserted-by":"publisher","DOI":"10.3389\/fnbot.2019.00047"},{"key":"S0263574723001807_ref7","doi-asserted-by":"publisher","DOI":"10.1109\/70.163787"},{"key":"S0263574723001807_ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JRA.1987.1087095"},{"key":"S0263574723001807_ref21","doi-asserted-by":"publisher","DOI":"10.1017\/S0263574714000393"},{"key":"S0263574723001807_ref38","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/eej.23103","article-title":"Motion planning by T-RRT with potential function for vertical articulated robots","volume":"204","author":"Ryo","year":"2018","journal-title":"Electr. Eng. Jpn."},{"key":"S0263574723001807_ref32","doi-asserted-by":"publisher","DOI":"10.1108\/IR-06-2021-0120"},{"key":"S0263574723001807_ref8","doi-asserted-by":"publisher","DOI":"10.1109\/21.279000"},{"key":"S0263574723001807_ref33","doi-asserted-by":"publisher","DOI":"10.3390\/app112311336"},{"key":"S0263574723001807_ref16","doi-asserted-by":"publisher","DOI":"10.1002\/rob.20014"},{"key":"S0263574723001807_ref36","doi-asserted-by":"publisher","DOI":"10.1177\/027836498600500106"},{"key":"S0263574723001807_ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2980038"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574723001807","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T09:55:14Z","timestamp":1707818114000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574723001807\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,4]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["S0263574723001807"],"URL":"https:\/\/doi.org\/10.1017\/s0263574723001807","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,4]]}}}