{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T18:07:25Z","timestamp":1774721245787,"version":"3.50.1"},"reference-count":22,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:00:00Z","timestamp":1660521600000},"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":[[2023,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A welding path can be planned effectively for spot welding robots using the ant colony algorithm, but the initial parameters of the ant colony algorithm are usually selected through human experience, resulting in an unreasonable planned path. This paper combines the ant colony algorithm with the particle swarm algorithm and uses the particle swarm algorithm to train the initial parameters of the ant colony algorithm to plan an optimal path. Firstly, a mathematical model for spot welding path planning is established using the ant colony algorithm. Then, the particle swarm algorithm is introduced into the ant colony algorithm to find the optimal combination of parameters by treating the initial parameters <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S026357472200114X_inline1.png\"\/><jats:tex-math>\n$\\alpha$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S026357472200114X_inline2.png\"\/><jats:tex-math>\n$\\beta$\n<\/jats:tex-math><\/jats:alternatives><\/jats:inline-formula> of the ant colony algorithm and as two-dimensional coordinates in the particle swarm algorithm. Finally, the simulation analysis was carried out using MATLAB to obtain the paths of the improved ant colony algorithm for six different sets of parameters with an average path length of 10,357.7509 mm, but the average path length obtained by conventional algorithm was 10,830.8394 mm. Convergence analysis of the improved ant colony algorithm showed that the average number of iterations was 17. Therefore, the improved ant colony algorithm has higher solution quality and converges faster.<\/jats:p>","DOI":"10.1017\/s026357472200114x","type":"journal-article","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T12:10:55Z","timestamp":1660565455000},"page":"926-938","source":"Crossref","is-referenced-by-count":34,"title":["Path planning for spot welding robots based on improved ant colony algorithm"],"prefix":"10.1017","volume":"41","author":[{"given":"Yuesheng","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5776-0885","authenticated-orcid":false,"given":"Jie","family":"Ouyang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuo","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinglun","family":"Lao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pengju","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"S026357472200114X_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.plrev.2005.10.001"},{"key":"S026357472200114X_ref1","first-page":"6","article-title":"Research on path planning and related algorithms for robots","volume":"20","author":"Zhuang","year":"2004","journal-title":"Bull. Sci. Technol"},{"key":"S026357472200114X_ref8","first-page":"32","article-title":"Global dynamic path planning fusion algorithm combining jump-A* algorithm and dynamic window approach","volume":"9","author":"Liu","year":"2021","journal-title":"IEEE Access"},{"key":"S026357472200114X_ref17","article-title":"Research on evacuation path planning in single-story building fire based on genetic-ant colony algorithm","volume":"16","author":"Jia","year":"2020","journal-title":"J. Saf. Sci. Technol"},{"key":"S026357472200114X_ref18","unstructured":"[18] Yang, J. F. , \u201cAnt Colony Algorithm and Its Application Research,\u201d (Zhejiang University, Zhejiang, 2008) pp. 1\u2013135."},{"key":"S026357472200114X_ref22","doi-asserted-by":"publisher","DOI":"10.1177\/1729881420936154"},{"key":"S026357472200114X_ref13","first-page":"5","article-title":"Application of ant colony algorithm in welding path planning of BIW","volume":"36","author":"Ling","year":"2015","journal-title":"Trans. China Weld. Inst"},{"key":"S026357472200114X_ref2","first-page":"6","article-title":"Path planning of manipulator to avoid obstacle based on improved artificial potential field method","volume":"26","author":"Zhu","year":"2018","journal-title":"Comput. Meas. Cont"},{"key":"S026357472200114X_ref10","first-page":"1","article-title":"Constrained sampling method based RRT algorithm for manipulator motion planning","volume":"40","author":"Zhang","year":"2022","journal-title":"Comput. Integr. Manuf."},{"key":"S026357472200114X_ref7","doi-asserted-by":"crossref","first-page":"106443","DOI":"10.1016\/j.asoc.2020.106443","article-title":"A parallel compact cuckoo search algorithm for three-dimensional path planning","volume":"94","author":"Pei","year":"2020","journal-title":"Appl. Soft. Comput."},{"key":"S026357472200114X_ref3","article-title":"Path planning of indoor mobile robot based on improved ant colony algorithm","volume":"42","author":"Liang","year":"2019","journal-title":"Electron. Meas. Technol"},{"key":"S026357472200114X_ref14","first-page":"1","article-title":"Mobile robot path planning using ant colony algorithm and improved potential field method","volume":"b","author":"Chen","year":"2019","journal-title":"Comput. Intel. Neurosci."},{"key":"S026357472200114X_ref15","first-page":"11","article-title":"Ant colony optimization with improved potential field heuristic for robot path planning","volume":"50","author":"Zhang","year":"2019","journal-title":"Trans. Chin. Soc. Agric. Mach"},{"key":"S026357472200114X_ref16","first-page":"531","article-title":"Path planning of mobile robot based on improved adaptive ant colony algorithm","volume":"31","author":"Xu","year":"2019","journal-title":"J. Electron. Meas. Instrument"},{"key":"S026357472200114X_ref5","first-page":"2482","article-title":"Welding spot detection path planning method based on a novel particle swarm algorithm","volume":"35","author":"Zhu","year":"2014","journal-title":"Chin J. Sci. Instrum."},{"key":"S026357472200114X_ref20","doi-asserted-by":"publisher","DOI":"10.1134\/S1064230710010053"},{"key":"S026357472200114X_ref4","first-page":"1","article-title":"Rapidly-exploring random trees: a new tool for path planning","volume":"98","author":"Lavalle","year":"1998","journal-title":"Computer Science Dept"},{"key":"S026357472200114X_ref21","first-page":"402","article-title":"Solving traveling salesman problem by an ACO and PSO based hybrid algorithm","volume":"13","author":"Min","year":"2006","journal-title":"J. Jilin Univ. (Inform. Sci. Edn.)"},{"key":"S026357472200114X_ref11","unstructured":"[11] Xue, W. W. , Yang, P. S. , Rui, Y. and X. S. Gu, \u201cIntelligent Welding Robot Path Planning,\u201d In: Proceedings of the 2015 China Intelligent Automation Academic Conference (2nd fascicle) (2015), pp. 36\u201343."},{"key":"S026357472200114X_ref12","first-page":"16","article-title":"A study on BIW welding robot path planning based on ant colony algorithm","volume":"30","author":"Wang","year":"2008","journal-title":"Manufact. Automat"},{"key":"S026357472200114X_ref6","doi-asserted-by":"publisher","DOI":"10.1002\/rob.1036"},{"key":"S026357472200114X_ref9","first-page":"77","article-title":"Improved artificial potential field method for dual-manipulator path planning algorithm","volume":"45","author":"Ma","year":"2021","journal-title":"J. Mech. Trans"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S026357472200114X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T05:28:09Z","timestamp":1675834089000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S026357472200114X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,15]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["S026357472200114X"],"URL":"https:\/\/doi.org\/10.1017\/s026357472200114x","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,15]]}}}