{"id":"https://openalex.org/W4362709184","doi":"https://doi.org/10.1109/cis58238.2022.00017","title":"Path planning algorithm based on hybrid A* and adaptive ant colony optimization","display_name":"Path planning algorithm based on hybrid A* and adaptive ant colony optimization","publication_year":2022,"publication_date":"2022-12-01","ids":{"openalex":"https://openalex.org/W4362709184","doi":"https://doi.org/10.1109/cis58238.2022.00017"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cis58238.2022.00017","pdf_url":null,"source":{"id":"https://openalex.org/S4363608286","display_name":"2021 17th International Conference on Computational Intelligence and Security (CIS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5089231151","display_name":"Junfeng Chen","orcid":"https://orcid.org/0000-0002-3642-007X"},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"funder","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junfeng Chen","raw_affiliation_strings":["College of IOT Engineering Hohai University,Changzhou,China,213022"],"affiliations":[{"raw_affiliation_string":"College of IOT Engineering Hohai University,Changzhou,China,213022","institution_ids":["https://openalex.org/I163340411"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101994797","display_name":"Xueping Zhang","orcid":"https://orcid.org/0000-0002-9136-1455"},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"funder","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xueping Zhang","raw_affiliation_strings":["College of IOT Engineering Hohai University,Changzhou,China,213022"],"affiliations":[{"raw_affiliation_string":"College of IOT Engineering Hohai University,Changzhou,China,213022","institution_ids":["https://openalex.org/I163340411"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077157021","display_name":"Luyixiao Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I163340411","display_name":"Hohai University","ror":"https://ror.org/01wd4xt90","country_code":"CN","type":"funder","lineage":["https://openalex.org/I163340411"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Luyixiao Xu","raw_affiliation_strings":["College of IOT Engineering Hohai University,Changzhou,China,213022"],"affiliations":[{"raw_affiliation_string":"College of IOT Engineering Hohai University,Changzhou,China,213022","institution_ids":["https://openalex.org/I163340411"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.275,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.514605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":70,"max":75},"biblio":{"volume":null,"issue":null,"first_page":"43","last_page":"48"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.53527445},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.42887124}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.82754576},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.75936186},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6586298},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.62431926},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5915705},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.57680017},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.53527445},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5209564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5124195},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.44450614},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.42887124},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.30402333},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2566746},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24591208},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1692845},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","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/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"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},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/cis58238.2022.00017","pdf_url":null,"source":{"id":"https://openalex.org/S4363608286","display_name":"2021 17th International Conference on Computational Intelligence and Security (CIS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":7,"referenced_works":["https://openalex.org/W1970276631","https://openalex.org/W2896016833","https://openalex.org/W2939018330","https://openalex.org/W3172948719","https://openalex.org/W3217197589","https://openalex.org/W4381085573","https://openalex.org/W4391429284"],"related_works":["https://openalex.org/W4395071568","https://openalex.org/W4308080200","https://openalex.org/W4297094037","https://openalex.org/W3139139461","https://openalex.org/W2908094156","https://openalex.org/W2904203243","https://openalex.org/W2389896347","https://openalex.org/W2368795992","https://openalex.org/W2056737145","https://openalex.org/W1660309994"],"abstract_inverted_index":{"It":[0],"is":[1],"challenging":[2],"to":[3],"plan":[4],"the":[5,11,26,41,47,50,52,56,59,63,69,81,107],"optimal":[6],"and":[7,33,62,67,91,98,119,122],"smooth":[8],"path":[9,13,21,60,72,110,128],"using":[10],"traditional":[12,84],"planning":[14,22,61,111],"algorithm.":[15],"This":[16],"paper":[17],"proposes":[18],"a":[19,114],"hybrid":[20,109],"algorithm":[23,28,54,112],"based":[24,76],"on":[25,49,77],"A*":[27],"with":[29],"quadratic":[30,42],"node":[31,43],"search":[32,44,89,117],"an":[34],"adaptive":[35],"Ant":[36],"Colony":[37],"Algorithm":[38],"(ACO).":[39],"Through":[40],"operation":[45],"of":[46,58,65,71,83],"nodes":[48],"path,":[51],"proposed":[53,108],"reduces":[55],"length":[57],"number":[64],"turns":[66],"improves":[68],"efficiency":[70],"planning.":[73,129],"The":[74,102],"ACO":[75],"pheromone":[78,97],"adjustment":[79],"overcomes":[80],"shortcomings":[82],"ACO,":[85],"such":[86],"as":[87],"long":[88],"time":[90],"slow":[92],"convergence":[93,120],"speed,":[94],"by":[95],"adjusting":[96],"improving":[99],"transition":[100],"probability.":[101],"experimental":[103],"results":[104,125],"show":[105],"that":[106],"has":[113],"better":[115,124],"global":[116],"ability":[118],"speed":[121],"achieves":[123],"in":[126],"robot":[127]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4362709184","counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-02-23T03:16:32.216139","created_date":"2023-04-09"}