{"id":"https://openalex.org/W4402889765","doi":"https://doi.org/10.1080/01691864.2024.2407130","title":"S&Reg v2: a probabilistically complete sampling-based planner to solve multi-goal path finding problem via multi-task learning networks","display_name":"S&Reg v2: a probabilistically complete sampling-based planner to solve multi-goal path finding problem via multi-task learning networks","publication_year":2024,"publication_date":"2024-09-26","ids":{"openalex":"https://openalex.org/W4402889765","doi":"https://doi.org/10.1080/01691864.2024.2407130"},"language":"en","primary_location":{"id":"doi:10.1080/01691864.2024.2407130","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01691864.2024.2407130","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050467039","display_name":"Yuan Huang","orcid":"https://orcid.org/0000-0002-4268-6579"},"institutions":[{"id":"https://openalex.org/I146620803","display_name":"Wenzhou University","ror":"https://ror.org/020hxh324","country_code":"CN","type":"education","lineage":["https://openalex.org/I146620803"]},{"id":"https://openalex.org/I4405263208","display_name":"Wenzhou Business College","ror":"https://ror.org/03x873059","country_code":"CN","type":"education","lineage":["https://openalex.org/I4405263208"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuan Huang","raw_affiliation_strings":["College of Information and Technology, Wenzhou Business College, Wenzhou, People's Republic of China"],"raw_orcid":"https://orcid.org/0000-0002-4268-6579","affiliations":[{"raw_affiliation_string":"College of Information and Technology, Wenzhou Business College, Wenzhou, People's Republic of China","institution_ids":["https://openalex.org/I146620803","https://openalex.org/I4405263208"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086334363","display_name":"Yilin Zhang","orcid":"https://orcid.org/0000-0001-5955-3089"},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yilin Zhang","raw_affiliation_strings":["Graduate School of Information, Production and Systems, Waseda University, Kitakyushu, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information, Production and Systems, Waseda University, Kitakyushu, Japan","institution_ids":["https://openalex.org/I150744194"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5086334363"],"corresponding_institution_ids":["https://openalex.org/I150744194"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.11720363,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"23","first_page":"1668","last_page":"1678"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9860000014305115,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.982699990272522,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.7388134002685547},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.7363290786743164},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6852091550827026},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5716748237609863},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.492861270904541},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4885929226875305},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43415483832359314},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.432380735874176},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2890629470348358},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2812671661376953},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1751013994216919},{"id":"https://openalex.org/keywords/detector","display_name":"Detector","score":0.0937134325504303},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07813361287117004}],"concepts":[{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.7388134002685547},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.7363290786743164},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6852091550827026},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5716748237609863},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.492861270904541},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4885929226875305},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43415483832359314},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.432380735874176},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2890629470348358},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2812671661376953},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1751013994216919},{"id":"https://openalex.org/C94915269","wikidata":"https://www.wikidata.org/wiki/Q1834857","display_name":"Detector","level":2,"score":0.0937134325504303},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07813361287117004},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01691864.2024.2407130","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01691864.2024.2407130","pdf_url":null,"source":{"id":"https://openalex.org/S192584203","display_name":"Advanced Robotics","issn_l":"0169-1864","issn":["0169-1864","1568-5535"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Advanced Robotics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1971086298","https://openalex.org/W2014668976","https://openalex.org/W2017708378","https://openalex.org/W2030174522","https://openalex.org/W2031411351","https://openalex.org/W2049843736","https://openalex.org/W2121394390","https://openalex.org/W2165839102","https://openalex.org/W2600765363","https://openalex.org/W2901943120","https://openalex.org/W2981168246","https://openalex.org/W3037164939","https://openalex.org/W3096831136","https://openalex.org/W3146778708","https://openalex.org/W3208956781","https://openalex.org/W4206268163","https://openalex.org/W4252907012","https://openalex.org/W4308518069","https://openalex.org/W4312858026","https://openalex.org/W4388624125","https://openalex.org/W4390659231"],"related_works":["https://openalex.org/W99657755","https://openalex.org/W2998826171","https://openalex.org/W2036736859","https://openalex.org/W2155467318","https://openalex.org/W122632647","https://openalex.org/W2060743914","https://openalex.org/W2359600231","https://openalex.org/W187779371","https://openalex.org/W2380019117","https://openalex.org/W3138952546"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,19,26,70,93,108,125,162,173,183,190],"variant":[6],"of":[7,28,54,56,141,144,156,179],"our":[8],"previous":[9],"research":[10],"on":[11,17],"multi-goal":[12],"path":[13,23],"finding":[14,18],"problem,":[15],"focusing":[16],"feasible":[20],"and":[21,52,87,189],"closed":[22],"to":[24,49,73,96,130,170],"visit":[25],"sequence":[27],"goals":[29],"in":[30,164,186,193],"an":[31],"environment":[32],"with":[33,111],"obstacles.":[34],"The":[35],"newly":[36],"proposed":[37],"method,":[38,160],"Segmentation":[39],"&":[40],"Regression":[41],"v2":[42,147,159],"(S&Reg":[43],"v2),":[44],"employs":[45],"multi-task":[46],"learning":[47],"networks":[48],"generate":[50],"regions":[51],"estimates":[53,64],"lengths":[55],"local":[57],"paths":[58],"between":[59],"pairwise":[60],"goals.":[61],"Importantly,":[62],"the":[63,75,79,85,88,98,112,120,132,145,153,157,177],"are":[65],"performed":[66],"as":[67,92],"weights":[68],"for":[69],"complete":[71],"graph":[72],"compute":[74],"visiting":[76],"sequence.":[77],"Subsequently,":[78],"path-finding":[80],"process":[81],"is":[82,104,122,128,149],"executed":[83],"following":[84],"sequence,":[86],"predicted":[89],"region":[90,113,121],"works":[91],"sampling":[94,133],"domain":[95,110,134],"enhance":[97],"search":[99],"speed.":[100],"A":[101,139],"hybrid":[102],"sampler":[103],"designed":[105],"by":[106],"combining":[107],"uniform":[109],"domain,":[114],"ensuring":[115],"successful":[116],"samples,":[117],"even":[118],"if":[119],"disconnected.":[123],"Besides,":[124],"selection":[126],"rule":[127],"introduced":[129],"balance":[131],"during":[135],"different":[136],"searching":[137],"stages.":[138],"proof":[140],"probabilistic":[142],"completeness":[143],"S&Reg":[146,158,180],"method":[148],"given.":[150],"Simulations":[151],"verify":[152],"superior":[154],"performance":[155],"demonstrating":[161],"reduction":[163,192],"calculation":[165,194],"time":[166],"ranging":[167],"from":[168],"3.9%":[169],"13.0%.":[171],"Furthermore,":[172],"practical":[174],"scenario":[175],"validates":[176],"reliability":[178],"v2,":[181],"achieving":[182],"15.0%":[184],"improvement":[185],"success":[187],"rate":[188],"9.7%":[191],"time.":[195]},"counts_by_year":[],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2025-10-10T00:00:00"}