{"id":"https://openalex.org/W3046123085","doi":"https://doi.org/10.1109/iwcmc48107.2020.9148277","title":"Optimal Path Planning for Robot Based on Ant Colony Algorithm","display_name":"Optimal Path Planning for Robot Based on Ant Colony Algorithm","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3046123085","doi":"https://doi.org/10.1109/iwcmc48107.2020.9148277","mag":"3046123085"},"language":"en","primary_location":{"id":"doi:10.1109/iwcmc48107.2020.9148277","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwcmc48107.2020.9148277","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 International Wireless Communications and Mobile Computing (IWCMC)","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/A5024659597","display_name":"Hong Zhao","orcid":"https://orcid.org/0000-0003-0927-8634"},"institutions":[{"id":"https://openalex.org/I4210089143","display_name":"Changzhou Vocational Institute of Light Industry","ror":"https://ror.org/005ysj118","country_code":"CN","type":"facility","lineage":["https://openalex.org/I4210089143"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hong Zhao","raw_affiliation_strings":["Department of Mechanical & Electrical Engineering, Shandong Vocational College of light industry, Zibo, Shandong, China"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical & Electrical Engineering, Shandong Vocational College of light industry, Zibo, Shandong, China","institution_ids":["https://openalex.org/I4210089143"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5024659597"],"corresponding_institution_ids":["https://openalex.org/I4210089143"],"apc_list":null,"apc_paid":null,"fwci":0.8793,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.76209921,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"42","issue":null,"first_page":"671","last_page":"675"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9485999941825867,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9401000142097473,"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.8252431154251099},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7675200700759888},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7641392946243286},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.6286643743515015},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.627437949180603},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6198915839195251},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.6068282127380371},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.47098207473754883},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4666357636451721},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.41173139214515686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.351346492767334},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.08408039808273315},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.06246250867843628}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8252431154251099},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7675200700759888},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7641392946243286},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6286643743515015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.627437949180603},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6198915839195251},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.6068282127380371},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.47098207473754883},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4666357636451721},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41173139214515686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.351346492767334},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.08408039808273315},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.06246250867843628},{"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/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iwcmc48107.2020.9148277","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iwcmc48107.2020.9148277","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 International Wireless Communications and Mobile Computing (IWCMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7099999785423279}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1978151341","https://openalex.org/W2088219864","https://openalex.org/W2120600560","https://openalex.org/W2354228843","https://openalex.org/W2358313569","https://openalex.org/W2361322491","https://openalex.org/W2368429740","https://openalex.org/W2387231897","https://openalex.org/W6672881665"],"related_works":["https://openalex.org/W2930076404","https://openalex.org/W4253519380","https://openalex.org/W2071957557","https://openalex.org/W2596413128","https://openalex.org/W2356867392","https://openalex.org/W2782776446","https://openalex.org/W3043170174","https://openalex.org/W2155948905","https://openalex.org/W4380590094","https://openalex.org/W2050548713"],"abstract_inverted_index":{"With":[0],"the":[1,21,33,48,68,72,75,79,83,86,90,95,99,104,110,115,120,128,136,143,155,159],"development":[2,157],"of":[3,19,70,85,97],"computer":[4],"technology":[5,10],"and":[6,14,51,60,81,89,114,146,149],"intelligent":[7,156],"computing,":[8],"robot":[9,22,38,55,76,100,137],"also":[11,27],"gets":[12],"more":[13,15],"attention,":[16],"in":[17,58],"view":[18],"this,":[20],"path":[23,35,56,101,134],"planning":[24,36,57,102],"problem":[25],"is":[26,44,107,117],"particularly":[28],"important.":[29],"In":[30],"this":[31],"paper,":[32],"optimal":[34],"for":[37,109,135,158],"based":[39],"on":[40],"ant":[41,111],"colony":[42,112],"algorithm":[43],"proposed":[45],"by":[46],"studying":[47],"related":[49],"literature":[50],"important":[52],"techniques":[53],"about":[54],"China":[59],"abroad.":[61],"This":[62],"paper":[63],"mainly":[64],"considers":[65],"that":[66,127],"under":[67],"condition":[69],"sensing":[71],"current":[73],"environment,":[74],"dynamically":[77],"avoids":[78],"obstacles":[80],"meets":[82],"requirements":[84],"least":[87],"time":[88,145],"minimum":[91],"walking":[92],"path.":[93],"On":[94],"basis":[96],"introducing":[98],"problem,":[103],"mathematical":[105],"model":[106,129],"established":[108],"algorithm,":[113],"experiment":[116],"conducted":[118],"through":[119],"analogue":[121],"simulation.":[122],"The":[123],"experimental":[124],"results":[125],"show":[126],"can":[130],"intelligently":[131],"choose":[132],"a":[133,151],"with":[138],"dynamic":[139],"obstacle":[140],"avoidance,":[141],"having":[142],"shortest":[144],"shorter":[147],"distance,":[148],"has":[150],"certain":[152],"contribution":[153],"to":[154],"robot.":[160]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}