{"id":"https://openalex.org/W4416381441","doi":"https://doi.org/10.1109/lra.2025.3632724","title":"A Multi-View Attention-Based Encoder-Decoder Framework for Clustered Traveling Salesman Problem","display_name":"A Multi-View Attention-Based Encoder-Decoder Framework for Clustered Traveling Salesman Problem","publication_year":2025,"publication_date":"2025-11-14","ids":{"openalex":"https://openalex.org/W4416381441","doi":"https://doi.org/10.1109/lra.2025.3632724"},"language":null,"primary_location":{"id":"doi:10.1109/lra.2025.3632724","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3632724","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","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/A5081513081","display_name":"Jimin Park","orcid":"https://orcid.org/0000-0002-7935-4340"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jimin Park","raw_affiliation_strings":["Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112432289","display_name":"Inchang Choi","orcid":"https://orcid.org/0009-0001-8931-9768"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Inguk Choi","raw_affiliation_strings":["Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea"],"raw_orcid":"https://orcid.org/0009-0001-8931-9768","affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100439521","display_name":"Hyun-Jung Kim","orcid":"https://orcid.org/0000-0001-7190-3264"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyun-Jung Kim","raw_affiliation_strings":["Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea"],"raw_orcid":"https://orcid.org/0000-0001-7190-3264","affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31015214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"1","first_page":"137","last_page":"144"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.3433000147342682,"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.3433000147342682,"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.32679998874664307,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.04639999940991402,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6341000199317932},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5315999984741211},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5015000104904175},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.42809998989105225},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4172999858856201},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.3815999925136566},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.37619999051094055},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3686999976634979}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6488999724388123},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6341000199317932},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5315999984741211},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5015000104904175},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5005000233650208},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.42809998989105225},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4172999858856201},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.3815999925136566},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.37619999051094055},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3686999976634979},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36010000109672546},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.34880000352859497},{"id":"https://openalex.org/C185874996","wikidata":"https://www.wikidata.org/wiki/Q269699","display_name":"Interdependence","level":2,"score":0.3409000039100647},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.33889999985694885},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.3328000009059906},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.32760000228881836},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.3084000051021576},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3057999908924103},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.2784999907016754},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.2759999930858612},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.2757999897003174},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C2776854237","wikidata":"https://www.wikidata.org/wiki/Q6031064","display_name":"Information sharing","level":2,"score":0.27140000462532043}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2025.3632724","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3632724","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4223175822","display_name":null,"funder_award_id":"IITP-2025-RS-2024-00437268","funder_id":"https://openalex.org/F4320328359","funder_display_name":"Ministry of Science and ICT, South Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"},{"id":"https://openalex.org/F4320328359","display_name":"Ministry of Science and ICT, South Korea","ror":"https://ror.org/01wpjm123"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1966981470","https://openalex.org/W1978101274","https://openalex.org/W2009276309","https://openalex.org/W2012316301","https://openalex.org/W2051579561","https://openalex.org/W2080894457","https://openalex.org/W2163428398","https://openalex.org/W2194775991","https://openalex.org/W2775332123","https://openalex.org/W2895987294","https://openalex.org/W2968986602","https://openalex.org/W2989857233","https://openalex.org/W4251562322","https://openalex.org/W4290849813","https://openalex.org/W4382237551","https://openalex.org/W4384831806","https://openalex.org/W4385245566","https://openalex.org/W4387143424","https://openalex.org/W4390492561","https://openalex.org/W4401416177","https://openalex.org/W4401863699","https://openalex.org/W4406857017"],"related_works":[],"abstract_inverted_index":{"Many":[0],"autonomous":[1],"mobile":[2],"robot":[3,129],"path":[4],"planning":[5],"scenarios":[6],"require":[7],"servicing":[8],"grouped":[9],"delivery":[10],"points.":[11],"Such":[12],"clustered":[13,21],"routing":[14,33,44,97,120],"problems":[15],"are":[16],"naturally":[17],"formulated":[18],"as":[19],"the":[20,36,123,127],"traveling":[22],"salesman":[23],"problem":[24,151],"(CluTSP),":[25],"which":[26,58],"comprises":[27],"two":[28],"interdependent":[29],"subproblems:":[30],"global":[31,69,117,133],"inter-cluster":[32],"to":[34,45,60,64,90],"determine":[35],"order":[37],"of":[38],"cluster":[39],"visits":[40],"and":[41,70,73,94,118,122,137,163],"local":[42,71,119],"intra-cluster":[43],"optimize":[46],"paths":[47],"within":[48],"each":[49,150],"cluster.":[50],"Existing":[51],"approaches":[52],"often":[53],"solve":[54],"these":[55,80],"subproblems":[56,143],"separately,":[57],"leads":[59],"suboptimal":[61],"solutions":[62],"due":[63],"limited":[65],"information":[66],"sharing":[67],"between":[68],"decisions":[72],"requires":[74],"long":[75],"computation":[76],"times.":[77],"To":[78],"address":[79],"limitations,":[81],"we":[82],"propose":[83],"a":[84,92,101,132],"unified":[85,145],"deep":[86],"reinforcement":[87],"learning":[88],"framework":[89],"obtain":[91],"powerful":[93],"flexible":[95],"CluTSP":[96],"agent":[98],"based":[99],"on":[100],"novel":[102,136],"multi-view":[103],"attention-based":[104],"encoder-decoder":[105],"framework.":[106],"Our":[107,135],"graph":[108],"neural":[109],"network-based":[110],"dual":[111],"encoder":[112],"structure":[113],"effectively":[114],"captures":[115],"both":[116,142],"contexts,":[121],"collaborative":[124],"decoder":[125],"generates":[126],"overall":[128],"trajectory":[130],"from":[131],"perspective.":[134],"efficient":[138],"architecture":[139],"enables":[140],"solving":[141],"via":[144],"one-shot":[146],"construction":[147],"without":[148],"addressing":[149],"separately.":[152],"Extensive":[153],"experiments":[154],"demonstrate":[155],"that":[156],"our":[157],"approach":[158],"significantly":[159],"outperforms":[160],"existing":[161],"decomposition-based":[162],"learning-based":[164],"methods.":[165]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-14T00:00:00"}