{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:16:18Z","timestamp":1775229378565,"version":"3.50.1"},"reference-count":62,"publisher":"Wiley","issue":"9","license":[{"start":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:00:00Z","timestamp":1723334400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["advanced.onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Advanced Intelligent Systems"],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:p>We offer a new in\u2010depth investigation of global path planning (GPP) for unmanned ground vehicles, an autonomous mining sampling robot named ROMIE. GPP is essential for ROMIE's optimal performance, which is translated into solving the traveling salesman problem, a complex graph theory challenge that is crucial for determining the most effective route to cover all sampling locations in a mining field. This problem is central to enhancing ROMIE's operational efficiency and competitiveness against human labor by optimizing cost and time. The primary aim of this research is to advance GPP by developing, evaluating, and improving a cost\u2010efficient software and web application. We delve into an extensive comparison and analysis of Google operations research (OR)\u2010Tools optimization algorithms. Our study is driven by the goal of applying and testing the limits of OR\u2010Tools capabilities by integrating Reinforcement Learning techniques for the first time. This enables us to compare these methods with OR\u2010Tools, assessing their computational effectiveness and real\u2010world application efficiency. Our analysis seeks to provide insights into the effectiveness and practical application of each technique. Our findings indicate that Q\u2010Learning stands out as the optimal strategy, demonstrating superior efficiency by deviating only 1.2% on average from the optimal solutions across our datasets.<\/jats:p>","DOI":"10.1002\/aisy.202300840","type":"journal-article","created":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T22:40:00Z","timestamp":1723416000000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Navigating Intelligence: A Survey of Google OR\u2010Tools and Machine Learning for Global Path Planning in Autonomous Vehicles"],"prefix":"10.1002","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-2886-3513","authenticated-orcid":false,"given":"Alexandre","family":"Benoit","sequence":"first","affiliation":[{"name":"Electronic and Electrical Engineering University of Bath  Bath BA2 7AY UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3264-7303","authenticated-orcid":false,"given":"Pedram","family":"Asef","sequence":"additional","affiliation":[{"name":"Mechanical Engineering University College London  London E20 3BS UK"}]}],"member":"311","published-online":{"date-parts":[[2024,8,11]]},"reference":[{"key":"e_1_2_10_2_1","volume-title":"The Future of Geochemical Sampling Processes \u2010 A Endeavour Mining Interview","author":"Benoit A.","year":"2023"},{"key":"e_1_2_10_3_1","doi-asserted-by":"crossref","unstructured":"J.Chen F.Ye Y.Li in2017 Progress in Electromagnetics Research Symp. \u2010 Fall (PIERS \u2010 FALL) Singapore2017 pp.832\u2013837 https:\/\/doi.org\/10.1109\/PIERS\u2010FALL.2017.8293250.","DOI":"10.1109\/PIERS-FALL.2017.8293250"},{"key":"e_1_2_10_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"e_1_2_10_5_1","volume-title":"Algorithms and Combinatorics","author":"Schrijver A.","year":"2003"},{"key":"e_1_2_10_6_1","unstructured":"Informs What is O.R.? INFORMS https:\/\/www.informs.org\/Explore\/What\u2010is\u2010O.R.\u2010Analytics\/What\u2010is\u2010O.R(accessed: July 2023)."},{"key":"e_1_2_10_7_1","unstructured":"W. V.Fulber\u2010Garcia Baeldung on Computer Science2022 https:\/\/www.baeldung.com\/cs\/deterministic\u2010stochastic\u2010optimization(accessed: July 2023)."},{"key":"e_1_2_10_8_1","doi-asserted-by":"crossref","unstructured":"S. S.Juneja P.Saraswat K.Singh J.Sharma R.Majumdar S.Chowdhary in2019 Amity Int. Conf. Artificial Intelligence (AICAI) Dubai United Arab Emirates2019 pp.264\u2013268 https:\/\/doi.org\/10.1109\/AICAI.2019.8701246.","DOI":"10.1109\/AICAI.2019.8701246"},{"key":"e_1_2_10_9_1","doi-asserted-by":"crossref","unstructured":"Y.\u2010F.Lim P.\u2010Y.Hong R.Ramli R.Khalid in2011 IEEE Colloquium on Humanities Science and Engineering Penang Malaysia2011 pp.851\u2013854 https:\/\/doi.org\/10.1109\/CHUSER.2011.6163857.","DOI":"10.1109\/CHUSER.2011.6163857"},{"key":"e_1_2_10_10_1","doi-asserted-by":"crossref","unstructured":"K.\u2010P.Wang L.Huang C.\u2010G.Zhou W.Pang inProc. 2003 Int. Conf. Machine Learning and Cybernetics (IEEE Cat. No.03EX693) Vol.3 Xi'an2003 pp.1583\u20131585 https:\/\/doi.org\/10.1109\/ICMLC.2003.1259748.","DOI":"10.1109\/ICMLC.2003.1259748"},{"key":"e_1_2_10_11_1","doi-asserted-by":"crossref","unstructured":"G.Ye X.Rui in2013 5th IEEE Int. Conf. Broadband Network & Multimedia Technology Guilin China2013 pp.6\u20139 https:\/\/doi.org\/10.1109\/ICBNMT.2013.6823904.","DOI":"10.1109\/ICBNMT.2013.6823904"},{"key":"e_1_2_10_12_1","doi-asserted-by":"crossref","unstructured":"B.Li L.Wang W.Song in2008 Fourth Int. Conf. Natural Computation Jinan China2008 pp.496\u2013501 https:\/\/doi.org\/10.1109\/ICNC.2008.354.","DOI":"10.1109\/ICNC.2008.354"},{"key":"e_1_2_10_13_1","unstructured":"U.Mele L. M.Gambardella R.Montemanni ICIEA 2021-Europe: Proceedings of the 2021 8th International Conference on Industrial Engineering and Applications (Europe) Barcelona Spain2021 https:\/\/doi.org\/10.1145\/3463858.346386."},{"key":"e_1_2_10_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3038605"},{"key":"e_1_2_10_15_1","unstructured":"Concorde Solver Concorde Home2020 https:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html(accessed: July 2023)."},{"key":"e_1_2_10_16_1","unstructured":"Concorde Dataset Concorde Home2015 https:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html(accessed: April 2024)."},{"key":"e_1_2_10_17_1","volume-title":"Improving Christofides\u2019 Algorithm For The S-T Path TSP","author":"An H.\u2010C.","year":"2011"},{"key":"e_1_2_10_18_1","first-page":"1","volume":"62","author":"Karlin A. R.","year":"2022","journal-title":"JACM"},{"key":"e_1_2_10_19_1","doi-asserted-by":"publisher","DOI":"10.30538\/psrp-odam2019.0020"},{"key":"e_1_2_10_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.02.014"},{"key":"e_1_2_10_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-022-09327-y"},{"key":"e_1_2_10_22_1","unstructured":"X.Pan Y.Jin Y.Ding M.Feng L.Zhao L.Song J.Bian arXiv.org2023 https:\/\/arxiv.org\/abs\/2304.09395(accessed: November 2023)."},{"key":"e_1_2_10_23_1","doi-asserted-by":"crossref","unstructured":"R.Zhang A.Prokhorchuk J.Dauwels in2020 Int. Joint Conf. Neural Networks (IJCNN) Glasgow UK2020 pp.1\u20138 https:\/\/doi.org\/10.1109\/IJCNN48605.2020.9207026.","DOI":"10.1109\/IJCNN48605.2020.9207026"},{"key":"e_1_2_10_24_1","unstructured":"Y.Min Y.Bai C. P.Gomes arXiv.org2023 https:\/\/arxiv.org\/abs\/2303.10538(accessed: July 2023)."},{"key":"e_1_2_10_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2022.08.005"},{"key":"e_1_2_10_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3089179"},{"key":"e_1_2_10_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2024.127392"},{"key":"e_1_2_10_28_1","unstructured":"C. K.Joshi T.Laurent X.Bresson arXiv.org2019 https:\/\/arxiv.org\/abs\/1906.01227(accessed: July 2023)."},{"key":"e_1_2_10_29_1","unstructured":"W.Kool H.van Hoof M.Welling arXiv.org2019 https:\/\/arxiv.org\/abs\/1803.08475(accessed: July 2023)."},{"key":"e_1_2_10_30_1","doi-asserted-by":"crossref","unstructured":"X.Song M.Li W.Xie Y.Mao in2023 26th Int. Conf. Computer Supported Cooperative Work in Design (CSCWD) Rio de Janeiro Brazil2023 pp.1342\u20131347 https:\/\/doi.org\/10.1109\/CSCWD57460.2023.10152696.","DOI":"10.1109\/CSCWD57460.2023.10152696"},{"key":"e_1_2_10_31_1","doi-asserted-by":"crossref","unstructured":"J.Liang in2023 IEEE 2nd Int. Conf. Electrical Engineering Big Data and Algorithms (EEBDA) Changchun China2023 pp.79\u201383 https:\/\/doi.org\/10.1109\/EEBDA56825.2023.10090654.","DOI":"10.1109\/EEBDA56825.2023.10090654"},{"key":"e_1_2_10_32_1","doi-asserted-by":"crossref","first-page":"e12303","DOI":"10.1049\/tje2.12303","volume":"2023","author":"Wang J.","year":"2023","journal-title":"J. Eng."},{"key":"e_1_2_10_33_1","unstructured":"W.Kool H.Van Hoof M.Welling arXiv preprint arXiv:1803.084752018."},{"key":"e_1_2_10_34_1","unstructured":"C. K.Joshi T.Laurent X.Bresson arXiv preprint arXiv:1906.012272019."},{"key":"e_1_2_10_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/MITS.2019.2939109"},{"key":"e_1_2_10_36_1","unstructured":"Google OR\u2010Tools Google https:\/\/developers.google.com\/optimization\/introduction?hl=fr(accessed: July 2023)."},{"key":"e_1_2_10_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.23109"},{"key":"e_1_2_10_38_1","doi-asserted-by":"crossref","unstructured":"K.Taunk S.De S.Verma A.Swetapadma in2019 Int. Conf. Intelligent Computing and Control Systems (ICCS) Madurai India2019 pp.1255\u20131260 https:\/\/doi.org\/10.1109\/ICCS45141.2019.9065747.","DOI":"10.1109\/ICCS45141.2019.9065747"},{"key":"e_1_2_10_39_1","unstructured":"R.Mathew K.Zhao D.Cherukupalli K.Pusich Traveling Salesman Algorithms from Naive to Christofide no date https:\/\/cse442\u201017f.github.io\/Traveling\u2010Salesman\u2010Algorithms\/(accessed: July 2023)."},{"key":"e_1_2_10_40_1","volume-title":"4th Int. Conf. on Electrical Engineering and Information & Communication Technology (iCEEiCT)","author":"Khan A.","year":"2019"},{"key":"e_1_2_10_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0002-8"},{"key":"e_1_2_10_42_1","doi-asserted-by":"publisher","DOI":"10.14445\/22315373\/IJMTT-V43P503"},{"key":"e_1_2_10_43_1","unstructured":"Fleury's Algorithm for Printing Eulerian Path or Circuit GeeksforGeeks2023 https:\/\/www.geeksforgeeks.org\/fleurys\u2010algorithm\u2010for\u2010printing\u2010eulerian\u2010path\/(accessed: July 2023)."},{"key":"e_1_2_10_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2371918"},{"key":"e_1_2_10_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11831-017-9247-y"},{"key":"e_1_2_10_46_1","doi-asserted-by":"crossref","unstructured":"E. D.Ahmad A.Muklason I.Nurkasanah in2020 Int. Conf. Computer Engineering Network and Intelligent Multimedia (CENIM) Surabaya Indonesia2020 pp.217\u2013221 https:\/\/doi.org\/10.1109\/CENIM51130.2020.9297892.","DOI":"10.1109\/CENIM51130.2020.9297892"},{"key":"e_1_2_10_47_1","doi-asserted-by":"crossref","unstructured":"H.Chen G.Tan G.Qian R.Chen in2018 37th Chinese Control Conference (CCC) Wuhan China2018 pp.2523\u20132527 https:\/\/doi.org\/10.23919\/ChiCC.2018.8483278.","DOI":"10.23919\/ChiCC.2018.8483278"},{"key":"e_1_2_10_48_1","volume-title":"PhD Thesis","author":"Watkins C.","year":"1989"},{"key":"e_1_2_10_49_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.639"},{"key":"e_1_2_10_50_1","unstructured":"H.van Hasselt inProc. 23rd Int. Conf. Neural Information Processing Systems \u2010 Volume 2 (NIPS\u201910) Curran Associates Inc. Red Hook NY2010 pp.2613\u20132621."},{"key":"e_1_2_10_51_1","doi-asserted-by":"crossref","unstructured":"Y.Mohan S. G.Ponnambalam J. I.Inayat\u2010Hussain in2009 World Congress on Nature & Biologically Inspired Computing (NaBIC) Coimbatore India2009 pp.134\u2013139 https:\/\/doi.org\/10.1109\/NABIC.2009.5393616.","DOI":"10.1109\/NABIC.2009.5393616"},{"key":"e_1_2_10_52_1","volume-title":"KI 2010: Advances in Artificial Intelligence. KI 2010. Lecture Notes in Computer Science","author":"Tokic M.","year":"2010"},{"key":"e_1_2_10_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.09.006"},{"key":"e_1_2_10_54_1","volume-title":"Certification of an optimal TSP tour through 85,900 cities","author":"Min Y.","year":"2024"},{"key":"e_1_2_10_55_1","volume-title":"37th Conf. on Neural Information Processing Systems (NeurIPS 2023), the Ernest N","author":"Helsgaun K.","year":"2017"},{"key":"e_1_2_10_56_1","unstructured":"Arthod GitHubno date Roskilde University Roskilde Denmark https:\/\/github.com\/Arthod\/LP\u2010tsp\u2010gurobi(accessed: July 2024)."},{"key":"e_1_2_10_57_1","volume-title":"Logistical and Transportation Planning Methods: Civil and Environmental Engineering","author":"Larson R. C."},{"key":"e_1_2_10_58_1","volume-title":"Pointer Networks","author":"Vinyals O.","year":"2017"},{"key":"e_1_2_10_59_1","volume-title":"Advances in Neural Information Processing Systems 28 (NIPS 2015)","author":"Bello I.","year":"2017"},{"key":"e_1_2_10_60_1","volume-title":"5th Int. Conf. on Learning Representations","author":"Dai H.","year":"2018"},{"key":"e_1_2_10_61_1","volume-title":"NIPS'17: Proceedings of the 31st International Conference on Neural Information Processing Systems","author":"Deudon M.","year":"2018"},{"key":"e_1_2_10_62_1","volume-title":"Attention, Learn to Solve Routing Problems!","author":"Kool W.","year":"2019"},{"key":"e_1_2_10_63_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"}],"container-title":["Advanced Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/advanced.onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/aisy.202300840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:00:05Z","timestamp":1759881605000},"score":1,"resource":{"primary":{"URL":"https:\/\/advanced.onlinelibrary.wiley.com\/doi\/10.1002\/aisy.202300840"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,11]]},"references-count":62,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["10.1002\/aisy.202300840"],"URL":"https:\/\/doi.org\/10.1002\/aisy.202300840","archive":["Portico"],"relation":{},"ISSN":["2640-4567","2640-4567"],"issn-type":[{"value":"2640-4567","type":"print"},{"value":"2640-4567","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,11]]},"assertion":[{"value":"2023-12-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"2300840"}}