{"id":"https://openalex.org/W4291700431","doi":"https://doi.org/10.1109/icccs55155.2022.9846162","title":"Study of a Complete Traversal Path Planning Algorithm<sup>1</sup>","display_name":"Study of a Complete Traversal Path Planning Algorithm<sup>1</sup>","publication_year":2022,"publication_date":"2022-04-22","ids":{"openalex":"https://openalex.org/W4291700431","doi":"https://doi.org/10.1109/icccs55155.2022.9846162"},"language":"en","primary_location":{"id":"doi:10.1109/icccs55155.2022.9846162","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccs55155.2022.9846162","pdf_url":null,"source":{"id":"https://openalex.org/S4363608130","display_name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","raw_type":"proceedings-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/A5109599916","display_name":"Yulin Cheng","orcid":null},"institutions":[{"id":"https://openalex.org/I159948400","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62","country_code":"CN","type":"education","lineage":["https://openalex.org/I159948400"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yulin Cheng","raw_affiliation_strings":["Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China"],"affiliations":[{"raw_affiliation_string":"Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","institution_ids":["https://openalex.org/I159948400"]},{"raw_affiliation_string":"Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China","institution_ids":["https://openalex.org/I159948400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100704826","display_name":"Zefeng Chen","orcid":"https://orcid.org/0000-0002-5951-0051"},"institutions":[{"id":"https://openalex.org/I159948400","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62","country_code":"CN","type":"education","lineage":["https://openalex.org/I159948400"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zefeng Chen","raw_affiliation_strings":["Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China"],"affiliations":[{"raw_affiliation_string":"Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","institution_ids":["https://openalex.org/I159948400"]},{"raw_affiliation_string":"Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China","institution_ids":["https://openalex.org/I159948400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047545856","display_name":"Deyi Zeng","orcid":null},"institutions":[{"id":"https://openalex.org/I159948400","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62","country_code":"CN","type":"education","lineage":["https://openalex.org/I159948400"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Deyi Zeng","raw_affiliation_strings":["Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China"],"affiliations":[{"raw_affiliation_string":"Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","institution_ids":["https://openalex.org/I159948400"]},{"raw_affiliation_string":"Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China","institution_ids":["https://openalex.org/I159948400"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102295163","display_name":"Ruoyu Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I159948400","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62","country_code":"CN","type":"education","lineage":["https://openalex.org/I159948400"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruoyu Huang","raw_affiliation_strings":["Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China"],"affiliations":[{"raw_affiliation_string":"Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","institution_ids":["https://openalex.org/I159948400"]},{"raw_affiliation_string":"Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China","institution_ids":["https://openalex.org/I159948400"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101911513","display_name":"Zujian Wu","orcid":"https://orcid.org/0000-0001-5937-0311"},"institutions":[{"id":"https://openalex.org/I159948400","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62","country_code":"CN","type":"education","lineage":["https://openalex.org/I159948400"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zujian Wu","raw_affiliation_strings":["Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China"],"affiliations":[{"raw_affiliation_string":"Jinan University,Jinan University - University of Birmingham Joint Institute,Guangzhou,P. R. China","institution_ids":["https://openalex.org/I159948400"]},{"raw_affiliation_string":"Jinan University - University of Birmingham Joint Institute, Jinan University, Guangzhou, P. R. China","institution_ids":["https://openalex.org/I159948400"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5109599916"],"corresponding_institution_ids":["https://openalex.org/I159948400"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.061386,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"481","last_page":"486"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9933000206947327,"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.9933000206947327,"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/T10616","display_name":"Smart Agriculture and AI","score":0.9217000007629395,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9132999777793884,"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.8508237600326538},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.8156158924102783},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6934903860092163},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6891068816184998},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.625848650932312},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6136409044265747},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5812093019485474},{"id":"https://openalex.org/keywords/a*-search-algorithm","display_name":"A* search algorithm","score":0.4902418255805969},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48924970626831055},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.45912161469459534},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.42540544271469116},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.42464661598205566},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3867659568786621},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3366888165473938},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.2884330451488495},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.27192258834838867},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21642816066741943},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21035227179527283},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.19777971506118774}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8508237600326538},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.8156158924102783},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6934903860092163},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6891068816184998},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.625848650932312},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6136409044265747},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5812093019485474},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.4902418255805969},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48924970626831055},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.45912161469459534},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.42540544271469116},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.42464661598205566},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3867659568786621},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3366888165473938},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2884330451488495},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.27192258834838867},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21642816066741943},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21035227179527283},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.19777971506118774},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccs55155.2022.9846162","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccs55155.2022.9846162","pdf_url":null,"source":{"id":"https://openalex.org/S4363608130","display_name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Zero hunger","id":"https://metadata.un.org/sdg/2"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322292","display_name":"Jinan University","ror":"https://ror.org/02xe5ns62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2003172979","https://openalex.org/W2107941094","https://openalex.org/W3014378593","https://openalex.org/W3128046433","https://openalex.org/W3157599146","https://openalex.org/W3206167478"],"related_works":["https://openalex.org/W3155786147","https://openalex.org/W2995673330","https://openalex.org/W2614449343","https://openalex.org/W4362644879","https://openalex.org/W3116259232","https://openalex.org/W4210716962","https://openalex.org/W2368795992","https://openalex.org/W2758202899","https://openalex.org/W2548289027","https://openalex.org/W4291700431"],"abstract_inverted_index":{"Traversal":[0],"path":[1,13,24,61,89,96,126],"planning":[2,14,90,97,127],"is":[3,52,92,104,120],"widely":[4],"applied":[5],"in":[6,20,38,146,153],"many":[7],"technical":[8],"or":[9,28],"strategical":[10],"spheres.":[11],"The":[12],"algorithm":[15,67,98,112,145],"plays":[16],"an":[17,22,66],"important":[18],"role":[19],"designing":[21],"effective":[23],"for":[25,40,45],"robot-":[26],"sweepers":[27],"lawnmowers":[29],"operations.":[30],"Additionally,":[31],"there":[32],"are":[33,130],"requirements":[34],"of":[35,72,85],"wide":[36],"applications":[37],"agriculture":[39],"generating":[41,157],"appropriate":[42],"moving":[43,159],"guides":[44],"some":[46],"irregular":[47],"paddy":[48],"fields.":[49],"However,":[50],"it":[51],"still":[53],"a":[54,59,82,158,162],"problem":[55],"how":[56],"to":[57,68,106,123],"achieve":[58,69],"complete":[60],"planning.":[62],"This":[63],"paper":[64,148],"proposes":[65],"full":[70],"coverage":[71],"the":[73,109,143],"map":[74],"with":[75,136],"low":[76,163],"repeat":[77,164],"rates.":[78],"In":[79],"this":[80,147],"paper,":[81],"composed":[83],"strategy":[84],"local":[86,125],"and":[87,116,156],"global":[88,95],"algorithms":[91],"investigated.":[93],"A":[94],"named":[99,113],"Improved":[100],"Ant":[101],"Colony":[102],"Algorithm":[103,119],"studied":[105],"work":[107],"on":[108,134],"graph.":[110],"An":[111],"Vertical":[114],"Wave-Front":[115],"Distance":[117],"Transformation":[118],"carried":[121,131],"out":[122,132],"study":[124],"issues.":[128],"Simulations":[129],"based":[133],"maps":[135,155],"different":[137],"characteristics.":[138],"Simulation":[139],"results":[140],"show":[141],"that":[142],"proposed":[144],"can":[149],"perform":[150],"very":[151],"well":[152],"covering":[154],"route":[160],"at":[161],"rate.":[165]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}