{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T16:39:16Z","timestamp":1776443956469,"version":"3.51.2"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T00:00:00Z","timestamp":1642723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51865004"],"award-info":[{"award-number":["51865004"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Aiming to build upon the slow convergence speed and low search efficiency of the potential function-based rapidly exploring random tree star (RRT*) algorithm (P_RRT*), this paper proposes a path planning method for manipulators with an improved P_RRT* algorithm (defined as improved P_RRT*), which is used to solve the path planning problem for manipulators in three-dimensional space. This method first adopts a random sampling method based on a potential function. Second, based on a probability value, the nearest neighbour node is selected by the nearest Euclidean distance to the random sampling point and the minimum cost function, and in the expansion of new nodes, twice expansion methods are used to accelerate the search efficiency of the algorithm. The first expansion adopts the goal-biased expansion strategy, and the second expansion adopts the strategy of random sampling in a rectangular area. Then, the parent node of the new node is reselected, and the path is rerouted to obtain a clear path from the initial point to the target point. Redundant node deletion and the maximum curvature constraint are used to remove redundant nodes and minimize the curvature on the generated path to reduce the tortuosity of the path. The Bezier curve is used to fit the processed path and obtain the trajectory planning curve for the manipulator. Finally, the improved P_RRT* algorithm is verified experimentally in Python and the Robot Operating System (ROS) and compared with other algorithms. The experimental results verify the effectiveness and superiority of the improved algorithm.<\/jats:p>","DOI":"10.1007\/s40747-021-00628-y","type":"journal-article","created":{"date-parts":[[2022,1,21]],"date-time":"2022-01-21T05:31:54Z","timestamp":1642743114000},"page":"2227-2245","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":63,"title":["Path planning of a manipulator based on an improved P_RRT* algorithm"],"prefix":"10.1007","volume":"8","author":[{"given":"Junhui","family":"Yi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6747-7864","authenticated-orcid":false,"given":"Qingni","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Ruitong","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Huan","family":"Bai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,21]]},"reference":[{"issue":"3","key":"628_CR1","doi-asserted-by":"publisher","first-page":"2553","DOI":"10.1109\/LRA.2018.2809964","volume":"3","author":"A Suarez","year":"2018","unstructured":"Suarez A, Heredia G, Ollero A (2018) Physical-virtual impedance control in ultralightweight and compliant dual-arm aerial manipulators. IEEE Robot Autom Lett 3(3):2553\u20132560","journal-title":"IEEE Robot Autom Lett"},{"key":"628_CR2","doi-asserted-by":"crossref","unstructured":"Zeng A, Yu K T, Song S (2017) Multi-view self-supervised deep learning for 6D pose estimation in the Amazon Picking Challenge[C]. In: 2017 IEEE Int Conf robot Autom (ICRA) IEEE 1386\u20131383","DOI":"10.1109\/ICRA.2017.7989165"},{"issue":"2","key":"628_CR3","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1109\/TII.2018.2879426","volume":"15","author":"F Chen","year":"2018","unstructured":"Chen F, Selvaggio M, Caldwell DG (2018) Dexterous grasping by manipulability selection for mobile manipulator with visual guidance. IEEE Trans Ind Inf 15(2):1202\u20131210","journal-title":"IEEE Trans Ind Inf"},{"issue":"2","key":"628_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s12541-018-0025-z","volume":"19","author":"M Wang","year":"2018","unstructured":"Wang M, Hou Z (2018) Continuous trajectory point control research of six degree of freedom mechanical intelligent arm position. Int J Precis Eng Manuf 19(2):221\u2013226","journal-title":"Int J Precis Eng Manuf"},{"key":"628_CR5","unstructured":"Lavalle S M (1998) Rapidly-exploring random trees: a new tool for path planning. 1998"},{"key":"628_CR6","unstructured":"Li Y Z, Wang S T, Jiang L Q, Meng J, Xie Y L (2021) Mobile manipulator motion planning based on sparse node RRT. China Mech Eng 1\u20138"},{"key":"628_CR7","doi-asserted-by":"publisher","first-page":"113425","DOI":"10.1016\/j.eswa.2020.113425","volume":"152","author":"Y Li","year":"2020","unstructured":"Li Y, Wei W, Gao Y (2020) PQ-RRT*: an improved path planning algorithm for mobile robots. Expert Syst Appl 152:113425","journal-title":"Expert Syst Appl"},{"issue":"1","key":"628_CR8","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s10846-017-0641-3","volume":"90","author":"W Wang","year":"2018","unstructured":"Wang W, Zuo L, Xu X (2018) A learning-based multi-RRT approach for robot path planning in narrow passages. J Intell Robot Syst 90(1):81\u2013100","journal-title":"J Intell Robot Syst"},{"key":"628_CR9","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.eswa.2019.01.032","volume":"123","author":"IB Jeong","year":"2019","unstructured":"Jeong IB, Lee SJ, Kim JH (2019) Quick-RRT*: triangular inequality-based implementation of RRT* with improved initial solution and convergence rate. Expert Syst Appl 123:82\u201390","journal-title":"Expert Syst Appl"},{"issue":"2","key":"628_CR10","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s12369-017-0448-1","volume":"10","author":"N P\u00e9rez-Higueras","year":"2018","unstructured":"P\u00e9rez-Higueras N, Caballero F, Merino L (2018) Teaching robot navigation behaviors to optimal RRT planners. Int J Soc Robot 10(2):235\u2013249","journal-title":"Int J Soc Robot"},{"issue":"11","key":"628_CR11","doi-asserted-by":"publisher","first-page":"8718","DOI":"10.1109\/TIE.2018.2816000","volume":"65","author":"Y Li","year":"2018","unstructured":"Li Y, Cui R, Li Z (2018) Neural network approximation based near-optimal motion planning with kinodynamic constraints using RRT. IEEE Trans Ind Electron 65(11):8718\u20138729","journal-title":"IEEE Trans Ind Electron"},{"issue":"6","key":"628_CR12","doi-asserted-by":"publisher","first-page":"2568","DOI":"10.1109\/TMECH.2018.2821767","volume":"23","author":"L Chen","year":"2018","unstructured":"Chen L, Shan Y, Tian W (2018) A fast and efficient double-tree RRT*-like sampling-based planner applying on mobile robotic systems. IEEE\/ASME Trans Mechatron 23(6):2568\u20132578","journal-title":"IEEE\/ASME Trans Mechatron"},{"key":"628_CR13","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.eswa.2018.01.035","volume":"99","author":"A Hidalgo-Paniagua","year":"2018","unstructured":"Hidalgo-Paniagua A, Bandera JP, Ruiz-de-Quintanilla M (2018) Quad-RRT: a real-time GPU-based global path planner in large-scale real environments. Expert Syst Appl 99:141\u2013154","journal-title":"Expert Syst Appl"},{"key":"628_CR14","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.anucene.2018.01.007","volume":"115","author":"N Chao","year":"2018","unstructured":"Chao N, Liu Y, Xia H (2018) Grid-based RRT* for minimum dose walking path-planning in complex radioactive environments. Ann Nucl Energy 115:73\u201382","journal-title":"Ann Nucl Energy"},{"issue":"11","key":"628_CR15","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1007\/s12541-019-00224-8","volume":"20","author":"H Ryu","year":"2019","unstructured":"Ryu H, Park Y (2019) Improved informed RRT* using gridmap skeletonization for mobile robot path planning. Int J Precis Eng Manuf 20(11):2033\u20132039","journal-title":"Int J Precis Eng Manuf"},{"key":"628_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00521-021-06179-0","volume":"33","author":"F Kiani","year":"2021","unstructured":"Kiani F, Seyyedabbasi A, Aliyev R (2021) Adapted-RRT: novel hybrid method to solve three-dimensional path planning problem using sampling and metaheuristic-based algorithms. Neural Comput Appl 33:1\u201331","journal-title":"Neural Comput Appl"},{"issue":"8","key":"628_CR17","doi-asserted-by":"publisher","first-page":"7244","DOI":"10.1109\/TIE.2020.2998740","volume":"68","author":"J Qi","year":"2020","unstructured":"Qi J, Yang H, Sun H (2020) MOD-RRT*: a sampling-based algorithm for robot path planning in dynamic environment. IEEE Trans Ind Electron 68(8):7244\u20137251","journal-title":"IEEE Trans Ind Electron"},{"issue":"6","key":"628_CR18","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1007\/s10514-015-9518-0","volume":"40","author":"AH Qureshi","year":"2016","unstructured":"Qureshi AH, Ayaz Y (2016) Potential functions based sampling heuristic for optimal path planning. Auton Robot 40(6):1079\u20131093","journal-title":"Auton Robot"},{"issue":"99","key":"628_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TIE.2020.3044776","volume":"PP","author":"Y Hu","year":"2020","unstructured":"Hu Y, Su H, Fu J (2020) Nonlinear model predictive control for mobile medical robot using neural optimization. IEEE Trans Ind Electr PP(99):1\u20131. https:\/\/doi.org\/10.1109\/TIE.2020.3044776","journal-title":"IEEE Trans Ind Electr"},{"key":"628_CR20","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3062336","author":"Y Hu","year":"2021","unstructured":"Hu Y, Li J, Chen Y (2021) Design and control of a highly redundant rigid-flexible coupling robot to assist the COVID-19 oropharyngeal-swab sampling. IEEE Robot Automat Lett. https:\/\/doi.org\/10.1109\/LRA.2021.3062336","journal-title":"IEEE Robot Automat Lett"},{"key":"628_CR21","unstructured":"Jordan M, Perez A (2013) Optimal bidirectional rapidly-exploring random trees."},{"issue":"2","key":"628_CR22","doi-asserted-by":"publisher","first-page":"571","DOI":"10.3390\/s18020571","volume":"18","author":"K Wei","year":"2018","unstructured":"Wei K, Ren B (2018) A method on dynamic path planning for robotic manipulator autonomous obstacle avoidance based on an improved RRT algorithm. Sensors 18(2):571","journal-title":"Sensors"},{"issue":"7","key":"628_CR23","doi-asserted-by":"publisher","first-page":"299","DOI":"10.5772\/56718","volume":"10","author":"J Nasir","year":"2013","unstructured":"Nasir J, Islam F, Malik U (2013) RRT*-SMART: a rapid convergence implementation of RRT. Int J Adv Rob Syst 10(7):299","journal-title":"Int J Adv Rob Syst"},{"issue":"08","key":"628_CR24","first-page":"1834","volume":"36","author":"JH Tan","year":"2020","unstructured":"Tan JH, Pan B (2020) Robot path planning based on improved RRT * FN algorithm. Control decis 36(08):1834\u20131840","journal-title":"Control decis"},{"issue":"7","key":"628_CR25","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. Int J Robot Res 30(7):846\u2013894","journal-title":"Int J Robot Res"},{"key":"628_CR26","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1109\/ACCESS.2019.2958876","volume":"8","author":"C Yuan","year":"2019","unstructured":"Yuan C, Zhang W, Liu G (2019) A heuristic rapidly-exploring random trees method for manipulator motion planning. IEEE Access 8:900\u2013910","journal-title":"IEEE Access"},{"issue":"01","key":"628_CR27","first-page":"31","volume":"49","author":"WM Zhang","year":"2021","unstructured":"Zhang WM, Fu SX (2021) Path planning of mobile robot based on improved RRT* algorithm. J Huazhong Univ Sci Technol 49(01):31\u201336","journal-title":"J Huazhong Univ Sci Technol"},{"key":"628_CR28","doi-asserted-by":"crossref","unstructured":"Shi Y, Li Q, Bu S (2020) Research on intelligent vehicle path planning based on rapidly-exploring random tree. Math Probl Eng 1\u201314","DOI":"10.1155\/2020\/5910503"},{"issue":"6","key":"628_CR29","doi-asserted-by":"publisher","first-page":"2244","DOI":"10.3390\/s21062244","volume":"21","author":"SM Yang","year":"2021","unstructured":"Yang SM, Lin YA (2021) Development of an improved rapidly exploring random trees algorithm for static obstacle avoidance in autonomous vehicles. Sensor 21(6):2244","journal-title":"Sensor"},{"issue":"1","key":"628_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10846-017-0531-8","volume":"88","author":"S Gim","year":"2017","unstructured":"Gim S, Adouane L, Lee S (2017) Clothoids composition method for smooth path generation of car-like vehicle navigation. J Intell Robot Syst 88(1):1\u201318","journal-title":"J Intell Robot Syst"},{"key":"628_CR31","doi-asserted-by":"publisher","first-page":"108495","DOI":"10.1016\/j.automatica.2019.108495","volume":"108","author":"Y Ding","year":"2019","unstructured":"Ding Y, Xin B, Chen J (2019) Curvature-constrained path elongation with expected length for Dubins vehicle. Autom 108:108495","journal-title":"Autom"},{"issue":"1","key":"628_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3934\/mbe.2021001","volume":"18","author":"X Xiong","year":"2021","unstructured":"Xiong X, Min H, Yu Y (2021) Application improvement of A* algorithm in intelligent vehicle trajectory planning. Math Biosci Eng MBE 18(1):1\u201321","journal-title":"Math Biosci Eng MBE"},{"issue":"1","key":"628_CR33","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1109\/TASE.2016.2605707","volume":"15","author":"H Lee","year":"2016","unstructured":"Lee H, Kim H, Kim HJ (2016) Planning and control for collision-free cooperative aerial transportation. IEEE Trans Autom Sci Eng 15(1):189\u2013201","journal-title":"IEEE Trans Autom Sci Eng"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00628-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00628-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00628-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T01:17:34Z","timestamp":1653873454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00628-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,21]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["628"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00628-y","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,21]]},"assertion":[{"value":"8 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Junhui Yi, Qingni Yuan, Ruitong Sun, Huan Bai consent to participate.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Junhui Yi, Qingni Yuan, Ruitong Sun, Huan Bai Consent for publication.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}