{"id":"https://openalex.org/W1524823617","doi":"https://doi.org/10.1109/cec.2015.7256934","title":"A novel heterogeneous feature ant colony optimization and its application on robot path planning","display_name":"A novel heterogeneous feature ant colony optimization and its application on robot path planning","publication_year":2015,"publication_date":"2015-05-01","ids":{"openalex":"https://openalex.org/W1524823617","doi":"https://doi.org/10.1109/cec.2015.7256934","mag":"1524823617"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2015.7256934","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7256934","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","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/A5058077843","display_name":"Yiyun Yao","orcid":"https://orcid.org/0000-0003-3847-815X"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yiyun Yao","raw_affiliation_strings":["College of Software Engineering, Southeast University, Nanjing, China","College of Software Engineering, SouthEast University, Nanjing, China#TAB#"],"affiliations":[{"raw_affiliation_string":"College of Software Engineering, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"College of Software Engineering, SouthEast University, Nanjing, China#TAB#","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069874944","display_name":"Qingjian Ni","orcid":"https://orcid.org/0000-0002-6335-977X"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qingjian Ni","raw_affiliation_strings":["School of Computer Science and Engineering, Southeast University, Nanjing, China","College of Software Engineering, SouthEast University, Nanjing, China#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"College of Software Engineering, SouthEast University, Nanjing, China#TAB#","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091079964","display_name":"Qing Lv","orcid":null},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qing Lv","raw_affiliation_strings":["College of Software Engineering, Southeast University, Nanjing, China","College of Software Engineering, SouthEast University, Nanjing, China#TAB#"],"affiliations":[{"raw_affiliation_string":"College of Software Engineering, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"College of Software Engineering, SouthEast University, Nanjing, China#TAB#","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100766400","display_name":"Kai Huang","orcid":"https://orcid.org/0009-0000-1735-1788"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kai Huang","raw_affiliation_strings":["College of Software Engineering, Southeast University, Nanjing, China","College of Software Engineering, SouthEast University, Nanjing, China#TAB#"],"affiliations":[{"raw_affiliation_string":"College of Software Engineering, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]},{"raw_affiliation_string":"College of Software Engineering, SouthEast University, Nanjing, China#TAB#","institution_ids":["https://openalex.org/I76569877"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5058077843"],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":2.3932,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.92311815,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"11","issue":null,"first_page":"522","last_page":"528"},"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.9970999956130981,"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/T12391","display_name":"Artificial Immune Systems Applications","score":0.9787999987602234,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/pathfinding","display_name":"Pathfinding","score":0.8565875291824341},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7960786819458008},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.68931645154953},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.669657289981842},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5962375402450562},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5649157762527466},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.5459288358688354},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5360852479934692},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5355527400970459},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5338510274887085},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.47372356057167053},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4461270570755005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1673882007598877},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1265796720981598}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.8565875291824341},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7960786819458008},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.68931645154953},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.669657289981842},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5962375402450562},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5649157762527466},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.5459288358688354},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5360852479934692},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5355527400970459},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5338510274887085},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.47372356057167053},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4461270570755005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1673882007598877},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1265796720981598},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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.1109/cec.2015.7256934","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2015.7256934","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1505431770","https://openalex.org/W1537653938","https://openalex.org/W1801849579","https://openalex.org/W1975521481","https://openalex.org/W1980741812","https://openalex.org/W2013137019","https://openalex.org/W2040483961","https://openalex.org/W2053882594","https://openalex.org/W2093427005","https://openalex.org/W2100561003","https://openalex.org/W2124058244","https://openalex.org/W2144814833","https://openalex.org/W2145053972","https://openalex.org/W2154929945","https://openalex.org/W2166116468","https://openalex.org/W2169528473","https://openalex.org/W2542735967","https://openalex.org/W2963140271"],"related_works":["https://openalex.org/W2512285581","https://openalex.org/W4402599120","https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W2605563323","https://openalex.org/W4283826969","https://openalex.org/W2383519316","https://openalex.org/W2377010080","https://openalex.org/W3088868185","https://openalex.org/W2350354796"],"abstract_inverted_index":{"Robot":[0],"path":[1,22,59,114],"planning":[2,60],"is":[3,33],"a":[4,34,47,112,116],"complicated":[5],"problem":[6],"which":[7,37],"needs":[8],"to":[9,18,23,55,75,122],"balance":[10],"many":[11,39],"factors.":[12],"In":[13,62],"pathfinding,":[14],"the":[15,20,24,28,57,63,77,81,85,98,102,123],"robot":[16,58],"has":[17,38],"find":[19,111],"shortest":[21],"destination":[25],"and":[26,101],"avoid":[27],"obstacles.":[29],"Ant":[30],"colony":[31,51],"optimization":[32,52],"heuristic":[35],"algorithm":[36,54,82],"excellent":[40],"features":[41,72],"in":[42,115],"pathfinding.":[43],"This":[44],"paper":[45],"proposed":[46,64],"heterogeneous":[48],"feature":[49],"ant":[50],"(HFACO)":[53],"solve":[56],"problem.":[61],"method,":[65],"two":[66],"kinds":[67],"of":[68,80,87,119],"ants":[69],"with":[70],"different":[71],"are":[73],"designed":[74],"influence":[76],"convergence":[78],"rate":[79],"by":[83],"controlling":[84],"number":[86],"them.":[88],"We":[89],"also":[90],"applied":[91],"some":[92],"other":[93],"novel":[94],"strategies":[95],"that":[96,108],"enhance":[97],"solving":[99],"quality":[100],"performance.":[103],"The":[104],"experiment":[105],"results":[106],"show":[107],"HFACO":[109],"can":[110],"better":[113],"shorter":[117],"period":[118],"time":[120],"compared":[121],"classical":[124],"ACO":[125],"algorithms.":[126]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}