{"id":"https://openalex.org/W4378575239","doi":"https://doi.org/10.3390/axioms12060525","title":"Application of Ant Colony Optimization Algorithm Based on Triangle Inequality Principle and Partition Method Strategy in Robot Path Planning","display_name":"Application of Ant Colony Optimization Algorithm Based on Triangle Inequality Principle and Partition Method Strategy in Robot Path Planning","publication_year":2023,"publication_date":"2023-05-27","ids":{"openalex":"https://openalex.org/W4378575239","doi":"https://doi.org/10.3390/axioms12060525"},"language":"en","primary_location":{"id":"doi:10.3390/axioms12060525","is_oa":true,"landing_page_url":"https://doi.org/10.3390/axioms12060525","pdf_url":"https://www.mdpi.com/2075-1680/12/6/525/pdf?version=1685688685","source":{"id":"https://openalex.org/S4210173132","display_name":"Axioms","issn_l":"2075-1680","issn":["2075-1680"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Axioms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/2075-1680/12/6/525/pdf?version=1685688685","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101874714","display_name":"Shuai Wu","orcid":"https://orcid.org/0009-0007-5824-6846"},"institutions":[{"id":"https://openalex.org/I2799850029","display_name":"Dongguan University of Technology","ror":"https://ror.org/01m8p7q42","country_code":"CN","type":"education","lineage":["https://openalex.org/I2799850029"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuai Wu","raw_affiliation_strings":["School of Computer Science and Technology, Dongguan University of Technology, Dongguan 523808, China"],"raw_orcid":"https://orcid.org/0009-0007-5824-6846","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Dongguan University of Technology, Dongguan 523808, China","institution_ids":["https://openalex.org/I2799850029"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101603927","display_name":"Qingxia Li","orcid":"https://orcid.org/0009-0007-8514-2209"},"institutions":[{"id":"https://openalex.org/I4210124427","display_name":"City College of Dongguan University of Technology","ror":"https://ror.org/02vdh2x09","country_code":"CN","type":"education","lineage":["https://openalex.org/I2799850029","https://openalex.org/I4210124427"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qingxia Li","raw_affiliation_strings":["School of Computer and Information, Dongguan City College, Dongguan 523419, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer and Information, Dongguan City College, Dongguan 523419, China","institution_ids":["https://openalex.org/I4210124427"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062578677","display_name":"Wenhong Wei","orcid":"https://orcid.org/0000-0002-0881-459X"},"institutions":[{"id":"https://openalex.org/I2799850029","display_name":"Dongguan University of Technology","ror":"https://ror.org/01m8p7q42","country_code":"CN","type":"education","lineage":["https://openalex.org/I2799850029"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wenhong Wei","raw_affiliation_strings":["School of Computer Science and Technology, Dongguan University of Technology, Dongguan 523808, China"],"raw_orcid":"https://orcid.org/0000-0002-0881-459X","affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Dongguan University of Technology, Dongguan 523808, China","institution_ids":["https://openalex.org/I2799850029"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5062578677"],"corresponding_institution_ids":["https://openalex.org/I2799850029"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.5629,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.85164871,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"12","issue":"6","first_page":"525","last_page":"525"},"is_retracted":false,"is_paratext":false,"is_xpac":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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9908000230789185,"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/T12288","display_name":"Optimization and Search Problems","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7172877192497253},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5916504263877869},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5830839276313782},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5759334564208984},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5448907613754272},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.45499947667121887},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.45499712228775024},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.44358983635902405},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.431831032037735},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4297027885913849},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.41691720485687256},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30093497037887573},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19068309664726257},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.0775165855884552}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7172877192497253},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5916504263877869},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5830839276313782},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5759334564208984},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5448907613754272},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.45499947667121887},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.45499712228775024},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.44358983635902405},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.431831032037735},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4297027885913849},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.41691720485687256},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30093497037887573},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19068309664726257},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0775165855884552},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/axioms12060525","is_oa":true,"landing_page_url":"https://doi.org/10.3390/axioms12060525","pdf_url":"https://www.mdpi.com/2075-1680/12/6/525/pdf?version=1685688685","source":{"id":"https://openalex.org/S4210173132","display_name":"Axioms","issn_l":"2075-1680","issn":["2075-1680"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Axioms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:08295b8dd72c4681a6465d7bfad7b1d3","is_oa":true,"landing_page_url":"https://doaj.org/article/08295b8dd72c4681a6465d7bfad7b1d3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Axioms, Vol 12, Iss 6, p 525 (2023)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/2075-1680/12/6/525/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/axioms12060525","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Axioms; Volume 12; Issue 6; Pages: 525","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/axioms12060525","is_oa":true,"landing_page_url":"https://doi.org/10.3390/axioms12060525","pdf_url":"https://www.mdpi.com/2075-1680/12/6/525/pdf?version=1685688685","source":{"id":"https://openalex.org/S4210173132","display_name":"Axioms","issn_l":"2075-1680","issn":["2075-1680"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Axioms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4378575239.pdf"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W1994164464","https://openalex.org/W2037254789","https://openalex.org/W2169528473","https://openalex.org/W2341882575","https://openalex.org/W2347348084","https://openalex.org/W2350455978","https://openalex.org/W2394294774","https://openalex.org/W2417637069","https://openalex.org/W2515498963","https://openalex.org/W2604760770","https://openalex.org/W2799726513","https://openalex.org/W2883776918","https://openalex.org/W2895647709","https://openalex.org/W2914554382","https://openalex.org/W2938380935","https://openalex.org/W2939018330","https://openalex.org/W2963020936","https://openalex.org/W2979454253","https://openalex.org/W2994888514","https://openalex.org/W2997061791","https://openalex.org/W3013773102","https://openalex.org/W3018311626","https://openalex.org/W3020990685","https://openalex.org/W3022788820","https://openalex.org/W3045728165","https://openalex.org/W3082345457","https://openalex.org/W3090845105","https://openalex.org/W3094467512","https://openalex.org/W3094917946","https://openalex.org/W3126326857","https://openalex.org/W3135798356","https://openalex.org/W3176039641","https://openalex.org/W3198400168","https://openalex.org/W3206987089","https://openalex.org/W3214031934","https://openalex.org/W4200589899","https://openalex.org/W4210874848","https://openalex.org/W4226503583","https://openalex.org/W4229622957","https://openalex.org/W4289655638","https://openalex.org/W4291898573","https://openalex.org/W4292883535","https://openalex.org/W4313341134","https://openalex.org/W6784911131","https://openalex.org/W6811745018"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2353880500","https://openalex.org/W2553274123","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W1904098742"],"abstract_inverted_index":{"Path":[0],"planning":[1,33,198],"is":[2,16,61,187],"an":[3,55],"important":[4],"area":[5],"of":[6,34,74,87,97,134,145,181,248,263,278],"mobile":[7,35],"robot":[8,196],"research,":[9],"and":[10,48,77,90,95,115,131,142,204,211,214,233,256],"the":[11,23,31,67,72,85,92,98,110,119,127,135,140,146,149,153,168,172,179,182,185,195,215,220,237,240,252,257,261,264,276,279],"ant":[12,25,57],"colony":[13,26,58],"optimization":[14,27,59],"algorithm":[15,28,60,136,147,186,210,223,238,281],"essential":[17],"for":[18,193],"analyzing":[19],"path":[20,32,197,231,242,266,283],"planning.":[21,284],"However,":[22],"current":[24],"applied":[29],"to":[30,83,166,170,177],"robots":[36],"still":[37],"has":[38],"some":[39],"limitations,":[40],"including":[41,200],"early":[42],"blind":[43],"search,":[44],"slow":[45],"convergence":[46,132,255],"speed,":[47],"more":[49],"turns.":[50],"To":[51,151],"overcome":[52],"these":[53],"problems,":[54],"improved":[56,68,221],"proposed":[62,183,280],"in":[63,260,267,282],"this":[64],"paper.":[65],"In":[66,100],"algorithm,":[69,184],"we":[70,102,161],"introduce":[71,162],"idea":[73],"triangle":[75],"inequality":[76],"a":[78,104,158,163,245],"pseudo-random":[79],"state":[80],"transfer":[81],"strategy":[82,107],"enhance":[84],"guidance":[86],"target":[88],"points":[89],"improve":[91,126],"search":[93,129],"efficiency":[94],"quality":[96],"algorithm.":[99],"addition,":[101],"propose":[103],"pheromone":[105,120],"update":[106],"based":[108],"on":[109,118],"partition":[111],"method":[112],"with":[113,189,227,244],"upper":[114],"lower":[116],"limits":[117],"concentration.":[121],"This":[122],"can":[123,224],"not":[124],"only":[125],"global":[128],"capability":[130],"speed":[133],"but":[137],"also":[138],"avoid":[139],"premature":[141],"stagnation":[143],"phenomenon":[144],"during":[148],"search.":[150],"prevent":[152],"ants":[154,169],"from":[155],"getting":[156],"into":[157],"deadlock":[159],"state,":[160],"backtracking":[164],"mechanism":[165],"enable":[167],"explore":[171],"solution":[173],"space":[174],"better.":[175],"Finally,":[176],"verify":[178],"effectiveness":[180,277],"compared":[188],"11":[190],"existing":[191],"methods":[192],"solving":[194],"problem,":[199],"several":[201],"ACO":[202,222],"variants":[203],"two":[205],"commonly":[206],"used":[207],"algorithms":[208],"(A*":[209],"Dijkstra":[212],"algorithm),":[213],"experimental":[216,273],"results":[217,274],"show":[218],"that":[219],"plan":[225],"paths":[226],"faster":[228],"convergence,":[229],"shorter":[230],"lengths,":[232],"higher":[234],"smoothness.":[235],"Specifically,":[236],"produces":[239],"shortest":[241,265],"length":[243],"standard":[246],"deviation":[247],"zero":[249],"while":[250],"ensuring":[251],"most":[253],"rapid":[254],"highest":[258],"smoothness":[259],"case":[262],"four":[268],"different":[269],"grid":[270],"environments.":[271],"These":[272],"demonstrate":[275]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2}],"updated_date":"2026-06-18T10:00:31.954636","created_date":"2023-05-28T00:00:00"}