{"id":"https://openalex.org/W7125957818","doi":"https://doi.org/10.1109/smc58881.2025.11342700","title":"Conflict-Free Multi-Agent Path Generation Using Ant Colony Optimization with Load Balancing","display_name":"Conflict-Free Multi-Agent Path Generation Using Ant Colony Optimization with Load Balancing","publication_year":2025,"publication_date":"2025-10-05","ids":{"openalex":"https://openalex.org/W7125957818","doi":"https://doi.org/10.1109/smc58881.2025.11342700"},"language":null,"primary_location":{"id":"doi:10.1109/smc58881.2025.11342700","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc58881.2025.11342700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-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/A5124114289","display_name":"Ryusuke Kazama","orcid":null},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Ryusuke Kazama","raw_affiliation_strings":["Waseda University,Department of Computer Science and Communications Engineering,Tokyo,Japan,1698555"],"affiliations":[{"raw_affiliation_string":"Waseda University,Department of Computer Science and Communications Engineering,Tokyo,Japan,1698555","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123055547","display_name":"Toshiharu Sugawara","orcid":null},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Toshiharu Sugawara","raw_affiliation_strings":["Waseda University,Department of Computer Science and Communications Engineering,Tokyo,Japan,1698555"],"affiliations":[{"raw_affiliation_string":"Waseda University,Department of Computer Science and Communications Engineering,Tokyo,Japan,1698555","institution_ids":["https://openalex.org/I150744194"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5124114289"],"corresponding_institution_ids":["https://openalex.org/I150744194"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.73024817,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"448","last_page":"455"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9172000288963318,"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.9172000288963318,"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.022700000554323196,"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/T10524","display_name":"Traffic control and management","score":0.007199999876320362,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.7677000164985657},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5799000263214111},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5710999965667725},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.4973999857902527},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.423799991607666},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.3677999973297119},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.3474000096321106}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7677000164985657},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7062000036239624},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5799000263214111},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5710999965667725},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49779999256134033},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.4973999857902527},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.423799991607666},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.3677999973297119},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.3474000096321106},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.33550000190734863},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.32690000534057617},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.32010000944137573},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.27959999442100525},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.27000001072883606},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26820001006126404},{"id":"https://openalex.org/C2776068756","wikidata":"https://www.wikidata.org/wiki/Q1368584","display_name":"Automated guided vehicle","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.262800008058548},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/smc58881.2025.11342700","is_oa":false,"landing_page_url":"https://doi.org/10.1109/smc58881.2025.11342700","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7109349966049194}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1484061085","https://openalex.org/W1989407213","https://openalex.org/W2541273873","https://openalex.org/W2807235854","https://openalex.org/W2911331240","https://openalex.org/W2914864020","https://openalex.org/W2955824288","https://openalex.org/W3007476780","https://openalex.org/W3009814483","https://openalex.org/W3012189842","https://openalex.org/W3018311626","https://openalex.org/W3042039801","https://openalex.org/W3091492359","https://openalex.org/W3106704922","https://openalex.org/W4292083457","https://openalex.org/W4379386147","https://openalex.org/W4410087277","https://openalex.org/W7124240269","https://openalex.org/W7124267257","https://openalex.org/W7124280165"],"related_works":[],"abstract_inverted_index":{"We":[0],"propose":[1,104],"a":[2,105,126],"method":[3,76,109,129,149],"using":[4],"ant":[5],"colony":[6],"optimization":[7],"(ACO)":[8],"with":[9,35,57],"load-balancing":[10,128],"techniques":[11],"for":[12,55,110,119,137],"multi-agent":[13],"path":[14,141],"finding":[15],"problems.":[16],"In":[17],"automated":[18,24],"warehouses":[19],"and":[20,64,99],"manufacturing":[21],"facilities,":[22],"multiple":[23],"guided":[25],"vehicles":[26],"(AGVs)":[27],"must":[28],"efficiently":[29],"perform":[30],"transportation":[31],"tasks":[32],"without":[33,154],"colliding":[34],"obstacles":[36],"or":[37,122],"other":[38,120],"agents.":[39],"Although":[40],"several":[41],"metaheuristic":[42],"approaches,":[43],"including":[44],"ACO-based":[45,81],"methods,":[46],"address":[47],"this":[48],"challenge,":[49],"conventional":[50,80],"methods":[51],"do":[52],"not":[53],"account":[54],"scenarios":[56],"many":[58],"agents,":[59],"and/or":[60],"the":[61,69,92,96,132,147],"planning":[62],"efficiency":[63],"quality":[65],"significantly":[66],"decrease":[67],"as":[68],"number":[70],"of":[71],"agents":[72,112,121],"increases.":[73],"The":[74],"proposed":[75,136,148],"is":[77,135],"inspired":[78],"by":[79,94,113],"approaches":[82],"but":[83],"differs":[84],"in":[85,159],"three":[86],"aspects.":[87],"First,":[88],"we":[89,103],"carefully":[90],"define":[91],"collisions":[93],"considering":[95],"agent":[97],"size":[98],"travel":[100],"time.":[101],"Second,":[102],"tailored":[106],"collision":[107],"avoidance":[108],"numerous":[111],"determining":[114],"whether":[115],"they":[116],"should":[117],"wait":[118],"generate":[123],"detours.":[124],"Finally,":[125],"directional":[127],"that":[130,146],"considers":[131],"movement":[133],"direction":[134],"more":[138],"effective":[139],"ACO":[140],"generation.":[142],"Our":[143],"experiments":[144],"demonstrate":[145],"generates":[150],"superior":[151],"coordinated":[152],"paths":[153],"increasing":[155],"CPU":[156],"time,":[157],"even":[158],"high-density":[160],"environments.":[161]},"counts_by_year":[],"updated_date":"2026-02-23T20:09:44.859080","created_date":"2026-01-29T00:00:00"}