{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T00:03:41Z","timestamp":1780445021524,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s11370-025-00654-6","type":"journal-article","created":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T15:44:25Z","timestamp":1760543065000},"page":"1467-1484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast marching firework method for multi-goal mobile robot path planning in complex obstacle maps"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5141-0191","authenticated-orcid":false,"given":"Tran Thi Cam","family":"Giang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1976-6113","authenticated-orcid":false,"given":"Huynh Thi Thanh","family":"Binh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6690-5222","authenticated-orcid":false,"given":"Ho Viet Duc","family":"Luong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8569-0511","authenticated-orcid":false,"given":"Nguyen Huy","family":"Hoang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2588-6683","authenticated-orcid":false,"given":"Do Quoc","family":"Huy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"654_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120254","volume":"227","author":"L Liu","year":"2023","unstructured":"Liu L, Wang X, Yang X, Liu H, Li J, Wang P (2023) Path planning techniques for mobile robots: review and prospect. Expert Syst Appl 227:120254","journal-title":"Expert Syst Appl"},{"issue":"4","key":"654_CR2","doi-asserted-by":"publisher","first-page":"6932","DOI":"10.1109\/LRA.2020.3026638","volume":"5","author":"B Wang","year":"2020","unstructured":"Wang B, Liu Z, Li Q, Prorok A (2020) Mobile robot path planning in dynamic environments through globally guided reinforcement learning. IEEE Robot Autom Lett 5(4):6932\u20136939","journal-title":"IEEE Robot Autom Lett"},{"issue":"4","key":"654_CR3","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.dt.2019.04.011","volume":"15","author":"B Patle","year":"2019","unstructured":"Patle B, Pandey A, Parhi D, Jagadeesh A (2019) A review: on path planning strategies for navigation of mobile robot. Defence Technol 15(4):582\u2013606","journal-title":"Defence Technol"},{"key":"654_CR4","doi-asserted-by":"crossref","unstructured":"Faigl J (2016) An application of self-organizing map for multirobot multigoal path planning with minmax objective. Comput Intell Neurosci 2016","DOI":"10.1155\/2016\/2720630"},{"issue":"5","key":"654_CR5","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s10514-022-10039-8","volume":"46","author":"X Xiao","year":"2022","unstructured":"Xiao X, Liu B, Warnell G, Stone P (2022) Motion planning and control for mobile robot navigation using machine learning: a survey. Auton Robot 46(5):569\u2013597","journal-title":"Auton Robot"},{"key":"654_CR6","doi-asserted-by":"crossref","unstructured":"Von\u00e1sek V, P\u011bni\u010dka R (2019) Space-filling forest for multi-goal path planning. In: 2019 24th IEEE international conference on emerging technologies and factory automation (ETFA), pp 1587\u20131590 . IEEE","DOI":"10.1109\/ETFA.2019.8869521"},{"key":"654_CR7","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.ins.2018.08.062","volume":"471","author":"A Noormohammadi-Asl","year":"2019","unstructured":"Noormohammadi-Asl A, Taghirad HD (2019) Multi-goal motion planning using traveling salesman problem in belief space. Inf Sci 471:164\u2013184","journal-title":"Inf Sci"},{"issue":"2","key":"654_CR8","doi-asserted-by":"publisher","first-page":"4201","DOI":"10.1109\/LRA.2021.3068679","volume":"6","author":"J Jano\u0161","year":"2021","unstructured":"Jano\u0161 J, Von\u00e1sek V, P\u011bni\u010dka R (2021) Multi-goal path planning using multiple random trees. IEEE Robot Autom Lett 6(2):4201\u20134208","journal-title":"IEEE Robot Autom Lett"},{"key":"654_CR9","unstructured":"Pu X, Li J, Zhang Y (2017) An improved pso algorithm for robot multi-goal path planning. Int J Sci 4(3)"},{"issue":"6","key":"654_CR10","doi-asserted-by":"publisher","first-page":"1057","DOI":"10.3390\/app9061057","volume":"9","author":"C Liu","year":"2019","unstructured":"Liu C, Mao Q, Chu X, Xie S (2019) An improved a-star algorithm considering water current, traffic separation and berthing for vessel path planning. Appl Sci 9(6):1057","journal-title":"Appl Sci"},{"key":"654_CR11","doi-asserted-by":"crossref","unstructured":"Jain S, Kumar S, Sharma VK, Sharma H (2017) Improved differential evolution algorithm. In: 2017 International conference on Infocom technologies and unmanned systems (trends and future directions) (ICTUS), pp 627\u2013632. IEEE","DOI":"10.1109\/ICTUS.2017.8286085"},{"issue":"9","key":"654_CR12","doi-asserted-by":"publisher","first-page":"8223","DOI":"10.1007\/s13369-021-05443-8","volume":"46","author":"Z Zhang","year":"2021","unstructured":"Zhang Z, Qiao B, Zhao W, Chen X (2021) A predictive path planning algorithm for mobile robot in dynamic environments based on rapidly exploring random tree. Arab J Sci Eng 46(9):8223\u20138232","journal-title":"Arab J Sci Eng"},{"issue":"2","key":"654_CR13","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1017\/S0373463321000825","volume":"75","author":"A Basiri","year":"2022","unstructured":"Basiri A, Mariani V, Silano G, Aatif M, Iannelli L, Glielmo L (2022) A survey on the application of path-planning algorithms for multi-rotor uavs in precision agriculture. J Navig 75(2):364\u2013383","journal-title":"J Navig"},{"key":"654_CR14","doi-asserted-by":"crossref","unstructured":"Huang J (2022) Ant colony optimization and travelling salesman problem. In: International conference on statistics, applied mathematics, and computing science (CSAMCS 2021), 12163: 1191\u20131195 . SPIE","DOI":"10.1117\/12.2628031"},{"key":"654_CR15","doi-asserted-by":"crossref","unstructured":"Iskandar AF, Sani AF, Riyadi R, Febriani S, Syambas NR (2021) Fast heuristic algorithm optimization for travelling salesman problem. In: 2021 7th International conference on wireless and telematics (ICWT), pp 1\u20136. IEEE","DOI":"10.1109\/ICWT52862.2021.9678454"},{"key":"654_CR16","doi-asserted-by":"crossref","unstructured":"Valdez F, Moreno F, Melin P (2020) In: Castillo O, Melin P (eds) A comparison of ACO, GA and SA for solving the TSP problem, pp 181\u2013189. Springer, Cham","DOI":"10.1007\/978-3-030-34135-0_13"},{"issue":"1","key":"654_CR17","first-page":"189","volume":"16","author":"RK Mandava","year":"2019","unstructured":"Mandava RK, Mrudul K, Vundavilli PR (2019) Dynamic motion planning algorithm for a biped robot using fast marching method hybridized with regression search. Acta Polytech Hungarica 16(1):189\u2013208","journal-title":"Acta Polytech Hungarica"},{"key":"654_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2024.103985","volume":"231","author":"NTM Binh","year":"2024","unstructured":"Binh NTM, Binh HTT, Luong HVD, Long NT, Van Chien T (2024) An efficient exact method with polynomial time-complexity to achieve k-strong barrier coverage in heterogeneous wireless multimedia sensor networks. J Netw Comput Appl 231:103985","journal-title":"J Netw Comput Appl"},{"issue":"2","key":"654_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10514-020-09956-3","volume":"45","author":"MM Zafar","year":"2021","unstructured":"Zafar MM, Anjum ML, Hussain W (2021) Lta*: local tangent based a* for optimal path planning. Auton Robot 45(2):209\u2013227","journal-title":"Auton Robot"},{"issue":"17","key":"654_CR20","doi-asserted-by":"publisher","first-page":"7863","DOI":"10.3390\/app11177863","volume":"11","author":"X Zhu","year":"2021","unstructured":"Zhu X, Yan B, Yue Y (2021) Path planning and collision avoidance in unknown environments for usvs based on an improved d* lite. Appl Sci 11(17):7863","journal-title":"Appl Sci"},{"key":"654_CR21","doi-asserted-by":"publisher","first-page":"135513","DOI":"10.1109\/ACCESS.2020.3011211","volume":"8","author":"Q Yao","year":"2020","unstructured":"Yao Q, Zheng Z, Qi L, Yuan H, Guo X, Zhao M, Liu Z, Yang T (2020) Path planning method with improved artificial potential field: a reinforcement learning perspective. IEEE Access 8:135513\u2013135523","journal-title":"IEEE Access"},{"key":"654_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.arcontrol.2020.10.001","volume":"50","author":"MN Ab Wahab","year":"2020","unstructured":"Ab Wahab MN, Nefti-Meziani S, Atyabi A (2020) A comparative review on mobile robot path planning: classical or meta-heuristic methods? Annu Rev Control 50:233\u2013252","journal-title":"Annu Rev Control"},{"key":"654_CR23","doi-asserted-by":"crossref","unstructured":"Binh NTM, Thien NV, Luong HVD, Ngoc DT (2023) An efficient approach to the k-strong barrier coverage problem under the probabilistic sensing model in wireless multimedia sensor networks. In: International conference on ad hoc networks, pp 167\u2013180. Springer","DOI":"10.1007\/978-3-031-55993-8_13"},{"key":"654_CR24","doi-asserted-by":"crossref","unstructured":"Van\u00a0Chien T, Thu NTA, Nguyen L, Binh N, Binh H (2024) On the performance of user association in space-ground communications with integer-coded genetic algorithms. In: Proceedings of the genetic and evolutionary computation conference, pp 1373\u20131380","DOI":"10.1145\/3638529.3654083"},{"issue":"1","key":"654_CR25","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s40436-021-00366-x","volume":"10","author":"Z Zhang","year":"2022","unstructured":"Zhang Z, He R, Yang K (2022) A bioinspired path planning approach for mobile robots based on improved sparrow search algorithm. Adv Manuf 10(1):114\u2013130","journal-title":"Adv Manuf"},{"issue":"8","key":"654_CR26","doi-asserted-by":"publisher","first-page":"0256050","DOI":"10.1371\/journal.pone.0256050","volume":"16","author":"MZ Islam","year":"2021","unstructured":"Islam MZ, Othman ML, Abdul Wahab NI, Veerasamy V, Opu SR, Inbamani A, Annamalai V (2021) Marine predators algorithm for solving single-objective optimal power flow. PLoS ONE 16(8):0256050","journal-title":"PLoS ONE"},{"key":"654_CR27","doi-asserted-by":"crossref","unstructured":"Sharma K, Singh S, Doriya R (2021) Optimized cuckoo search algorithm using tournament selection function for robot path planning. Int J Adv Robot Syst 18(3)","DOI":"10.1177\/1729881421996136"},{"key":"654_CR28","doi-asserted-by":"crossref","unstructured":"Chien TV, Duc BT, Luong HVD, Binh HTT, Ngo HQ, Chatzinotas S (2024) Solving indefinite communication reliability optimization for ris-aided mobile systems by an improved differential evolution. In: Proceedings of the genetic and evolutionary computation conference companion, pp 651\u2013654","DOI":"10.1145\/3638530.3654300"},{"issue":"12","key":"654_CR29","doi-asserted-by":"publisher","first-page":"18838","DOI":"10.1109\/TWC.2024.3477557","volume":"23","author":"TV Chien","year":"2024","unstructured":"Chien TV, Duc BT, Luong HVD, Binh HTT, Ngo HQ, Chatzinotas S (2024) Active and passive beamforming designs for ser minimization in ris-assisted mimo systems. IEEE Trans Wirel Commun 23(12):18838\u201318854","journal-title":"IEEE Trans Wirel Commun"},{"key":"654_CR30","doi-asserted-by":"crossref","unstructured":"Wong C, Yang E, Yan X-T, Gu D (2018) Optimal path planning based on a multi-tree T-RRT* approach for robotic task planning in continuous cost spaces. In: 2018 12th France-Japan and 10th Europe-Asia Congress on Mechatronics, pp 242\u2013247 . IEEE","DOI":"10.1109\/MECATRONICS.2018.8495886"},{"key":"654_CR31","doi-asserted-by":"crossref","unstructured":"Xu J, Tian Z, He W, Huang Y (2020) A fast path planning algorithm fusing PRM and P-Bi-RRT. In: 2020 11th International conference on prognostics and system health management (PHM-2020 Jinan), pp 503\u2013508. IEEE","DOI":"10.1109\/PHM-Jinan48558.2020.00098"},{"issue":"3","key":"654_CR32","doi-asserted-by":"publisher","first-page":"5939","DOI":"10.32604\/cmc.2022.028165","volume":"72","author":"S Alshammrei","year":"2022","unstructured":"Alshammrei S, Boubaker S, Kolsi L (2022) Improved dijkstra algorithm for mobile robot path planning and obstacle avoidance. Comput Mater Continua 72(3):5939\u20135954","journal-title":"Comput Mater Continua"},{"key":"654_CR33","doi-asserted-by":"crossref","unstructured":"Makariye N (2017) Towards shortest path computation using dijkstra algorithm. In: 2017 International conference on IoT and application (ICIOT), 1\u20133. IEEE","DOI":"10.1109\/ICIOTA.2017.8073641"},{"issue":"4","key":"654_CR34","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1109\/MRA.2013.2248309","volume":"20","author":"A Valero-Gomez","year":"2013","unstructured":"Valero-Gomez A, Gomez JV, Garrido S, Moreno L (2013) The path to efficiency: fast marching method for safer, more efficient mobile robot trajectories. IEEE Robot Autom Mag 20(4):111\u2013120","journal-title":"IEEE Robot Autom Mag"},{"key":"654_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.petrol.2021.108620","volume":"204","author":"R Yousefzadeh","year":"2021","unstructured":"Yousefzadeh R, Sharifi M, Rafiei Y (2021) An efficient method for injection well location optimization using fast marching method. J Petrol Sci Eng 204:108620","journal-title":"J Petrol Sci Eng"},{"key":"654_CR36","doi-asserted-by":"crossref","unstructured":"Mirino AE (2017) Best routes selection using dijkstra and floyd-warshall algorithm. In: 2017 11th International conference on information and communication technology and system (ICTS), pp 155\u2013158. IEEE","DOI":"10.1109\/ICTS.2017.8265662"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00654-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-025-00654-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00654-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T03:48:44Z","timestamp":1763437724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-025-00654-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":36,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["654"],"URL":"https:\/\/doi.org\/10.1007\/s11370-025-00654-6","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,15]]},"assertion":[{"value":"13 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","order":3,"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 they have no competing interests that could influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}