{"id":"https://openalex.org/W3089503274","doi":"https://doi.org/10.1080/08839514.2020.1824094","title":"An Effective Way to Large-Scale Robot-Path-Planning Using a Hybrid Approach of Pre-Clustering and Greedy Heuristic","display_name":"An Effective Way to Large-Scale Robot-Path-Planning Using a Hybrid Approach of Pre-Clustering and Greedy Heuristic","publication_year":2020,"publication_date":"2020-10-04","ids":{"openalex":"https://openalex.org/W3089503274","doi":"https://doi.org/10.1080/08839514.2020.1824094","mag":"3089503274"},"language":"en","primary_location":{"id":"doi:10.1080/08839514.2020.1824094","is_oa":false,"landing_page_url":"https://doi.org/10.1080/08839514.2020.1824094","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"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":"Applied Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doaj.org/article/19be745011804d9d9afeaa7d4821efd5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045632269","display_name":"W. C. Wang","orcid":"https://orcid.org/0000-0002-4833-9068"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"W. C. Wang","raw_affiliation_strings":["Department of Power Mechanical Engineering, National Tsing Hua University, Hsinchu City, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Power Mechanical Engineering, National Tsing Hua University, Hsinchu City, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030714502","display_name":"Rongshun Chen","orcid":"https://orcid.org/0000-0002-6590-8787"},"institutions":[{"id":"https://openalex.org/I25846049","display_name":"National Tsing Hua University","ror":"https://ror.org/00zdnkx70","country_code":"TW","type":"education","lineage":["https://openalex.org/I25846049"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"R. Chen","raw_affiliation_strings":["Department of Power Mechanical Engineering, National Tsing Hua University, Hsinchu City, Taiwan"],"affiliations":[{"raw_affiliation_string":"Department of Power Mechanical Engineering, National Tsing Hua University, Hsinchu City, Taiwan","institution_ids":["https://openalex.org/I25846049"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030714502"],"corresponding_institution_ids":["https://openalex.org/I25846049"],"apc_list":{"value":2195,"currency":"USD","value_usd":2195},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10383478,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"34","issue":"14","first_page":"1159","last_page":"1175"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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":0.9994999766349792,"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/T11106","display_name":"Data Management and Algorithms","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9915000200271606,"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/motion-planning","display_name":"Motion planning","score":0.7670170068740845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7502636909484863},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6448591947555542},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6098995208740234},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6081418991088867},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5634042024612427},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5345807075500488},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5269330739974976},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5168745517730713},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.49577102065086365},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4585132598876953},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4569630026817322},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.42757153511047363},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.41491344571113586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38611650466918945},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.34608274698257446},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1705600619316101},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1619352400302887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1360950469970703}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7670170068740845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7502636909484863},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6448591947555542},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6098995208740234},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6081418991088867},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5634042024612427},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5345807075500488},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5269330739974976},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5168745517730713},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.49577102065086365},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4585132598876953},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4569630026817322},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.42757153511047363},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.41491344571113586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38611650466918945},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34608274698257446},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1705600619316101},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1619352400302887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1360950469970703},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/08839514.2020.1824094","is_oa":false,"landing_page_url":"https://doi.org/10.1080/08839514.2020.1824094","pdf_url":null,"source":{"id":"https://openalex.org/S125501549","display_name":"Applied Artificial Intelligence","issn_l":"0883-9514","issn":["0883-9514","1087-6545"],"is_oa":false,"is_in_doaj":true,"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":"Applied Artificial Intelligence","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:19be745011804d9d9afeaa7d4821efd5","is_oa":true,"landing_page_url":"https://doaj.org/article/19be745011804d9d9afeaa7d4821efd5","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Applied Artificial Intelligence, Vol 34, Iss 14, Pp 1159-1175 (2020)","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:doaj.org/article:19be745011804d9d9afeaa7d4821efd5","is_oa":true,"landing_page_url":"https://doaj.org/article/19be745011804d9d9afeaa7d4821efd5","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Applied Artificial Intelligence, Vol 34, Iss 14, Pp 1159-1175 (2020)","raw_type":"article"},"sustainable_development_goals":[{"score":0.7200000286102295,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W113754518","https://openalex.org/W611075725","https://openalex.org/W1493454437","https://openalex.org/W1497256448","https://openalex.org/W1559839959","https://openalex.org/W1966612958","https://openalex.org/W1968594877","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W2004182374","https://openalex.org/W2014068360","https://openalex.org/W2024060531","https://openalex.org/W2039782444","https://openalex.org/W2069024107","https://openalex.org/W2102076751","https://openalex.org/W2108350607","https://openalex.org/W2132549764","https://openalex.org/W2134089414","https://openalex.org/W2143037347","https://openalex.org/W2165558283","https://openalex.org/W2504632360","https://openalex.org/W2755717591","https://openalex.org/W2988480584","https://openalex.org/W4213191351"],"related_works":["https://openalex.org/W2368795992","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W2106119116","https://openalex.org/W2904203243","https://openalex.org/W3139139461","https://openalex.org/W2056737145","https://openalex.org/W4297094037","https://openalex.org/W1660309994"],"abstract_inverted_index":{"Robot-path-planning":[0],"seeks":[1],"the":[2,7,14,21,29,33,37,45,50,67,80,87,93,103,109,117,127,143,154,163,167,174,177,184,191,195,206,214,223,226],"shortest":[3,38],"path":[4,39,145,185,215],"to":[5,74,78,107,125,152,200,213],"optimize":[6],"motion":[8],"cost":[9,114,130],"for":[10,36,221,225],"robots.":[11],"In":[12,204],"robot-path-planning,":[13],"computational":[15,68,112,128,178],"time":[16,65,69,113,129,179],"will":[17,89],"significantly":[18,181],"increase":[19],"if":[20],"moving":[22,82,219],"targets":[23],"rise":[24],"largely,":[25],"also":[26,150],"known":[27],"as":[28,58,61],"large-scale":[30,46,218],"TSP.":[31,47],"Hence,":[32],"current":[34],"algorithms":[35],"planning":[40,216],"may":[41],"be":[42,75,90,210],"ineffective":[43],"in":[44,84,229],"Aimed":[48],"at":[49],"real-time":[51],"applications":[52],"that":[53],"a":[54,71,99,136,170,201,230],"robot":[55,72,88,228],"must":[56],"achieve":[57,116],"many":[59],"goals":[60],"possible":[62],"within":[63],"limited":[64],"and":[66,115,142,183],"of":[70,111,135],"has":[73],"short":[76],"enough":[77],"provide":[79],"next":[81],"signal":[83],"time.":[85],"Otherwise,":[86],"trapped":[91],"into":[92],"idle":[94],"status.":[95],"This":[96],"work":[97,208],"proposes":[98],"hybrid":[100],"approach,":[101],"called":[102],"pre-clustering":[104],"greedy":[105],"heuristic,":[106,176],"tackle":[108],"reduction":[110],"near-optimal":[118],"solutions.":[119],"The":[120],"proposed":[121,175,207],"algorithm":[122,148],"demonstrates":[123],"how":[124],"lower":[126],"drastically":[131],"via":[132],"smaller":[133],"data":[134,197],"sub-group,":[137],"divided":[138],"by":[139,172],"k-means":[140],"clustering,":[141],"intra-cluster":[144],"planning.":[146],"An":[147],"is":[149,166,180,187],"developed":[151],"construct":[153],"nearest":[155],"connections":[156],"between":[157],"any":[158],"two":[159],"unconnected":[160],"clusters,":[161],"ensuring":[162],"inter-cluster":[164],"tour":[165],"shortest.":[168],"As":[169],"result,":[171],"utilizing":[173],"reduced":[182],"length":[186],"more":[188],"efficient":[189],"than":[190],"benchmark":[192],"algorithms,":[193],"while":[194],"input":[196],"grow":[198],"up":[199],"large":[202],"scale.":[203],"applications,":[205],"can":[209],"applied":[211],"practically":[212],"with":[217],"targets,":[220],"example,":[222],"employment":[224],"ball-collecting":[227],"court.":[231]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}