{"id":"https://openalex.org/W2171229240","doi":"https://doi.org/10.4304/jcp.8.3.585-593","title":"An Improved Ant Colony Optimization Applied in Robot Path Planning Problem","display_name":"An Improved Ant Colony Optimization Applied in Robot Path Planning Problem","publication_year":2013,"publication_date":"2013-02-27","ids":{"openalex":"https://openalex.org/W2171229240","doi":"https://doi.org/10.4304/jcp.8.3.585-593","mag":"2171229240"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.8.3.585-593","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.8.3.585-593","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-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/A5069128351","display_name":"Xiangyang Deng","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xiangyang Deng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100680761","display_name":"Limin Zhang","orcid":"https://orcid.org/0000-0002-1350-1918"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Limin Zhang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5045660554","display_name":"Lan Luo","orcid":"https://orcid.org/0000-0002-2617-7774"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lan Luo","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069128351"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8165,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.78223405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"8","issue":"3","first_page":null,"last_page":null},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9958000183105469,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9954000115394592,"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.8381119966506958},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6477128863334656},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5823878049850464},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5643355250358582},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.539640486240387},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3882598578929901},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.34963077306747437},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15800517797470093},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.055306822061538696}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8381119966506958},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6477128863334656},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5823878049850464},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5643355250358582},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.539640486240387},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3882598578929901},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34963077306747437},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15800517797470093},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.055306822061538696}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.8.3.585-593","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.8.3.585-593","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1492640216","https://openalex.org/W1505282290","https://openalex.org/W1566652554","https://openalex.org/W1573676079","https://openalex.org/W1969953660","https://openalex.org/W1994507937","https://openalex.org/W2037567262","https://openalex.org/W2090435272","https://openalex.org/W2114593017","https://openalex.org/W2114912537","https://openalex.org/W2124253297","https://openalex.org/W2140481494","https://openalex.org/W2154929945","https://openalex.org/W2162125251","https://openalex.org/W2170159631","https://openalex.org/W2297395784","https://openalex.org/W2377779533","https://openalex.org/W2382815556","https://openalex.org/W2913668833","https://openalex.org/W4292408555","https://openalex.org/W6633855160"],"related_works":["https://openalex.org/W2950740898","https://openalex.org/W2278226347","https://openalex.org/W2799139340","https://openalex.org/W3128991857","https://openalex.org/W3203961724","https://openalex.org/W2050928134","https://openalex.org/W2000120653","https://openalex.org/W2897693823","https://openalex.org/W3143559370","https://openalex.org/W1492267204"],"abstract_inverted_index":{"an":[0,61,128,157,195],"improved":[1],"Ant":[2],"colony":[3],"optimization":[4,165],"algorithm":[5,81,209],"(PM-ACO":[6],"for":[7,122],"short)":[8],"is":[9,58,74,82,94,109,120,131,183,210],"proposed":[10,83],"to":[11,65,79,84,113,133,141],"solve":[12],"the":[13,24,29,34,39,55,67,80,86,89,97,110,114,124,136,143,148,178,187,199,208],"robot":[14,188],"path":[15,189,200],"planning":[16,201],"problem.":[17],"In":[18,139],"PM-ACO,":[19],"ants":[20],"deposit":[21],"pheromone":[22,37,49,90,98,104,125,137],"on":[23,28,91,99],"nodes":[25,63,118],"but":[26],"not":[27],"arcs,":[30],"resulting":[31],"in":[32,146,169,185],"that":[33,194],"trails":[35],"of":[36,41,45,48,72,177,198],"become":[38],"form":[40],"marks,":[42],"which":[43],"consist":[44],"a":[46,102,154,162,174],"series":[47],"points.":[50],"After":[51],"ant":[52],"colony\u2019s":[53],"tours,":[54],"iteration-best":[56],"strategy":[57],"combined":[59],"with":[60],"r-best":[62,117],"rule":[64,119,160,166],"update":[66],"nodes\u2019":[68],"pheromone.":[69],"The":[70],"stability":[71],"PM-ACO":[73,182],"analyzed":[75],"and":[76,127,152,161,207],"some":[77],"advancement":[78],"improve":[85],"performance.":[87],"Because":[88],"several":[92],"arcs":[93],"integrated":[95],"into":[96],"one":[100,163],"node,":[101],"rapid":[103],"accumulation":[105],"occurs":[106],"easily.":[107],"It":[108],"major":[111],"causes":[112],"instability.":[115],"\u00a0An":[116],"presented":[121],"regulating":[123],"distribution":[126],"adaptive":[129],"mechanism":[130],"designed":[132],"further":[134],"balance":[135],"arrangement.":[138],"addition,":[140],"shorten":[142],"time":[144],"wasted":[145],"constructing":[147],"first":[149],"complete":[150],"solution":[151,197],"get":[153],"better":[155],"solution,":[156],"azimuth":[158],"guiding":[159],"step":[164],"are":[167],"used":[168],"local":[170],"optimization.":[171],"By":[172],"establishing":[173],"grid":[175],"model":[176],"robot\u2019s":[179],"navigation":[180],"area,":[181],"applied":[184],"solving":[186],"planning.\u00a0":[190],"Experimental":[191],"results":[192],"show":[193],"optimal":[196],"problem":[202],"can":[203],"be":[204],"achieved":[205],"effectively,":[206],"practical.":[211]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}