{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T18:10:07Z","timestamp":1772043007662,"version":"3.50.1"},"reference-count":33,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T00:00:00Z","timestamp":1762992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Neurorobot."],"abstract":"<jats:p>For the low efficiency and poor generalization ability of path planning algorithm of industrial robots, this work proposes an adaptive field co-sampling algorithm (AFCS). Firstly, the environment complexity function is proposed to make full use of environment information and improve its generalization ability of the traditional rapidly random search tree algorithm (RRT) algorithm. Then an optimal sampling strategy is proposed to make the improvement of the efficiency and optimal direction of RRT algorithm. Finally, this article designs a collaborative extension strategy, which introduces the improved artificial potential field algorithm (APF) into the traditional RRT algorithm to determine the new nodes, so as to improve the orientation and expansion efficiency of the algorithm. The proposed AFCS algorithm completes simulation experiments in two environments with different complexity. Compared with the traditional RRT, RRT* and tRRT algorithm, the results show that the AFCS algorithm has achieved great improvement in environmental adaptability, stability and efficiency. At last, ROKAE industrial robot is taken as the object to build a simulation environment for the path planning, which further verifies the practicability of the algorithm.<\/jats:p>","DOI":"10.3389\/fnbot.2025.1574044","type":"journal-article","created":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T06:31:49Z","timestamp":1763015509000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Path planning of industrial robots based on the adaptive field cooperative sampling algorithm"],"prefix":"10.3389","volume":"19","author":[{"given":"Yongbo","family":"Zhuang","sequence":"first","affiliation":[]},{"given":"Sha","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Qingdang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Dianming","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Wenjuan","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Xintao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Mingyuan","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Lv","family":"Wei","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2025,11,13]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","first-page":"26347","DOI":"10.1109\/ACCESS.2022.3156919","article-title":"Optimal image-based task-sequence\/path planning and robust hybrid vision\/force control of industrial robots","volume":"10","author":"Ahmadi","year":"2022","journal-title":"IEEE Access"},{"key":"ref2","doi-asserted-by":"publisher","first-page":"3292","DOI":"10.1109\/TIE.2020.2978701","article-title":"Meng Chu Zhou, an efficient RRT-based framework for planning short and smooth wheeled robot motion under inodynamic constraints","volume":"68","author":"Biao","year":"2021","journal-title":"IEEE Trans. Ind. Electron."},{"key":"ref3","doi-asserted-by":"publisher","first-page":"4926","DOI":"10.1109\/TIE.2021.3078390","article-title":"A generalized Voronoi diagram-based efficient heuristic path planning method for RRTs in Mobile robots","volume":"69","author":"Chi","year":"2022","journal-title":"IEEE Trans. Ind. Electron."},{"key":"ref4","first-page":"1","article-title":"Improved artificial potential field method applied for AUV path planning","volume":"2020","author":"Fan","year":"2020","journal-title":"Math. Probl. Eng."},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1109\/IROS.2014.6942976","article-title":"Informed RRT*: optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic","author":"Gammell","year":"2014"},{"key":"ref6","first-page":"1","author":"Ganesan","year":"2021"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1360\/aas-007-0279","article-title":"Aaron SLOMAN, Ant Colony System Algorithm for Real-Time Globally Optimal Path Planning of Mobile Robots","volume":"33","author":"Guan-Zheng","year":"2007","journal-title":"Acta Automatica Sinica"},{"key":"ref8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2022\/5692350","article-title":"Research on path planning of Mobile robot with a novel improved artificial potential field algorithm","volume":"2022","author":"Guo","year":"2022","journal-title":"Math. Probl. Eng."},{"key":"ref9","first-page":"28","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"4","author":"Hart","year":"1972","journal-title":"IEEE Trans. Syst. Sci. Cybernetics"},{"key":"ref10","volume-title":"Kinematic synthesis of linkages","author":"Hartenberg","year":"1964"},{"key":"ref11","doi-asserted-by":"publisher","first-page":"104104","DOI":"10.1016\/j.robot.2022.104104","article-title":"Development and application of key technologies for guide dog robot: a systematic literature review","volume":"154","author":"Hong","year":"2022","journal-title":"Robot. Auton. Syst."},{"key":"ref12","doi-asserted-by":"publisher","first-page":"116379","DOI":"10.1016\/j.eswa.2021.116379","article-title":"MDA + RRT: a general approach for resolving the problem of angle constraint for hyper-redundant manipulator","volume":"193","author":"Jia","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"ref13","doi-asserted-by":"publisher","first-page":"1855","DOI":"10.1017\/S0263574721001417","article-title":"Effective motion planning of manipulator based on SDPS-RRTConnect","volume":"40","author":"Junxiang","year":"2021","journal-title":"Robotica"},{"key":"ref14","doi-asserted-by":"publisher","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":"Kabutan","year":"2018","journal-title":"Electric. Eng. Japan"},{"key":"ref15","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s11370-019-00281-y","article-title":"Yong bum Kim, young Hun Lee, Hyun Seok Oh, won Suk You, Hyouk Ryeol Choi, sampling-based motion planning of manipulator with goal-oriented sampling","volume":"12","author":"Kang","year":"2019","journal-title":"Intell. Serv. Robot."},{"key":"ref16","first-page":"1285","author":"Kang","year":"2016"},{"key":"ref17","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","article-title":"Sampling-based algorithms for optimal motion planning","volume":"30","author":"Karman","year":"2011","journal-title":"Int. J. Robotics Res."},{"key":"ref18","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/70.508439","article-title":"Probabilistic roadmaps for path planning in high-dimensional configuration spaces","volume":"12","author":"Kavraki","year":"1994","journal-title":"IEEE Trans. Robot. Autom."},{"key":"ref19","doi-asserted-by":"publisher","first-page":"171730","DOI":"10.1109\/ACCESS.2020.3024630","article-title":"Shuai Li, Seifedine Kadry, Yunyoung Nam, control framework for trajectory planning of soft manipulator using optimized RRT algorithm","volume":"8","author":"Khan","year":"2020","journal-title":"IEEE Access"},{"key":"ref20","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1177\/027836498600500106","article-title":"Real-time obstacle avoidance for manipulators and Mobile robots","volume":"5","author":"Khatib","year":"1986","journal-title":"Int. J. Robotics Res."},{"key":"ref21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.promfg.2017.07.237","article-title":"Jonghwa Kimb *, Michael Kupkea, Alfons Schuster, automatic path planning of industrial robots comparing sampling-based and computational intelligence methods","volume":"11","author":"Larsena","year":"2017","journal-title":"Procedia Manufacturing"},{"key":"ref22","volume-title":"Rapidly-exploring random trees: A new tool forpath planning","author":"Lavalle","year":"1998"},{"key":"ref23","doi-asserted-by":"publisher","first-page":"62980","DOI":"10.1109\/ACCESS.2020.2983177","article-title":"A variable-step RRT* path planning algorithm for quadrotors in below-canopy","volume":"8","author":"Liu","year":"2020","journal-title":"IEEE Access"},{"key":"ref24","doi-asserted-by":"publisher","first-page":"120254","DOI":"10.1016\/j.eswa.2023.120254","article-title":"Path planning techniques for mobile robots: review and prospect","volume":"227","author":"Lixing Liu","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref25","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1186\/s13638-019-1396-2","article-title":"Arun Kumar Sangaiah, Xiaozhu Liu, Jin Wang, obstacle avoidance of mobile robots using modified artificial potential field algorithm","volume":"2019","author":"Rostami","year":"2019","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"ref26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1177\/02783649231179499","article-title":"Composable energy policies for reactive motion generation and reinforcement learning","volume":"42","author":"Urain","year":"2023","journal-title":"Int. J. Robo. Res."},{"key":"ref27","doi-asserted-by":"publisher","first-page":"2063","DOI":"10.1109\/TASE.2020.2987397","article-title":"EB-RRT: optimal motion planning for Mobile robots","volume":"17","author":"Wang","year":"2020","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"ref28","first-page":"3380","author":"Wang","year":"2022"},{"key":"ref29","doi-asserted-by":"publisher","first-page":"3571","DOI":"10.32604\/cmc.2022.022183","article-title":"Path planning based on the improved RRT* algorithm for the mining truck","volume":"71","author":"Wang","year":"2022","journal-title":"Comp. Materials Continua"},{"key":"ref30","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.3390\/s18020571","article-title":"A method on dynamic path planning for robotic manipulator autonomous obstacle avoidance based on an improved RRT algorithm","volume":"18","author":"Wei","year":"2018","journal-title":"Sensors (Basel)"},{"key":"ref31","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1504\/IJWMC.2018.096005","article-title":"Path planning for EOD robots","volume":"15","author":"Yin","year":"2018","journal-title":"Int. J. Wireless and Mobile Computing"},{"key":"ref32","doi-asserted-by":"publisher","first-page":"813","DOI":"10.3390\/a14110321","article-title":"Path planning of a mechanical arm based on an improved artificial potential field and a rapid expansion random tree hybrid algorithm","volume":"14","author":"Yuan","year":"2021","journal-title":"Algorithms"},{"key":"ref33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/jmse7050132","article-title":"A path-planning strategy for unmanned surface vehicles based on an adaptive hybrid dynamic Stepsize and target attractive force-RRT algorithm","volume":"7","author":"Zhang","year":"2019","journal-title":"J Mar Sci Eng"}],"updated-by":[{"DOI":"10.3389\/fnbot.2025.1754834","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000}}],"container-title":["Frontiers in Neurorobotics"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fnbot.2025.1574044\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T13:17:34Z","timestamp":1767791854000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fnbot.2025.1574044\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,13]]},"references-count":33,"alternative-id":["10.3389\/fnbot.2025.1574044"],"URL":"https:\/\/doi.org\/10.3389\/fnbot.2025.1574044","relation":{},"ISSN":["1662-5218"],"issn-type":[{"value":"1662-5218","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,13]]},"article-number":"1574044"}}