{"id":"https://openalex.org/W4307165864","doi":"https://doi.org/10.3233/jifs-222211","title":"Improved ant colony algorithm for path planning of mobile robots based on compound prediction mechanism","display_name":"Improved ant colony algorithm for path planning of mobile robots based on compound prediction mechanism","publication_year":2022,"publication_date":"2022-10-21","ids":{"openalex":"https://openalex.org/W4307165864","doi":"https://doi.org/10.3233/jifs-222211"},"language":"en","primary_location":{"id":"doi:10.3233/jifs-222211","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-222211","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","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/A5079883747","display_name":"Zhongpu Liu","orcid":"https://orcid.org/0000-0002-3277-2537"},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongpu Liu","raw_affiliation_strings":["Institute of Mechanical and Electrical Equipmentand Measurement and Control Technology, School of Electrical Engineering, Henan University of Technology, Zhengzhou, China"],"affiliations":[{"raw_affiliation_string":"Institute of Mechanical and Electrical Equipmentand Measurement and Control Technology, School of Electrical Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031374320","display_name":"Jianjuan Liu","orcid":"https://orcid.org/0009-0003-1916-6166"},"institutions":[{"id":"https://openalex.org/I36152291","display_name":"Henan University of Technology","ror":"https://ror.org/05sbgwt55","country_code":"CN","type":"education","lineage":["https://openalex.org/I36152291"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jianjuan Liu","raw_affiliation_strings":["Institute of Mechanical and Electrical Equipmentand Measurement and Control Technology, School of Electrical Engineering, Henan University of Technology, Zhengzhou, China"],"affiliations":[{"raw_affiliation_string":"Institute of Mechanical and Electrical Equipmentand Measurement and Control Technology, School of Electrical Engineering, Henan University of Technology, Zhengzhou, China","institution_ids":["https://openalex.org/I36152291"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5031374320"],"corresponding_institution_ids":["https://openalex.org/I36152291"],"apc_list":null,"apc_paid":null,"fwci":1.0076,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.77157181,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"44","issue":"2","first_page":"2147","last_page":"2162"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9919999837875366,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.986299991607666,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8840104341506958},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.758732795715332},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.665427565574646},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5510190725326538},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5482532978057861},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5295905470848083},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4765228033065796},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4357561469078064},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.26897910237312317},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.24513989686965942},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17424142360687256}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8840104341506958},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.758732795715332},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.665427565574646},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5510190725326538},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5482532978057861},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5295905470848083},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4765228033065796},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4357561469078064},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26897910237312317},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.24513989686965942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17424142360687256},{"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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jifs-222211","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jifs-222211","pdf_url":null,"source":{"id":"https://openalex.org/S179157397","display_name":"Journal of Intelligent & Fuzzy Systems","issn_l":"1064-1246","issn":["1064-1246","1875-8967"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Fuzzy Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6299999952316284,"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W2021994503","https://openalex.org/W2026535857","https://openalex.org/W2148287521","https://openalex.org/W2192308205","https://openalex.org/W2417637069","https://openalex.org/W2591637099","https://openalex.org/W2793579702","https://openalex.org/W2799726513","https://openalex.org/W2898165977","https://openalex.org/W2900861938","https://openalex.org/W2906436642","https://openalex.org/W2938380935","https://openalex.org/W2944811079","https://openalex.org/W3007887123","https://openalex.org/W3013773102","https://openalex.org/W3015045924","https://openalex.org/W3016164434","https://openalex.org/W3020990685","https://openalex.org/W3045728165","https://openalex.org/W3111681628","https://openalex.org/W3118513984","https://openalex.org/W3128077670","https://openalex.org/W3134364829","https://openalex.org/W3135798356","https://openalex.org/W3147465052","https://openalex.org/W3199982239","https://openalex.org/W3210448484","https://openalex.org/W3211997524","https://openalex.org/W4205801500","https://openalex.org/W4220676041","https://openalex.org/W4293101040","https://openalex.org/W6656272246","https://openalex.org/W6803419640"],"related_works":["https://openalex.org/W2897693823","https://openalex.org/W2065521895","https://openalex.org/W1994251642","https://openalex.org/W3143559370","https://openalex.org/W4286214197","https://openalex.org/W2950740898","https://openalex.org/W4310579993","https://openalex.org/W2365255133","https://openalex.org/W1500715095","https://openalex.org/W1999703981"],"abstract_inverted_index":{"For":[0],"the":[1,4,11,20,25,51,58,73,83,95,102,110,120,124,132,137,141,157,178,181,185,190,201,205,212,221,229,235,241,248],"issues":[2],"of":[3,53,60,105,148,159,189,220,240],"ant":[5,34,125,242],"colony":[6,35,126,243],"algorithm":[7,36,143,163,192,223,231,244],"(ACO)":[8],"to":[9,71,93,117,153],"solving":[10],"problems":[12],"in":[13,28,57,123,131,140],"mobile":[14],"robot":[15],"path":[16,61,107,144,167,187,207,214,245],"planning,":[17,62,246],"such":[18],"as":[19],"slow":[21],"optimization":[22,40,216],"speed":[23,183,203,217],"and":[24,41,85,109,155,164,184,197,200,204,218,238,247],"redundant":[26],"paths":[27],"planning":[29,168,186,206],"results,":[30],"a":[31,63,78,114],"high-precision":[32],"improved":[33,194],"(IPACO)":[37],"with":[38,81,119,177],"fast":[39],"compound":[42],"prediction":[43,67],"mechanism":[44,90,116],"is":[45,69,91,129,250],"proposed.":[46],"Firstly,":[47],"aiming":[48],"at":[49],"maximizing":[50],"possibility":[52],"optimal":[54,65,213],"node":[55,66],"selection":[56],"process":[59,128],"composite":[64],"model":[68,80],"introduced":[70],"improve":[72,234],"state":[74],"transition":[75],"function.":[76],"Secondly,":[77],"pheromone":[79,97,103],"initialize":[82],"distribution":[84],"\u201creward":[86],"or":[87],"punishment\u201d":[88],"update":[89],"used":[92],"updates":[94],"global":[96],"concentration":[98,104],"directionally,":[99],"which":[100,135],"increases":[101],"excellent":[106],"nodes":[108],"heuristic":[111],"effect;":[112],"Finally,":[113],"prediction-backward":[115],"deal":[118],"\u201cdeadlock\u201d":[121],"problem":[122],"search":[127],"adopted":[130],"IPACO":[133,160,191,222,230],"algorithm,":[134,161,180],"enhance":[136],"success":[138],"rate":[139],"ACO":[142,162,179],"planning.":[145],"Five":[146],"groups":[147],"different":[149],"environments":[150],"are":[151,193,209,224],"selected":[152],"compare":[154],"verify":[156],"performance":[158],"three":[165],"typical":[166],"algorithms.":[169],"The":[170],"experimental":[171],"simulation":[172],"results":[173],"show":[174],"that,":[175],"compared":[176],"convergence":[182,202],"accuracy":[188,208],"by":[195],"57.69%":[196],"12.86%":[198],"respectively,":[199],"significantly":[210,251],"improved;":[211],"length,":[215],"stability":[219,239],"improved.":[225,252],"Which":[226],"verifies":[227],"that":[228],"can":[232],"effectively":[233],"environmental":[236],"compatibility":[237],"effect":[249]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}