{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T22:26:14Z","timestamp":1776378374096,"version":"3.51.2"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T00:00:00Z","timestamp":1724025600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T00:00:00Z","timestamp":1724025600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s40747-024-01576-z","type":"journal-article","created":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T09:02:59Z","timestamp":1724058179000},"page":"8273-8286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["GVP-RRT: a grid based variable probability Rapidly-exploring Random Tree algorithm for AGV path planning"],"prefix":"10.1007","volume":"10","author":[{"given":"Yaozhe","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Yujun","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Liye","family":"Lv","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,19]]},"reference":[{"issue":"13","key":"1576_CR1","doi-asserted-by":"publisher","first-page":"6140","DOI":"10.3390\/s23136140","volume":"23","author":"X Song","year":"2023","unstructured":"Song X, Gao H, Ding T et al (2023) A Review of the motion planning and control methods for automated vehicles[J]. Sensors 23(13):6140","journal-title":"Sensors"},{"key":"1576_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2021.104211","volume":"101","author":"O Sharma","year":"2021","unstructured":"Sharma O, Sahoo NC, Puhan NB (2021) Recent advances in motion and behavior planning techniques for software architecture of autonomous vehicles: a state-of-the-art survey[J]. Eng Appl Artif Intell 101:104211","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"1576_CR3","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"PE Hart","year":"1968","unstructured":"Hart PE, Nilsson NJ, Raphael B (1968) A formal basis for the heuristic determination of minimum cost paths[J]. IEEE Trans Syst Sci Cybern 4(2):100\u2013107","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"1576_CR4","doi-asserted-by":"crossref","unstructured":"Stentz A (1994) Optimal and efficient path planning for partially-known environments[C]. In: Proceedings of the 1994 IEEE International Conference on Robotics and Automation, vol. 4, pp 3310\u20133317","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"1576_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2022.104291","volume":"159","author":"Y Gao","year":"2023","unstructured":"Gao Y, Bai CG, Fu R et al (2023) A non-potential orthogonal vector field method for more efficient robot navigation and control[J]. Robot Autonomous Syst 159:104291","journal-title":"Robot Autonomous Syst"},{"issue":"3","key":"1576_CR6","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1080\/15397734.2021.1876569","volume":"51","author":"PG Luan","year":"2023","unstructured":"Luan PG, Thinh NT (2023) Hybrid genetic algorithm based smooth global-path planning for a mobile robot[J]. Mech Based Design Struct Mach 51(3):1758\u20131774","journal-title":"Mech Based Design Struct Mach"},{"key":"1576_CR7","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1016\/j.asoc.2018.09.011","volume":"73","author":"XD Wu","year":"2018","unstructured":"Wu XD, Bai WB, Xie YE et al (2018) A hybrid algorithm of particle swarm optimization, metropolis criterion and RTS smoother for path planning of UAVs[J]. Appl Soft Comput 73:735\u2013747","journal-title":"Appl Soft Comput"},{"issue":"4","key":"1576_CR8","doi-asserted-by":"publisher","first-page":"815","DOI":"10.3390\/s19040815","volume":"19","author":"LF Wang","year":"2019","unstructured":"Wang LF, Kan JM, Guo J et al (2019) 3D path planning for the ground robot with improved ant colony optimization[J]. Sensors 19(4):815","journal-title":"Sensors"},{"key":"1576_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119327","volume":"215","author":"XB Yu","year":"2023","unstructured":"Yu XB, Jiang NJ, Wang XM et al (2023) A hybrid algorithm based on grey wolf optimizer and differential evolution for UAV path planning[J]. Expert Syst Appl 215:119325","journal-title":"Expert Syst Appl"},{"key":"1576_CR10","doi-asserted-by":"publisher","first-page":"7911","DOI":"10.1109\/TNNLS.2022.3222206","volume":"35","author":"QL Wei","year":"2022","unstructured":"Wei QL, Yan YT, Zhang J et al (2022) A self-attention-based deep reinforcement learning approach for AGV dispatching systems[J]. IEEE Trans Neural Netw Learn Syst 35:7911-7912. https:\/\/doi.org\/10.1109\/TNNLS.2022.3222206","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"1576_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-023-02208-y","author":"LX Zhang","year":"2023","unstructured":"Zhang LX, Yan Y, Hu YG (2023) Deep reinforcement learning for dynamic scheduling of energy-efficient automated guided vehicles[J]. J Intell Manuf. https:\/\/doi.org\/10.1007\/s10845-023-02208-y","journal-title":"J Intell Manuf"},{"key":"1576_CR12","unstructured":"Lavalle S. Rapidly-exploring random trees: a new tool for path planning[J]. Res Report 9811, 1998."},{"issue":"4","key":"1576_CR13","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1109\/70.508439","volume":"12","author":"LE Kavraki","year":"1996","unstructured":"Kavraki LE, Svestka P, Latombe JC et al (1996) Probabilistic roadmaps for path planning in high-dimensional configuration spaces[J]. IEEE Trans Robot Autom 12(4):566\u2013580","journal-title":"IEEE Trans Robot Autom"},{"issue":"4","key":"1576_CR14","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 et al (2019) A review: on path planning strategies for navigation of mobile robot[J]. Defence Technol 15(4):582\u2013606","journal-title":"Defence Technol"},{"issue":"7","key":"1576_CR15","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[J]. Int J Robot Res 30(7):846\u2013894","journal-title":"Int J Robot Res"},{"issue":"6","key":"1576_CR16","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[J]. Auton Robot 40(6):1079\u20131093","journal-title":"Auton Robot"},{"key":"1576_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113425","volume":"152","author":"Y Li","year":"2020","unstructured":"Li Y, Wei W, Gao Y et al (2020) PQ-RRT*: an improved path planning algorithm for mobile robots[J]. Expert Syst Appl 152:113425","journal-title":"Expert Syst Appl"},{"key":"1576_CR18","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.eswa.2019.01.032","volume":"123","author":"I-B Jeong","year":"2019","unstructured":"Jeong I-B, Lee S-J, Kim J-H (2019) Quick-RRT*: triangular inequality-based implementation of RRT* with improved initial solution and convergence rate[J]. Expert Syst Appl 123:82\u201390","journal-title":"Expert Syst Appl"},{"key":"1576_CR19","doi-asserted-by":"publisher","first-page":"127168","DOI":"10.1109\/ACCESS.2022.3226465","volume":"10","author":"B Wang","year":"2022","unstructured":"Wang B, Ju D, Xu F et al (2022) CAF-RRT*: a 2D path planning algorithm based on circular arc fillet method[J]. IEEE Access 10:127168\u2013127181","journal-title":"IEEE Access"},{"issue":"1\u20132","key":"1576_CR20","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]. J Intell Robot Syst 90(1\u20132):81\u2013100","journal-title":"J Intell Robot Syst"},{"key":"1576_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115457","volume":"184","author":"B Liao","year":"2021","unstructured":"Liao B, Wan F, Hua Y et al (2021) F-RRT*: an improved path planning algorithm with improved initial solution and convergence rate[J]. Expert Syst Appl 184:115457","journal-title":"Expert Syst Appl"},{"key":"1576_CR22","doi-asserted-by":"crossref","unstructured":"Fang J, Yin K, Wang H et al (2021) Motion path planning of sorting robot based on extended RRT-connect Algorithm[C]. In: 2021 4th International Conference on Mechatronics, Robotics and Automation (ICMRA), pp 6\u201313","DOI":"10.1109\/ICMRA53481.2021.9675571"},{"issue":"6","key":"1576_CR23","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1109\/TRO.2005.853485","volume":"21","author":"S Zheng","year":"2005","unstructured":"Zheng S, Hsu D, Tingting J et al (2005) Narrow passage sampling for probabilistic roadmap planning[J]. IEEE Trans Robot 21(6):1105\u20131115","journal-title":"IEEE Trans Robot"},{"key":"1576_CR24","doi-asserted-by":"crossref","unstructured":"Hsu D, Tingting J, Reif J et al (2003) The bridge test for sampling narrow passages with probabilistic roadmap planners[C]. In: 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422), vol. 3, pp 4420\u20134426","DOI":"10.1109\/ROBOT.2003.1242285"}],"container-title":["Complex & Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01576-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-024-01576-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-024-01576-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T22:20:18Z","timestamp":1729117218000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-024-01576-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,19]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1576"],"URL":"https:\/\/doi.org\/10.1007\/s40747-024-01576-z","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,19]]},"assertion":[{"value":"26 February 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2024","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"}}]}}