{"id":"https://openalex.org/W4206487593","doi":"https://doi.org/10.1145/3501409.3501609","title":"Robot path planning based on Ant colony Algorithm","display_name":"Robot path planning based on Ant colony Algorithm","publication_year":2021,"publication_date":"2021-10-22","ids":{"openalex":"https://openalex.org/W4206487593","doi":"https://doi.org/10.1145/3501409.3501609"},"language":"en","primary_location":{"id":"doi:10.1145/3501409.3501609","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3501409.3501609","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/A5015424182","display_name":"Kuang\u2013Chao Fan","orcid":"https://orcid.org/0000-0003-1320-9412"},"institutions":[{"id":"https://openalex.org/I74872605","display_name":"China Southern Power Grid (China)","ror":"https://ror.org/03hkh9419","country_code":"CN","type":"company","lineage":["https://openalex.org/I74872605"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Fan Kuang","raw_affiliation_strings":["Dongguan Power Supply Bureau of Guangdong Power, Grid Corporation, Dongguan, China"],"affiliations":[{"raw_affiliation_string":"Dongguan Power Supply Bureau of Guangdong Power, Grid Corporation, Dongguan, China","institution_ids":["https://openalex.org/I74872605"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058136065","display_name":"Ting Yang","orcid":"https://orcid.org/0000-0002-5213-5113"},"institutions":[{"id":"https://openalex.org/I74872605","display_name":"China Southern Power Grid (China)","ror":"https://ror.org/03hkh9419","country_code":"CN","type":"company","lineage":["https://openalex.org/I74872605"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ting Yang","raw_affiliation_strings":["Dongguan Power Supply Bureau of Guangdong Power, Grid Corporation, Dongguan, China"],"affiliations":[{"raw_affiliation_string":"Dongguan Power Supply Bureau of Guangdong Power, Grid Corporation, Dongguan, China","institution_ids":["https://openalex.org/I74872605"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014243317","display_name":"Wei Hu","orcid":"https://orcid.org/0000-0001-7754-1858"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wei Hu","raw_affiliation_strings":["Wuhan y-node Technology Co., LTD, Wuhan, China"],"affiliations":[{"raw_affiliation_string":"Wuhan y-node Technology Co., LTD, Wuhan, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051744604","display_name":"Yaocheng Fang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yaocheng Fang","raw_affiliation_strings":["Wuhan y-node Technology Co., LTD Wuhan, China"],"affiliations":[{"raw_affiliation_string":"Wuhan y-node Technology Co., LTD Wuhan, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5015424182"],"corresponding_institution_ids":["https://openalex.org/I74872605"],"apc_list":null,"apc_paid":null,"fwci":0.0653,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.37903226,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1130","last_page":"1134"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9970999956130981,"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.9970999956130981,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9502000212669373,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T14270","display_name":"Simulation and Modeling Applications","score":0.9448999762535095,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.8727717399597168},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6833096742630005},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6665061116218567},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.628494918346405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5727346539497375},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5366470217704773},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.501833438873291},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5015430450439453},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4463445842266083},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.440502405166626},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.39533913135528564},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3113822937011719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21109947562217712},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.07249641418457031},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07052487134933472}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8727717399597168},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6833096742630005},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6665061116218567},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.628494918346405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5727346539497375},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5366470217704773},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.501833438873291},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5015430450439453},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4463445842266083},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.440502405166626},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.39533913135528564},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3113822937011719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21109947562217712},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.07249641418457031},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07052487134933472},{"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},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3501409.3501609","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3501409.3501609","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":[{"id":"https://metadata.un.org/sdg/11","score":0.7099999785423279,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":1,"referenced_works":["https://openalex.org/W2738638683"],"related_works":["https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W4283826969","https://openalex.org/W2377010080","https://openalex.org/W2359600231","https://openalex.org/W4285338599","https://openalex.org/W2380019117","https://openalex.org/W1987886368","https://openalex.org/W2369187583","https://openalex.org/W1660309994"],"abstract_inverted_index":{"In":[0],"view":[1],"of":[2,5,23,48,89,127,145,151],"the":[3,41,45,49,51,59,66,69,73,87,96,107,112,118,128,131,138,143,149],"problems":[4],"ant":[6,35,152],"colony":[7,36,153],"algorithm":[8,37,154],"in":[9,111,117],"global":[10],"path":[11,24,60,82,90,132],"planning":[12,133],"under":[13],"static":[14],"environment,":[15],"such":[16],"as":[17,44,122],"slow":[18],"convergence":[19,126],"speed,":[20],"great":[21],"blindness":[22,88],"search":[25,61],"and":[26,72,92,115,136,142],"easy":[27],"access":[28],"to":[29,63,85,105,123],"local":[30],"optimal":[31],"solutions,":[32],"an":[33],"improved":[34],"is":[38],"proposed.":[39],"Taking":[40],"rasterization":[42],"map":[43],"running":[46],"environment":[47],"robot,":[50],"initial":[52],"pheromones":[53],"were":[54,140],"distributed":[55],"unevenly,":[56],"so":[57,121],"that":[58],"tended":[62],"be":[64],"near":[65],"line":[67],"between":[68],"starting":[70],"point":[71],"target":[74],"point.":[75],"Pseudo":[76],"random":[77],"strategy":[78],"was":[79,102,155],"introduced":[80],"on":[81,148],"selection":[83,91],"probability":[84],"reduce":[86],"speed":[93],"up":[94],"finding":[95],"shortest":[97],"path.":[98],"The":[99],"volatilization":[100,108],"coefficient":[101,109],"adjusted":[103],"dynamically":[104],"make":[106],"larger":[110],"early":[113],"stage":[114],"smaller":[116],"later":[119],"stage,":[120],"avoid":[124],"premature":[125],"algorithm.":[129],"Finally,":[130],"results":[134,150],"before":[135],"after":[137],"improvement":[139],"discussed,":[141],"influence":[144],"important":[146],"parameters":[147],"analyzed.":[156]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}