{"id":"https://openalex.org/W4205585393","doi":"https://doi.org/10.1145/3501409.3501641","title":"Research on Path Planning of Mobile Robot Based on Global View Ant Colony Algorithm","display_name":"Research on Path Planning of Mobile Robot Based on Global View Ant Colony Algorithm","publication_year":2021,"publication_date":"2021-10-22","ids":{"openalex":"https://openalex.org/W4205585393","doi":"https://doi.org/10.1145/3501409.3501641"},"language":"en","primary_location":{"id":"doi:10.1145/3501409.3501641","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3501409.3501641","pdf_url":null,"source":{"id":"https://openalex.org/S4363608789","display_name":"Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering","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":"Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering","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/A5100961547","display_name":"Feiyu Ma","orcid":null},"institutions":[{"id":"https://openalex.org/I10535382","display_name":"Chongqing University of Posts and Telecommunications","ror":"https://ror.org/03dgaqz26","country_code":"CN","type":"education","lineage":["https://openalex.org/I10535382"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Feiyu Ma","raw_affiliation_strings":["School of Software Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China"],"affiliations":[{"raw_affiliation_string":"School of Software Engineering, Chongqing University of Posts and Telecommunications, Chongqing, China","institution_ids":["https://openalex.org/I10535382"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101599422","display_name":"Xiaoyu Ma","orcid":"https://orcid.org/0000-0003-4205-7657"},"institutions":[{"id":"https://openalex.org/I1313079697","display_name":"Southwest University of Political Science & Law","ror":"https://ror.org/02pz16m08","country_code":"CN","type":"education","lineage":["https://openalex.org/I1313079697"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoyu Ma","raw_affiliation_strings":["School of administrative law, Southwest University of Political Science & Law, Chongqing, China"],"affiliations":[{"raw_affiliation_string":"School of administrative law, Southwest University of Political Science & Law, Chongqing, China","institution_ids":["https://openalex.org/I1313079697"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100961547"],"corresponding_institution_ids":["https://openalex.org/I10535382"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16215438,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1314","last_page":"1320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9983999729156494,"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.9983999729156494,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9750999808311462,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9363999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8442198038101196},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.7628158330917358},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6056883335113525},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6053933501243591},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6043412089347839},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5666652321815491},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.5645076036453247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.544679582118988},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.5211489200592041},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5166938304901123},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4159412682056427},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2662324905395508}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8442198038101196},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.7628158330917358},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6056883335113525},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6053933501243591},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6043412089347839},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5666652321815491},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.5645076036453247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.544679582118988},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5211489200592041},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5166938304901123},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4159412682056427},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2662324905395508},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3501409.3501641","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3501409.3501641","pdf_url":null,"source":{"id":"https://openalex.org/S4363608789","display_name":"Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering","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":"Proceedings of the 2021 5th International Conference on Electronic Information Technology and Computer Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","id":"https://metadata.un.org/sdg/1","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1801849579","https://openalex.org/W2100561003","https://openalex.org/W2531286367","https://openalex.org/W2533057349","https://openalex.org/W2799726513","https://openalex.org/W2808115698","https://openalex.org/W2890611454","https://openalex.org/W2913670883","https://openalex.org/W2938380935","https://openalex.org/W2939018330","https://openalex.org/W3016464085"],"related_works":["https://openalex.org/W2347951034","https://openalex.org/W2123829500","https://openalex.org/W2305572622","https://openalex.org/W4283765137","https://openalex.org/W4317496694","https://openalex.org/W3174749984","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W3175696377"],"abstract_inverted_index":{"Aiming":[0],"at":[1],"the":[2,17,47,55,67,71,98,108,123,130,142,149,157,161,166,170,175,183,189],"problems":[3],"of":[4,20,74,102,133,159,186],"slow":[5],"iteration":[6],"speed,":[7],"disorder":[8,101],"in":[9,156],"initial":[10,99],"exploration":[11],"and":[12,66,88,116,128,164,188,197],"poor":[13],"ability":[14,68,158],"to":[15,45,60,69,96,121],"approach":[16],"optimal":[18,56,72,125,162],"solution":[19,73,126,163],"ant":[21,26,50,75,104,134,144],"colony":[22,27,51,76,105,135,145],"algorithm,":[23],"an":[24,89],"improved":[25,79,90,143,194],"algorithm":[28,52,77,115,146],"based":[29,112,147],"on":[30,113,148],"global":[31,41,150],"view":[32,42,151],"is":[33,43,119,179],"proposed.":[34],"Firstly,":[35],"a":[36,84,153],"multi-level":[37],"parallel":[38,81],"structure":[39],"with":[40],"proposed":[44,95],"solve":[46],"problem":[48,127],"that":[49,141],"can't":[53],"find":[54],"step":[57],"size":[58],"due":[59],"local":[61,109,124],"view.":[62],"The":[63,137],"convergence":[64,131,167],"speed":[65,132],"approximate":[70],"are":[78,94,193],"by":[80,181,195],"structure.":[82],"Then,":[83],"pheromone":[85,91],"initialization":[86],"method":[87,93,111],"update":[92],"improve":[97,129],"search":[100,110],"traditional":[103],"algorithm.":[106,136],"Finally,":[107],"geometric":[114],"genetic":[117],"operator":[118],"used":[120],"alleviate":[122],"experimental":[138],"results":[139],"show":[140],"has":[152],"significant":[154],"improvement":[155],"approaching":[160],"improving":[165],"speed.":[168],"In":[169],"two":[171],"simulation":[172],"maps":[173],"testing,":[174],"average":[176,184,190],"path":[177],"length":[178],"optimized":[180],"10.5%,":[182],"number":[185],"iterations":[187],"running":[191],"time":[192],"73.5%":[196],"81%":[198],"respectively.":[199]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}