{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,3]],"date-time":"2025-01-03T05:13:53Z","timestamp":1735881233401,"version":"3.32.0"},"reference-count":27,"publisher":"Informa UK Limited","issue":"23","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["Advanced Robotics"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1080\/01691864.2024.2407130","type":"journal-article","created":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T18:52:34Z","timestamp":1727376754000},"page":"1668-1678","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":0,"title":["S&Reg v2: a probabilistically complete sampling-based planner to solve multi-goal path finding problem via multi-task learning networks"],"prefix":"10.1080","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4268-6579","authenticated-orcid":false,"given":"Yuan","family":"Huang","sequence":"first","affiliation":[{"name":"College of Information and Technology, Wenzhou Business College, Wenzhou, People's Republic of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yilin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Graduate School of Information, Production and Systems, Waseda University, Kitakyushu, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","published-online":{"date-parts":[[2024,9,26]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981785"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2678482"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.11.005"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2016"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2013.05.002"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.5220\/0005118405990604"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942975"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1080\/01691864.2022.2141078"},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6256440"},{"key":"e_1_3_2_12_1","unstructured":"Applegate D Bixby R Chv\u00e1tal V et\u00a0al. Concorde TSP solver 2006. Available from: http:\/\/www.math.uwaterloo.ca\/tsp\/concorde.html."},{"key":"e_1_3_2_13_1","unstructured":"Dimitrovski F. Elkai (2019). Available from: https:\/\/github.com\/fikisipi\/elkai."},{"issue":"2","key":"e_1_3_2_14_1","first-page":"123","article-title":"Enhanced traveling salesman problem solving by genetic algorithm technique (tspga)","volume":"2","author":"Al-Dulaimi BF","year":"2008","unstructured":"Al-Dulaimi BF, Ali HA. Enhanced traveling salesman problem solving by genetic algorithm technique (tspga). Int J Math Comput Sci. 2008;2(2):123\u2013129.","journal-title":"Int J Math Comput Sci"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3068679"},{"key":"e_1_3_2_16_1","unstructured":"LaValle SM. Rapidly-exploring random trees : a new tool for path planning; 1998. (The annual research report). Available from: https:\/\/api.semanticscholar.org\/CorpusID:14744621."},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2019.8869521"},{"key":"e_1_3_2_18_1","first-page":"258","volume-title":"Proceedings of the International Symposium on Combinatorial Search, Vienna, Austria","volume":"15","author":"Chandak N","year":"2022","unstructured":"Chandak N, Chour K, Rathinam S, et al. Informed steiner trees: sampling and pruning formulti-goal path finding in high dimensions. In: Proceedings of the International Symposium on Combinatorial Search, Vienna, Austria; Vol. 15; 2022. p. 258\u2013260."},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2021.1004275"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.8856"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3350979"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/RO-MAN57019.2023.10309316"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0895-4356(96)00002-9"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"e_1_3_2_25_1","unstructured":"Kingma DP Ba J. Adam: a method for stochastic optimization. CoRR. 2014;abs\/1412.6980. Available from: https:\/\/api.semanticscholar.org\/CorpusID:6628106."},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"e_1_3_2_27_1","unstructured":"Loshchilov I Hutter F. Sgdr: stochastic gradient descent with warm restarts. arXiv preprint arXiv:1608.03983 2016."},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3422622"}],"container-title":["Advanced Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/01691864.2024.2407130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T09:56:13Z","timestamp":1735811773000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/01691864.2024.2407130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,26]]},"references-count":27,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.1080\/01691864.2024.2407130"],"URL":"https:\/\/doi.org\/10.1080\/01691864.2024.2407130","relation":{},"ISSN":["0169-1864","1568-5535"],"issn-type":[{"type":"print","value":"0169-1864"},{"type":"electronic","value":"1568-5535"}],"subject":[],"published":{"date-parts":[[2024,9,26]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tadr20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tadr20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2024-03-15","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-06-04","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-28","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}