{"id":"https://openalex.org/W2963020936","doi":"https://doi.org/10.3103/s0146411619030064","title":"Study on an Optimal Path Planning for a Robot Based on an Improved ANT Colony Algorithm","display_name":"Study on an Optimal Path Planning for a Robot Based on an Improved ANT Colony Algorithm","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2963020936","doi":"https://doi.org/10.3103/s0146411619030064","mag":"2963020936"},"language":"en","primary_location":{"id":"doi:10.3103/s0146411619030064","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411619030064","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","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/A5100383717","display_name":"Xiaojing Li","orcid":"https://orcid.org/0000-0003-3246-1277"},"institutions":[{"id":"https://openalex.org/I4210166499","display_name":"Henan Polytechnic University","ror":"https://ror.org/05vr1c885","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210166499"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiaojing Li","raw_affiliation_strings":["Mechanical Engineering Department, Henan Polytechnic Institute, 473009, Jiaozuo, Henan, P.R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mechanical Engineering Department, Henan Polytechnic Institute, 473009, Jiaozuo, Henan, P.R. China","institution_ids":["https://openalex.org/I4210166499"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102105853","display_name":"Yu Dongman","orcid":null},"institutions":[{"id":"https://openalex.org/I4210166499","display_name":"Henan Polytechnic University","ror":"https://ror.org/05vr1c885","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210166499"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dongman Yu","raw_affiliation_strings":["Mechanical Engineering Department, Henan Polytechnic Institute, 473009, Jiaozuo, Henan, P.R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mechanical Engineering Department, Henan Polytechnic Institute, 473009, Jiaozuo, Henan, P.R. China","institution_ids":["https://openalex.org/I4210166499"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100383717"],"corresponding_institution_ids":["https://openalex.org/I4210166499"],"apc_list":null,"apc_paid":null,"fwci":1.1232,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.82255852,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"53","issue":"3","first_page":"236","last_page":"243"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9180999994277954,"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.893204927444458},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7693279385566711},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.5710371732711792},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5677030086517334},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5435831546783447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5386163592338562},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4729345142841339},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47029706835746765},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.43232083320617676},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4264478087425232},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.42605385184288025},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.41484376788139343},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3544996380805969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11254549026489258},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08384391665458679}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.893204927444458},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7693279385566711},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.5710371732711792},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5677030086517334},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5435831546783447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5386163592338562},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4729345142841339},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47029706835746765},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.43232083320617676},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4264478087425232},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.42605385184288025},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.41484376788139343},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3544996380805969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11254549026489258},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08384391665458679},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3103/s0146411619030064","is_oa":false,"landing_page_url":"https://doi.org/10.3103/s0146411619030064","pdf_url":null,"source":{"id":"https://openalex.org/S17203304","display_name":"Automatic Control and Computer Sciences","issn_l":"0146-4116","issn":["0146-4116","1558-108X"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320267","host_organization_name":"Pleiades Publishing","host_organization_lineage":["https://openalex.org/P4310320267","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Pleiades Publishing","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Automatic Control and Computer Sciences","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":6,"referenced_works":["https://openalex.org/W1990402843","https://openalex.org/W2096030388","https://openalex.org/W2196839768","https://openalex.org/W2332075005","https://openalex.org/W2341147552","https://openalex.org/W2873373088"],"related_works":["https://openalex.org/W2347951034","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W2381829748","https://openalex.org/W2244460820","https://openalex.org/W2109336245","https://openalex.org/W2061313076","https://openalex.org/W2070079705","https://openalex.org/W2392795382"],"abstract_inverted_index":{"To":[0],"solve":[1],"the":[2,28,42,51,54,92,101,121,151,157,162,170,176,181,200],"path":[3,17,138,172,177],"planning":[4,18],"problems":[5],"of":[6,20,53,88,98,105],"rescuing":[7,21,140],"and":[8,22,46,65,72,85,95,103,111,126,174,192,209],"coal":[9,23,142],"exploring":[10,24,143],"robot":[11,25,144],"in":[12,145],"three-dimensional":[13,37],"space":[14,148],"environment,":[15],"a":[16,36,76,135,188],"method":[19,68],"based":[26],"on":[27,50],"improved":[29,73,127,163,182,201],"ant":[30,56,106,123,128,159,164,183,202],"colony":[31,57,107,124,129,160,165,184,203],"algorithm":[32,108,125,130,166,185,204],"was":[33,39,109],"proposed.":[34],"Firstly,":[35],"model":[38],"built":[40],"with":[41,113,156],"mountainous":[43],"elevation":[44],"data":[45],"grid":[47],"method.":[48],"Furthermore,":[49],"basis":[52],"traditional":[55,122,158],"algorithm,":[58,161],"node":[59,62,81],"transition":[60],"probability,":[61],"selection":[63,83],"way":[64],"pheromone":[66,89],"update":[67,86],"were":[69],"respectively":[70],"optimized":[71],"through":[74],"introducing":[75],"new":[77],"heuristic":[78],"function":[79],"factor,":[80],"random":[82],"mechanism":[84],"strategy":[87],"that":[90,120],"includes":[91],"local":[93],"updating":[94,97],"global":[96],"pheromone.":[99],"Finally,":[100],"feasibility":[102],"effectiveness":[104],"simulated":[110],"tested":[112],"MATLAB":[114],"software.":[115],"The":[116,196],"simulation":[117,197],"results":[118,198],"showed":[119,187],"both":[131],"could":[132,167],"search":[133],"out":[134],"security":[136],"optimal":[137],"for":[139],"&":[141],"three":[146],"dimensional":[147],"environment.":[149],"Under":[150],"different":[152],"task":[153],"requirements,":[154],"comparing":[155],"effectively":[168],"shorten":[169],"searching":[171,178],"length":[173],"reduce":[175],"time.":[179],"Moreover,":[180],"also":[186],"greater":[189],"decision-making":[190],"ability":[191],"better":[193],"convergence":[194],"performance.":[195],"indicated":[199],"should":[205],"be":[206],"correct,":[207],"feasible":[208],"effective.":[210]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4}],"updated_date":"2026-04-26T08:31:28.666265","created_date":"2025-10-10T00:00:00"}