{"id":"https://openalex.org/W4414683417","doi":"https://doi.org/10.1017/s0263574725102610","title":"Research on mobile robot path planning based on multi-strategy improved ant colony algorithm","display_name":"Research on mobile robot path planning based on multi-strategy improved ant colony algorithm","publication_year":2025,"publication_date":"2025-10-01","ids":{"openalex":"https://openalex.org/W4414683417","doi":"https://doi.org/10.1017/s0263574725102610"},"language":"en","primary_location":{"id":"doi:10.1017/s0263574725102610","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574725102610","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","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/A5109279958","display_name":"Xinghua Wang","orcid":"https://orcid.org/0009-0001-2466-8510"},"institutions":[{"id":"https://openalex.org/I67001856","display_name":"Shanghai Institute of Technology","ror":"https://ror.org/00fjzqj15","country_code":"CN","type":"education","lineage":["https://openalex.org/I67001856"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xinghua Wang","raw_affiliation_strings":["Shanghai Institute of Technology"],"raw_orcid":"https://orcid.org/0009-0001-2466-8510","affiliations":[{"raw_affiliation_string":"Shanghai Institute of Technology","institution_ids":["https://openalex.org/I67001856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013791499","display_name":"Jie Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I67001856","display_name":"Shanghai Institute of Technology","ror":"https://ror.org/00fjzqj15","country_code":"CN","type":"education","lineage":["https://openalex.org/I67001856"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jie Wang","raw_affiliation_strings":["Shanghai Institute of Technology"],"raw_orcid":"https://orcid.org/0009-0008-6675-8830","affiliations":[{"raw_affiliation_string":"Shanghai Institute of Technology","institution_ids":["https://openalex.org/I67001856"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101310460","display_name":"Jiawen Cao","orcid":null},"institutions":[{"id":"https://openalex.org/I67001856","display_name":"Shanghai Institute of Technology","ror":"https://ror.org/00fjzqj15","country_code":"CN","type":"education","lineage":["https://openalex.org/I67001856"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiawen Cao","raw_affiliation_strings":["Shanghai Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Institute of Technology","institution_ids":["https://openalex.org/I67001856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048712226","display_name":"Ruijin Sun","orcid":"https://orcid.org/0000-0002-4403-9893"},"institutions":[{"id":"https://openalex.org/I67001856","display_name":"Shanghai Institute of Technology","ror":"https://ror.org/00fjzqj15","country_code":"CN","type":"education","lineage":["https://openalex.org/I67001856"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ruijin Sun","raw_affiliation_strings":["Shanghai Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Institute of Technology","institution_ids":["https://openalex.org/I67001856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I67001856"],"apc_list":null,"apc_paid":null,"fwci":0.7655,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.75544426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"43","issue":"10","first_page":"3594","last_page":"3614"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9976000189781189,"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.9976000189781189,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9488999843597412,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.946399986743927,"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.8240000009536743},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6486999988555908},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5346999764442444},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.525600016117096},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.513700008392334},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4781000018119812},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4569999873638153},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.3750999867916107}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8240000009536743},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6486999988555908},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5954999923706055},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5358999967575073},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5346999764442444},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.525600016117096},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.513700008392334},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4781000018119812},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4569999873638153},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.43459999561309814},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.3750999867916107},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.36880001425743103},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C2777328355","wikidata":"https://www.wikidata.org/wiki/Q167377","display_name":"Pheromone","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.2687999904155731},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.26460000872612},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2596000134944916},{"id":"https://openalex.org/C2986897749","wikidata":"https://www.wikidata.org/wiki/Q231761","display_name":"Potential field","level":2,"score":0.25429999828338623},{"id":"https://openalex.org/C143587482","wikidata":"https://www.wikidata.org/wiki/Q1543216","display_name":"Iterative and incremental development","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0263574725102610","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574725102610","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W2026535857","https://openalex.org/W2028559543","https://openalex.org/W2062593759","https://openalex.org/W2099822944","https://openalex.org/W2614449343","https://openalex.org/W2770649262","https://openalex.org/W3204436086","https://openalex.org/W3217411657","https://openalex.org/W4281687867","https://openalex.org/W4291898573","https://openalex.org/W4319723771","https://openalex.org/W4379471017","https://openalex.org/W4389149165","https://openalex.org/W4392469836","https://openalex.org/W4397042089"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Aiming":[1],"at":[2],"the":[3,48,53,58,106,113,127,158,163],"issues":[4],"of":[5,41,116,129,162],"traditional":[6,130],"ant":[7,33,117],"colony":[8,34,118],"algorithm":[9,35],"(ACO)":[10],"in":[11,141,146],"mobile":[12],"robot":[13],"path":[14,71,142],"planning,":[15],"including":[16],"initial":[17,42],"search":[18,66],"blindness,":[19],"susceptibility":[20],"to":[21,63,154],"local":[22],"optima,":[23],"and":[24,100,149,160],"slow":[25],"convergence,":[26],"this":[27],"paper":[28],"proposes":[29],"a":[30,138],"multi-strategy":[31],"improved":[32,75],"(MS-ACO).":[36],"Firstly,":[37],"dynamic":[38,91],"non-uniform":[39],"distribution":[40],"pheromones":[43],"is":[44,61,79,94],"implemented":[45],"by":[46,81],"integrating":[47],"repulsive":[49],"field":[50,55],"from":[51],"artificial":[52],"potential":[54],"method.":[56],"Secondly,":[57],"heuristic":[59],"information":[60],"enhanced":[62],"improve":[64],"global":[65],"capability":[67],"while":[68],"constraining":[69],"unnecessary":[70],"turns.":[72],"Thirdly,":[73],"an":[74],"pheromone":[76,107],"update":[77,108],"strategy":[78],"developed":[80],"adopting":[82],"distinct":[83],"updating":[84],"mechanisms":[85],"for":[86],"different":[87],"evolutionary":[88],"phases.":[89],"Finally,":[90],"parameter":[92],"adaptation":[93],"achieved":[95],"through":[96],"optimized":[97],"weight":[98],"coefficients":[99,102],"volatility":[101],"that":[103,123],"coordinate":[104],"with":[105,112],"strategy,":[109],"better":[110],"aligning":[111],"iterative":[114],"characteristics":[115],"optimization.":[119],"Experimental":[120],"results":[121],"demonstrate":[122],"MS-ACO":[124],"effectively":[125],"addresses":[126],"limitations":[128],"ACO.":[131],"Under":[132],"identical":[133],"experimental":[134],"conditions,":[135],"it":[136],"achieves":[137],"30.4%":[139],"reduction":[140],"length,":[143],"37.8%":[144],"decrease":[145],"pathfinding":[147],"time,":[148],"71%":[150],"fewer":[151],"turns":[152],"compared":[153],"conventional":[155],"methods,":[156],"verifying":[157],"feasibility":[159],"superiority":[161],"proposed":[164],"algorithm.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}