{"id":"https://openalex.org/W7104587265","doi":"https://doi.org/10.1109/lra.2025.3630971","title":"Hierarchical Planning for Vehicle Routing and Scheduling in Marsupial Robotic Systems","display_name":"Hierarchical Planning for Vehicle Routing and Scheduling in Marsupial Robotic Systems","publication_year":2025,"publication_date":"2025-11-10","ids":{"openalex":"https://openalex.org/W7104587265","doi":"https://doi.org/10.1109/lra.2025.3630971"},"language":null,"primary_location":{"id":"doi:10.1109/lra.2025.3630971","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3630971","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":null,"display_name":"Donghyun Kim","orcid":"https://orcid.org/0009-0007-6213-1785"},"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":"Donghyun Kim","raw_affiliation_strings":["Department of Mechanical Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea"],"raw_orcid":"https://orcid.org/0009-0007-6213-1785","affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":null,"display_name":"Jinwhan Kim","orcid":"https://orcid.org/0000-0001-6886-2449"},"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":"Jinwhan Kim","raw_affiliation_strings":["Department of Mechanical Engineering, KAIST (Korea Advanced Institute of Science and Technology), Daejeon, South Korea"],"raw_orcid":"https://orcid.org/0000-0001-6886-2449","affiliations":[{"raw_affiliation_string":"Department of Mechanical 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":2,"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.51651216,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"1","first_page":"362","last_page":"369"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.5194000005722046,"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.5194000005722046,"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/T11622","display_name":"Maritime Navigation and Safety","score":0.14470000565052032,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/T11192","display_name":"Underwater Vehicles and Communication Systems","score":0.11379999667406082,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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/scheduling","display_name":"Scheduling (production processes)","score":0.6678000092506409},{"id":"https://openalex.org/keywords/automated-planning-and-scheduling","display_name":"Automated planning and scheduling","score":0.5871999859809875},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4961000084877014},{"id":"https://openalex.org/keywords/route-planning","display_name":"Route planning","score":0.4828999936580658},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.4699999988079071},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.44850000739097595},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4440000057220459},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.39160001277923584}],"concepts":[{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6678000092506409},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6025999784469604},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.5871999859809875},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4961000084877014},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.4828999936580658},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4699999988079071},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.44850000739097595},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4440000057220459},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4212000072002411},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.39160001277923584},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.3846000134944916},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.3264999985694885},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.31839999556541443},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.3041999936103821},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.26980000734329224},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C2780440489","wikidata":"https://www.wikidata.org/wiki/Q5227278","display_name":"Data-driven","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.250900000333786}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2025.3630971","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3630971","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/G2919495081","display_name":null,"funder_award_id":"2020M3C1C1A02086308","funder_id":"https://openalex.org/F4320328359","funder_display_name":"Ministry of Science and ICT, South Korea"}],"funders":[{"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":28,"referenced_works":["https://openalex.org/W1528314256","https://openalex.org/W1972391046","https://openalex.org/W2119709400","https://openalex.org/W2128543820","https://openalex.org/W2148900824","https://openalex.org/W2158703410","https://openalex.org/W2159061314","https://openalex.org/W2408150663","https://openalex.org/W2517828448","https://openalex.org/W2562123759","https://openalex.org/W2617547828","https://openalex.org/W2781538372","https://openalex.org/W3006118211","https://openalex.org/W3036205701","https://openalex.org/W3085644258","https://openalex.org/W3156295478","https://openalex.org/W4210879033","https://openalex.org/W4213123848","https://openalex.org/W4246518147","https://openalex.org/W4293569217","https://openalex.org/W4297493126","https://openalex.org/W4379422140","https://openalex.org/W4382317664","https://openalex.org/W4385516987","https://openalex.org/W4386631007","https://openalex.org/W4391549659","https://openalex.org/W4391549660","https://openalex.org/W4413918681"],"related_works":[],"abstract_inverted_index":{"This":[0],"letter":[1],"presents":[2],"a":[3,19,64,78,84,90],"hierarchical":[4,65,145],"planning":[5,66,150],"approach":[6,114],"to":[7,107,156],"the":[8,45,56,70,96,144],"vehicle":[9,136],"routing":[10,80],"and":[11,89,121,152],"scheduling":[12,92],"problem":[13,71],"(VRSP)":[14],"for":[15],"marsupial":[16,46],"robotic":[17,24],"systems,":[18],"specialized":[20],"class":[21],"of":[22,30,35,59],"heterogeneous":[23],"systems":[25],"in":[26,95,126],"which":[27],"one":[28],"type":[29],"mobile":[31],"robot":[32],"is":[33,115],"capable":[34],"carrying":[36],"another.":[37],"While":[38],"traditional":[39],"VRSPs":[40],"have":[41],"been":[42],"widely":[43],"studied,":[44],"variant":[47],"(MVRSP)":[48],"has":[49],"received":[50],"relatively":[51],"little":[52],"attention.":[53],"To":[54],"address":[55],"NP-hard":[57],"nature":[58],"MVRSP,":[60],"this":[61],"work":[62],"introduces":[63],"structure":[67],"that":[68,143],"decomposes":[69],"into":[72],"two":[73],"subproblems":[74],"with":[75],"reduced":[76],"complexity:":[77],"high-level":[79],"problem,":[81,93],"formulated":[82],"as":[83],"mixed-integer":[85],"linear":[86],"program":[87],"(MILP),":[88],"low-level":[91],"modeled":[94],"Planning":[97],"Domain":[98],"Definition":[99],"Language":[100],"(PDDL).":[101],"These":[102],"subproblem":[103],"solutions":[104],"are":[105],"integrated":[106],"generate":[108],"complete":[109],"mission":[110],"plans.":[111],"The":[112],"proposed":[113],"validated":[116],"through":[117],"qualitative":[118],"plan":[119],"visualizations":[120],"quantitative":[122],"Monte":[123],"Carlo":[124],"simulations":[125],"an":[127,133],"autonomous":[128],"subsea":[129],"mapping":[130],"scenario,":[131],"where":[132],"unmanned":[134],"surface":[135],"carries":[137],"multiple":[138],"underwater":[139],"vehicles.":[140],"Results":[141],"show":[142],"planner":[146],"significantly":[147],"improves":[148],"both":[149],"efficiency":[151],"solution":[153],"quality":[154],"compared":[155],"baseline":[157],"methods.":[158]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-10T00:00:00"}