{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T02:19:11Z","timestamp":1773973151604,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62076095"],"award-info":[{"award-number":["62076095"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61973120"],"award-info":[{"award-number":["61973120"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/lra.2021.3092267","type":"journal-article","created":{"date-parts":[[2021,7,20]],"date-time":"2021-07-20T19:58:16Z","timestamp":1626811096000},"page":"6353-6360","source":"Crossref","is-referenced-by-count":34,"title":["Dual-Objective Collision-Free Path Optimization of Arc Welding Robot"],"prefix":"10.1109","volume":"6","author":[{"given":"Xuewu","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jianbin","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Zelong","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Xingsheng","family":"Gu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICInfA.2015.7279492"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.mechmachtheory.2017.04.009"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.769931"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmapro.2020.04.085"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1985.1087247"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref17","article-title":"Rapidly-exploring random trees: A new tool for path planning","author":"lavalle","year":"1998"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2856927"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4028\/www.scientific.net\/AMR.317-319.723"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281534"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2020.2968099"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281535"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.procir.2015.02.174"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2012.6491230"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2848921"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmapro.2019.04.014"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2018.07.010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/rob.4620110705"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2015.1005084"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3057011"},{"key":"ref20","article-title":"Optimal bidirectional rapidly-exploring random trees","author":"jordan","year":"2013"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844107"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3390\/jmse7050132"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2015.02.007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/4235.996017"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9475905\/09464688.pdf?arnumber=9464688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:54:08Z","timestamp":1652194448000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9464688\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":30,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3092267","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}