{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,17]],"date-time":"2026-05-17T00:10:33Z","timestamp":1778976633447,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"20","license":[{"start":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:00:00Z","timestamp":1687824000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T00:00:00Z","timestamp":1687824000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["1808085MF172"],"award-info":[{"award-number":["1808085MF172"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972439"],"award-info":[{"award-number":["61972439"]}],"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":["61702010"],"award-info":[{"award-number":["61702010"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Program in the Youth Elite Support Plan in Universities of Anhui Province","award":["gxyqZD2020004"],"award-info":[{"award-number":["gxyqZD2020004"]}]},{"name":"Key Program in the Youth Elite Support Plan in Universities of Anhui Province","award":["gxyqZD2019010"],"award-info":[{"award-number":["gxyqZD2019010"]}]},{"name":"The University Synergy Innovation Program of Anhui Province","award":["GXXT-2021-007"],"award-info":[{"award-number":["GXXT-2021-007"]}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"crossref","award":["2108085MF214"],"award-info":[{"award-number":["2108085MF214"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00500-023-08674-z","type":"journal-article","created":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T11:15:40Z","timestamp":1687864540000},"page":"15057-15073","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Improved path planning algorithm for mobile robots"],"prefix":"10.1007","volume":"27","author":[{"given":"Liping","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyu","family":"Duan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pingan","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyao","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qingying","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4987-0376","authenticated-orcid":false,"given":"Yonglong","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,27]]},"reference":[{"key":"8674_CR1","doi-asserted-by":"publisher","unstructured":"Broumi S, Talea M, Bakali A, Smarandache F (2016) Application of dijkstra algorithm for solving interval valued neutrosophic shortest path problem. In: 2016 IEEE symposium series on computational intelligence (SSCI), pp 1\u20136. https:\/\/doi.org\/10.1109\/SSCI.2016.7850151","DOI":"10.1109\/SSCI.2016.7850151"},{"issue":"5","key":"8674_CR2","doi-asserted-by":"publisher","first-page":"4926","DOI":"10.1109\/TIE.2021.3078390","volume":"69","author":"W Chi","year":"2022","unstructured":"Chi W, Ding Z, Wang J, Chen G, Sun L (2022) A generalized Voronoi diagram-based efficient heuristic path planning method for RRTs in mobile robots. IEEE Trans Ind Electron 69(5):4926\u20134937. https:\/\/doi.org\/10.1109\/TIE.2021.3078390","journal-title":"IEEE Trans Ind Electron"},{"issue":"26","key":"8674_CR3","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.neucom.2016.05.057","volume":"207","author":"PK Das","year":"2016","unstructured":"Das PK, Behera HS, Das S, Tripathy HK, Panigrahi BK, Pradhan SK (2016) A hybrid improved PSO-DV algorithm for multi-robot path planning in a clutter environment. Neurocomputing 207(26):735\u2013753. https:\/\/doi.org\/10.1016\/j.neucom.2016.05.057","journal-title":"Neurocomputing"},{"issue":"1","key":"8674_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/bf01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269\u2013271. https:\/\/doi.org\/10.1007\/bf01386390","journal-title":"Numer Math"},{"key":"8674_CR5","doi-asserted-by":"publisher","unstructured":"Dragan AD, Lee KCT, Srinivasa SS (2013) Legibility and predictability of robot motion. In: 2013 8th ACM\/IEEE international conference on human-robot interaction (HRI), pp 301\u2013308. https:\/\/doi.org\/10.1109\/HRI.2013.6483603","DOI":"10.1109\/HRI.2013.6483603"},{"issue":"8","key":"8674_CR6","doi-asserted-by":"publisher","first-page":"6139","DOI":"10.1007\/s00500-020-04749-3","volume":"24","author":"WX Gao","year":"2020","unstructured":"Gao WX, Tang Q, Ye BF, Yang YR, Yao J (2020) An enhanced heuristic ant colony optimization for mobile robot path planning. Soft Comput 24(8):6139\u20136150. https:\/\/doi.org\/10.1007\/s00500-020-04749-3","journal-title":"Soft Comput"},{"key":"8674_CR7","doi-asserted-by":"publisher","unstructured":"Heiden E, Palmieri L, Koenig S, Arras KO, Sukhatme GS (2018) Gradient-informed path smoothing for wheeled mobile robots. In: 2018 IEEE international conference on robotics and automation (ICRA), pp 1710\u20131717. https:\/\/doi.org\/10.1109\/ICRA.2018.8460818","DOI":"10.1109\/ICRA.2018.8460818"},{"issue":"June","key":"8674_CR8","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(June):82\u201390. https:\/\/doi.org\/10.1016\/j.eswa.2019.01.032","journal-title":"Expert Syst Appl"},{"issue":"4","key":"8674_CR9","doi-asserted-by":"publisher","first-page":"638","DOI":"10.3390\/App9040638","volume":"9","author":"JW Jung","year":"2019","unstructured":"Jung JW, So BC, Kang JG, Lim DW, Son Y (2019) Expanded Douglas\u2013Peucker polygonal approximation and opposite angle-based exact cell decomposition for path planning with curvilinear obstacles. Appl Sci Basel 9(4):638. https:\/\/doi.org\/10.3390\/App9040638","journal-title":"Appl Sci Basel"},{"key":"8674_CR10","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:846\u2013894. https:\/\/doi.org\/10.1177\/0278364911406761","journal-title":"Int J Robot Res"},{"key":"8674_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2015.11.004","volume":"332","author":"J Lee","year":"2016","unstructured":"Lee J, Kim DW (2016) An effective initialization method for genetic algorithm-based robot path planning using a directed acyclic graph. Inf Sci 332:1\u201318. https:\/\/doi.org\/10.1016\/j.ins.2015.11.004","journal-title":"Inf Sci"},{"issue":"19","key":"8674_CR12","doi-asserted-by":"publisher","first-page":"5829","DOI":"10.1007\/s00500-016-2161-7","volume":"21","author":"JH Liu","year":"2017","unstructured":"Liu JH, Yang JG, Liu HP, Tian XJ, Gao M (2017) An improved ant colony algorithm for robot path planning. Soft Comput 21(19):5829\u20135839. https:\/\/doi.org\/10.1007\/s00500-016-2161-7","journal-title":"Soft Comput"},{"key":"8674_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117191","volume":"199","author":"ES Low","year":"2022","unstructured":"Low ES, Ong P, Low CY, Omar R (2022) Modified q-learning with distance metric and virtual target on path planning of mobile robot. Expert Syst Appl 199:117191. https:\/\/doi.org\/10.1016\/j.eswa.2022.117191","journal-title":"Expert Syst Appl"},{"key":"8674_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.robot.2016.08.001","volume":"86","author":"TT Mac","year":"2016","unstructured":"Mac TT, Copot C, Tran DT, De Keyser R (2016) Heuristic approaches in robot path planning: a survey. Robot Auton Syst 86:13\u201328. https:\/\/doi.org\/10.1016\/j.robot.2016.08.001","journal-title":"Robot Auton Syst"},{"key":"8674_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.7726\/jame.2013.1003","volume":"1","author":"P Mohanty","year":"2013","unstructured":"Mohanty P, Parhi D (2013) Controlling the motion of an autonomous mobile robot using various techniques: a review. J Adv Mech Eng 1:24\u201339. https:\/\/doi.org\/10.7726\/jame.2013.1003","journal-title":"J Adv Mech Eng"},{"issue":"13","key":"8674_CR16","doi-asserted-by":"publisher","first-page":"6131","DOI":"10.1007\/s00500-022-07075-y","volume":"26","author":"X Na","year":"2022","unstructured":"Na X, Wang J, Han M, Li D (2022) Gradient eigendecomposition invariance biogeography-based optimization for mobile robot path planning. Soft Comput 26(13):6131\u20136144. https:\/\/doi.org\/10.1007\/s00500-022-07075-y","journal-title":"Soft Comput"},{"issue":"10","key":"8674_CR17","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1177\/0278364912453186","volume":"31","author":"J Pan","year":"2012","unstructured":"Pan J, Zhang LJ, Manocha D (2012) Collision-free and smooth trajectory computation in cluttered environments. Int J Robot Res 31(10):1155\u20131175. https:\/\/doi.org\/10.1177\/0278364912453186","journal-title":"Int J Robot Res"},{"issue":"4","key":"8674_CR18","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.dt.2019.04.011","volume":"15","author":"BK Patle","year":"2019","unstructured":"Patle BK, Babu LG, Pandey A, Parhi DRK, Jagadeesh A (2019) A review: on path planning strategies for navigation of mobile robot. Def Technol 15(4):582\u2013606. https:\/\/doi.org\/10.1016\/j.dt.2019.04.011","journal-title":"Def Technol"},{"key":"8674_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.robot.2015.02.007","volume":"68","author":"AH Qureshi","year":"2015","unstructured":"Qureshi AH, Ayaz Y (2015) Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments. Robot Auton Syst 68:1\u201311. https:\/\/doi.org\/10.1016\/j.robot.2015.02.007","journal-title":"Robot Auton Syst"},{"key":"8674_CR20","doi-asserted-by":"publisher","unstructured":"Ratliff N, Zucker M, Bagnell JA, Srinivasa S (2009) Chomp: gradient optimization techniques for efficient motion planning. In: 2009 IEEE International conference on robotics and automation, pp 489\u2013494. https:\/\/doi.org\/10.1109\/ROBOT.2009.5152817","DOI":"10.1109\/ROBOT.2009.5152817"},{"key":"8674_CR21","doi-asserted-by":"publisher","unstructured":"Shi K, Denny J, Amato NM (2014) Spark PRM: using RRTs within PRMS to efficiently explore narrow passages. In: 2014 IEEE international conference on robotics and automation (ICRA), pp 4659\u20134666. https:\/\/doi.org\/10.1109\/ICRA.2014.6907540","DOI":"10.1109\/ICRA.2014.6907540"},{"issue":"4","key":"8674_CR22","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.measurement.2010.12.002","volume":"44","author":"NN Singh","year":"2011","unstructured":"Singh NN, Chatterjee A, Chatterjee A, Rakshit A (2011) A two-layered subgoal based mobile robot navigation algorithm with vision system and IR sensors. Measurement 44(4):620\u2013641. https:\/\/doi.org\/10.1016\/j.measurement.2010.12.002","journal-title":"Measurement"},{"key":"8674_CR23","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1016\/j.procs.2018.07.076","volume":"133","author":"P Sudhakara","year":"2018","unstructured":"Sudhakara P, Ganapathy V, Priyadharshini B, Sundaran K (2018) Obstacle avoidance and navigation planning of a wheeled mobile robot using amended artificial potential field method. Procedia Comput Sci 133:998\u20131004. https:\/\/doi.org\/10.1016\/j.procs.2018.07.076","journal-title":"Procedia Comput Sci"},{"key":"8674_CR24","doi-asserted-by":"publisher","first-page":"28133","DOI":"10.1109\/ACCESS.2020.2966580","volume":"8","author":"Z Sun","year":"2020","unstructured":"Sun Z, Lin D, Wei W, Wo\u017aniak M, Dama\u015fevi\u00e7ius R (2020) Road detection based on shearlet for gf-3 synthetic aperture radar images. IEEE Access 8:28133\u201328141. https:\/\/doi.org\/10.1109\/ACCESS.2020.2966580","journal-title":"IEEE Access"},{"key":"8674_CR25","doi-asserted-by":"publisher","unstructured":"Tahir Z, Qureshi AH, Ayaz Y, Nawaz R (2018) Potentially guided bidirectionalized RRT* for fast optimal path planning in cluttered environments. Robot Auton Syst 108:13\u201327. https:\/\/doi.org\/10.1016\/j.robot.2018.06.013","DOI":"10.1016\/j.robot.2018.06.013"},{"issue":"7","key":"8674_CR26","doi-asserted-by":"publisher","first-page":"2603","DOI":"10.1007\/s10489-018-1390-0","volume":"49","author":"H Tang","year":"2019","unstructured":"Tang H, Sun W, Yu H, Lin A, Xue M, Song Y (2019) A novel hybrid algorithm based on PSO and FOA for target searching in unknown environments. Appl Intell 49(7):2603\u20132622. https:\/\/doi.org\/10.1007\/s10489-018-1390-0","journal-title":"Appl Intell"},{"issue":"4","key":"8674_CR27","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1109\/Tase.2020.2976560","volume":"17","author":"JK Wang","year":"2020","unstructured":"Wang JK, Chi WZ, Li CM, Wang CQ, Meng MQH (2020) Neural RRT*: learning-based optimal path planning. IEEE Trans Autom Sci Eng 17(4):1748\u20131758. https:\/\/doi.org\/10.1109\/Tase.2020.2976560","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"8674_CR28","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899x\/711\/1\/012036","volume":"711","author":"G Wu","year":"2020","unstructured":"Wu G, Sun X (2020) Research on path planning of locally added path factor dijkstra algorithm for multiple AGV systems. IOP Conf Ser Mater Sci Eng 711:012036. https:\/\/doi.org\/10.1088\/1757-899x\/711\/1\/012036","journal-title":"IOP Conf Ser Mater Sci Eng"},{"key":"8674_CR29","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.neucom.2019.05.001","volume":"357","author":"KY Wu","year":"2019","unstructured":"Wu KY, Esfahani MA, Yuan SH, Wang H (2019) Tdpp-net: achieving three-dimensional path planning via a deep neural network architecture. Neurocomputing 357:151\u2013162. https:\/\/doi.org\/10.1016\/j.neucom.2019.05.001","journal-title":"Neurocomputing"},{"issue":"3","key":"8674_CR30","doi-asserted-by":"publisher","first-page":"2369","DOI":"10.1007\/s00500-019-04067-3","volume":"24","author":"Q Wu","year":"2020","unstructured":"Wu Q, Lin H, Jin YZ, Chen ZY, Li S, Chen DC (2020) A new fallback beetle antennae search algorithm for path planning of mobile robots with collision-free capability. Soft Comput 24(3):2369\u20132380. https:\/\/doi.org\/10.1007\/s00500-019-04067-3","journal-title":"Soft Comput"},{"key":"8674_CR31","doi-asserted-by":"publisher","first-page":"53960","DOI":"10.1109\/Access.2018.2868339","volume":"6","author":"LL Yu","year":"2018","unstructured":"Yu LL, Kong DC, Shao XY, Yan XX (2018) A path planning and navigation control system design for driverless electric bus. IEEE Access 6:53960\u201353975. https:\/\/doi.org\/10.1109\/Access.2018.2868339","journal-title":"IEEE Access"},{"key":"8674_CR32","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.procs.2018.07.018","volume":"133","author":"MN Zafar","year":"2018","unstructured":"Zafar MN, Mohanta JC (2018) Methodology for path planning and optimization of mobile robots: a review. Procedia Comput Sci 133:141\u2013152. https:\/\/doi.org\/10.1016\/j.procs.2018.07.018","journal-title":"Procedia Comput Sci"},{"issue":"2","key":"8674_CR33","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/s00500-016-2045-x","volume":"21","author":"YM Zhou","year":"2017","unstructured":"Zhou YM, Wang YC, Chen XZ, Zhang L, Wu K (2017) A novel path planning algorithm based on plant growth mechanism. Soft Comput 21(2):435\u2013445. https:\/\/doi.org\/10.1007\/s00500-016-2045-x","journal-title":"Soft Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08674-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-023-08674-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-023-08674-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T08:13:37Z","timestamp":1693556017000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-023-08674-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,27]]},"references-count":33,"journal-issue":{"issue":"20","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["8674"],"URL":"https:\/\/doi.org\/10.1007\/s00500-023-08674-z","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-315604\/v1","asserted-by":"object"}]},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,27]]},"assertion":[{"value":"25 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that there is no conflict of interest in preparing this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}