{"id":"https://openalex.org/W7106012613","doi":"https://doi.org/10.1109/access.2025.3634800","title":"Efficient TSP-Based Task Group Allocation for Multi-Task Multi-Agent Pickup and Delivery","display_name":"Efficient TSP-Based Task Group Allocation for Multi-Task Multi-Agent Pickup and Delivery","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7106012613","doi":"https://doi.org/10.1109/access.2025.3634800"},"language":"en","primary_location":{"id":"doi:10.1109/access.2025.3634800","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3634800","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2025.3634800","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Seungbeen Lee","orcid":"https://orcid.org/0000-0002-1013-8228"},"institutions":[{"id":"https://openalex.org/I205490536","display_name":"Dongguk University","ror":"https://ror.org/057q6n778","country_code":"KR","type":"education","lineage":["https://openalex.org/I205490536"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seungbeen Lee","raw_affiliation_strings":["Department of Computer Science and Artificial Intelligence, Dongguk University, Seoul, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0002-1013-8228","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Artificial Intelligence, Dongguk University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I205490536"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Chanyoung Lee","orcid":"https://orcid.org/0009-0002-9267-8507"},"institutions":[{"id":"https://openalex.org/I205490536","display_name":"Dongguk University","ror":"https://ror.org/057q6n778","country_code":"KR","type":"education","lineage":["https://openalex.org/I205490536"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Chanyoung Lee","raw_affiliation_strings":["Department of Computer Science and Artificial Intelligence, Dongguk University, Seoul, Republic of Korea"],"raw_orcid":"https://orcid.org/0009-0002-9267-8507","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Artificial Intelligence, Dongguk University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I205490536"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Wonpil Yu","orcid":"https://orcid.org/0000-0001-5729-7931"},"institutions":[{"id":"https://openalex.org/I142401562","display_name":"Electronics and Telecommunications Research Institute","ror":"https://ror.org/03ysstz10","country_code":"KR","type":"facility","lineage":["https://openalex.org/I142401562","https://openalex.org/I2801339556","https://openalex.org/I4210144908","https://openalex.org/I4387152098"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Wonpil Yu","raw_affiliation_strings":["Artificial Intelligence Creative Research Laboratory, ETRI, Daejeon, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0001-5729-7931","affiliations":[{"raw_affiliation_string":"Artificial Intelligence Creative Research Laboratory, ETRI, Daejeon, Republic of Korea","institution_ids":["https://openalex.org/I142401562"]}]},{"author_position":"last","author":{"id":null,"display_name":"Soohwan Song","orcid":"https://orcid.org/0000-0003-2145-1161"},"institutions":[{"id":"https://openalex.org/I205490536","display_name":"Dongguk University","ror":"https://ror.org/057q6n778","country_code":"KR","type":"education","lineage":["https://openalex.org/I205490536"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Soohwan Song","raw_affiliation_strings":["Department of Computer Science and Artificial Intelligence, Dongguk University, Seoul, Republic of Korea"],"raw_orcid":"https://orcid.org/0000-0003-2145-1161","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Artificial Intelligence, Dongguk University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I205490536"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.52130044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"13","issue":null,"first_page":"198748","last_page":"198761"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.4357999861240387,"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.4357999861240387,"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.23149999976158142,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.08420000225305557,"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/task","display_name":"Task (project management)","score":0.7562000155448914},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6934999823570251},{"id":"https://openalex.org/keywords/pickup","display_name":"Pickup","score":0.6467000246047974},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.542900025844574},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5230000019073486},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5206000208854675},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.45019999146461487},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.42669999599456787},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.37790000438690186}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.828000009059906},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.7562000155448914},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6934999823570251},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.6467000246047974},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.542900025844574},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5230000019073486},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5206000208854675},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.45019999146461487},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4307999908924103},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.42669999599456787},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.37790000438690186},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.3695000112056732},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3686000108718872},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3596999943256378},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.3012999892234802},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C2780609101","wikidata":"https://www.wikidata.org/wiki/Q17156588","display_name":"Resource management (computing)","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.2890999913215637},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.27799999713897705},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.2700999975204468},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2558000087738037},{"id":"https://openalex.org/C181889124","wikidata":"https://www.wikidata.org/wiki/Q380204","display_name":"Service level","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2025.3634800","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3634800","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:6d4e2e477e9a4d0caf7b5199df9aa7c3","is_oa":true,"landing_page_url":"https://doaj.org/article/6d4e2e477e9a4d0caf7b5199df9aa7c3","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":"IEEE Access, Vol 13, Pp 198748-198761 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2025.3634800","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2025.3634800","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,51,101],"study":[1],"addresses":[2],"the":[3,27,93,98,109,130,135],"multi-agent":[4],"pickup":[5],"and":[6,14,37],"delivery":[7],"(MAPD)":[8],"problem,":[9],"which":[10],"involves":[11,57],"assigning":[12],"tasks":[13,42,70,91,115],"planning":[15],"paths":[16,96],"for":[17,114],"multiple":[18,35,41],"robots":[19,38],"to":[20,46],"transport":[21],"goods.":[22],"Specifically,":[23],"we":[24,81,119],"focus":[25],"on":[26,134,148],"multi-task":[28],"MAPD":[29],"where":[30],"each":[31],"task":[32,66,85,106],"consists":[33],"of":[34,63,138,143],"targets,":[36],"are":[39,72],"assigned":[40],"within":[43],"a":[44,83,161],"budget":[45],"deliver":[47],"in":[48,164],"one":[49],"trip.":[50],"problem":[52],"is":[53],"challenging":[54],"because":[55],"it":[56],"considering":[58],"an":[59,77,125],"optimal":[60],"visitation":[61,136],"sequence":[62,137],"targets":[64,141],"during":[65],"assignment.":[67],"Additionally,":[68,118],"managing":[69],"that":[71,88,105,152],"continuously":[73],"released":[74,116],"online":[75,126],"demands":[76],"efficient":[78,111],"algorithm.":[79,100],"Therefore,":[80],"propose":[82],"new":[84,140],"allocation":[86],"method":[87,102,154],"iteratively":[89],"identifies":[90],"with":[92],"shortest":[94],"detour":[95],"using":[97],"TSP":[99],"consistently":[103],"ensures":[104],"groups":[107],"have":[108],"most":[110],"travel":[112],"routes":[113],"online.":[117],"boost":[120],"computational":[121],"efficiency":[122],"by":[123,132],"addressing":[124],"TSP,":[127],"speeding":[128],"up":[129],"computation":[131],"focusing":[133],"only":[139],"instead":[142],"all":[144],"targets.":[145],"Extensive":[146],"experiments":[147],"benchmark":[149],"scenarios":[150],"demonstrate":[151],"our":[153],"outperforms":[155],"existing":[156],"state-of-the-art":[157],"approaches,":[158],"achieving":[159],"over":[160],"45%":[162],"reduction":[163],"service":[165],"time.":[166]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-19T00:00:00"}