{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T10:24:03Z","timestamp":1778149443723,"version":"3.51.4"},"reference-count":33,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T00:00:00Z","timestamp":1701216000000},"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,2]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Most studies on path planning of robotic arm focus on obstacle avoidance at the end position of robotic arm, while ignoring the obstacle avoidance of robotic arm joint linkage, and the obstacle avoidance method has low flexibility and adaptability. This paper proposes a path obstacle avoidance algorithm for the overall 6-DOF robotic arm that is based on the improved A* algorithm and the artificial potential field method. In the first place, an improved A* algorithm is proposed to address the deficiencies of the conventional A* algorithm, such as a large number of search nodes and low computational efficiency, in robotic arm end path planning. The enhanced A* algorithm proposes a new node search strategy and local path optimization method, which significantly reduces the number of search nodes and enhances search efficiency. To achieve the manipulator joint rod avoiding obstacles, a method of robotic arm posture adjustment based on the artificial potential field method is proposed. The efficiency and environmental adaptability of the robotic arm path planning algorithm proposed in this paper are validated through three types of simulation analysis conducted in different environments. Finally, the AUBO-i10 robotic arm is used to conduct path avoidance tests. Experimental results demonstrate that the proposed method can make the manipulator move smoothly and effectively plan an obstacle-free path, proving the method\u2019s viability.<\/jats:p>","DOI":"10.1017\/s0263574723001546","type":"journal-article","created":{"date-parts":[[2023,11,29]],"date-time":"2023-11-29T06:20:03Z","timestamp":1701238803000},"page":"457-481","source":"Crossref","is-referenced-by-count":34,"title":["Obstacle avoidance path planning of 6-DOF robotic arm based on improved A* algorithm and artificial potential field method"],"prefix":"10.1017","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0998-1952","authenticated-orcid":false,"given":"Xianxing","family":"Tang","sequence":"first","affiliation":[]},{"given":"Haibo","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Tianying","family":"Xu","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2023,11,29]]},"reference":[{"key":"S0263574723001546_ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ROBIO.2017.8324485"},{"key":"S0263574723001546_ref31","doi-asserted-by":"publisher","DOI":"10.1108\/AA-07-2020-0095"},{"key":"S0263574723001546_ref13","first-page":"371","article-title":"Path planning based on improved particle swarm optimization algorithm","volume":"49","author":"Jia","year":"2018","journal-title":"Trans. Chin. Soc. Agric. Machin."},{"key":"S0263574723001546_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2014.09.092"},{"key":"S0263574723001546_ref28","doi-asserted-by":"publisher","DOI":"10.1177\/027836499101000605"},{"key":"S0263574723001546_ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20039-7_51"},{"key":"S0263574723001546_ref27","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.robot.2018.04.007","article-title":"An improved A* algorithm for the industrial robot path planning with high success rate and short length","volume":"106","author":"Bing","year":"2018","journal-title":"Robot. Auton. Syst."},{"key":"S0263574723001546_ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11370-021-00408-0"},{"key":"S0263574723001546_ref24","first-page":"168","article-title":"Global path planning based on a bidirectional alternating search A* algorithm for mobile robots","author":"Li","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"S0263574723001546_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-022-01576-6"},{"key":"S0263574723001546_ref1","first-page":"49","article-title":"Mechanical arm obstacle avoidance path planning based on improved artificial potential field method","volume":"2","author":"Xu","year":"2022","journal-title":"Ind. Robot."},{"key":"S0263574723001546_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-022-01687-0"},{"key":"S0263574723001546_ref12","doi-asserted-by":"publisher","DOI":"10.1108\/AA-03-2016-024"},{"key":"S0263574723001546_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.apor.2021.102995"},{"key":"S0263574723001546_ref32","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13356"},{"key":"S0263574723001546_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.protcy.2016.03.010"},{"key":"S0263574723001546_ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-022-01612-5"},{"key":"S0263574723001546_ref7","first-page":"841","article-title":"Dynamic path planning for mobile robot based on improved genetic algorithm","volume":"48","author":"Lei","year":"2016","journal-title":"J. Nanjing Univ. Aeronaut. Astronaut."},{"key":"S0263574723001546_ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-022-07300-8"},{"key":"S0263574723001546_ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"S0263574723001546_ref11","unstructured":"[11] Kennedy, J. and Eberhart, R. . Particle swarm optimization. In: Proceedings of ICNN International Conference on Neural Networks, 4, (1995) pp. 1942\u20131948."},{"key":"S0263574723001546_ref26","first-page":"7","article-title":"Motion planning method for obstacle avoidance of 6-DOF manipulator based on improved A* algorithm","volume":"32","author":"Wang","year":"2015","journal-title":"J. Donghua Univ. (Eng. Ed.)"},{"key":"S0263574723001546_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2021.107230"},{"key":"S0263574723001546_ref15","doi-asserted-by":"publisher","DOI":"10.1109\/34.58871"},{"key":"S0263574723001546_ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106960"},{"key":"S0263574723001546_ref22","unstructured":"[22] Ren, Y. Y. , Song, X. R. and Song, G. . Research on Path Planning of Mobile Robot Based on Improved A* in Special Environment. In: IEEE International Symposium on Autonomous Systems, Shanghai, China (2019) pp. 12\u201316."},{"key":"S0263574723001546_ref18","first-page":"500","article-title":"Real-time obstacle avoidance for manipulators and mobile robots","volume":"2","author":"Khatib","year":"1985","journal-title":"IEEE Int. Conf. Robot. Autom."},{"key":"S0263574723001546_ref9","first-page":"4269","article-title":"Domain knowledge based genetic algorithms for mobile robot path planning having single and multiple targets","volume":"34","author":"Rs","year":"2022","journal-title":"J. King Saud Univ. Comput. Inf. Sci."},{"key":"S0263574723001546_ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-022-01589-1"},{"key":"S0263574723001546_ref29","doi-asserted-by":"publisher","DOI":"10.3901\/JME.2010.13.109"},{"key":"S0263574723001546_ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020564024509"},{"key":"S0263574723001546_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.08.004"},{"key":"S0263574723001546_ref6","doi-asserted-by":"publisher","DOI":"10.1108\/IR-09-2021-0194"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574723001546","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,15]],"date-time":"2024-01-15T10:28:08Z","timestamp":1705314488000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574723001546\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,29]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,2]]}},"alternative-id":["S0263574723001546"],"URL":"https:\/\/doi.org\/10.1017\/s0263574723001546","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"value":"0263-5747","type":"print"},{"value":"1469-8668","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,29]]}}}