{"id":"https://openalex.org/W4415593723","doi":"https://doi.org/10.1109/lra.2025.3625487","title":"Global Planning and Local Update for Multi-Size Agents Path Finding","display_name":"Global Planning and Local Update for Multi-Size Agents Path Finding","publication_year":2025,"publication_date":"2025-10-27","ids":{"openalex":"https://openalex.org/W4415593723","doi":"https://doi.org/10.1109/lra.2025.3625487"},"language":null,"primary_location":{"id":"doi:10.1109/lra.2025.3625487","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3625487","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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/A5100355213","display_name":"Yifei Li","orcid":"https://orcid.org/0000-0001-6238-8176"},"institutions":[{"id":"https://openalex.org/I158809036","display_name":"Shenzhen Institute of Information Technology","ror":"https://ror.org/03wrf9427","country_code":"CN","type":"education","lineage":["https://openalex.org/I158809036"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yifei Li","raw_affiliation_strings":["Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, China"],"raw_orcid":"https://orcid.org/0000-0001-6238-8176","affiliations":[{"raw_affiliation_string":"Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, China","institution_ids":["https://openalex.org/I158809036"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006819425","display_name":"Hejiao Huang","orcid":"https://orcid.org/0000-0002-2030-957X"},"institutions":[{"id":"https://openalex.org/I158809036","display_name":"Shenzhen Institute of Information Technology","ror":"https://ror.org/03wrf9427","country_code":"CN","type":"education","lineage":["https://openalex.org/I158809036"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hejiao Huang","raw_affiliation_strings":["Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, China"],"raw_orcid":"https://orcid.org/0000-0002-2030-957X","affiliations":[{"raw_affiliation_string":"Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Harbin Institute of Technology (Shenzhen), Shenzhen, China","institution_ids":["https://openalex.org/I158809036"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I158809036"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24048975,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"12","first_page":"12931","last_page":"12938"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9782999753952026,"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.9782999753952026,"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/T11106","display_name":"Data Management and Algorithms","score":0.9427000284194946,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10757","display_name":"Geographic Information Systems Studies","score":0.9276000261306763,"subfield":{"id":"https://openalex.org/subfields/3305","display_name":"Geography, Planning and Development"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6118000149726868},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5533999800682068},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.548799991607666},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5266000032424927},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5218999981880188},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4952000081539154},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4287000000476837},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.42250001430511475}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6225000023841858},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6118000149726868},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5846999883651733},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5533999800682068},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.548799991607666},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5266000032424927},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5218999981880188},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4952000081539154},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4287000000476837},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3837999999523163},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3483000099658966},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.34389999508857727},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3197000026702881},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31119999289512634},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3075999915599823},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2955000102519989},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2937000095844269},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2621999979019165}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2025.3625487","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2025.3625487","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766","2377-3774"],"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":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1989407213","https://openalex.org/W2202006879","https://openalex.org/W2398043204","https://openalex.org/W2903837854","https://openalex.org/W2903998385","https://openalex.org/W2910199074","https://openalex.org/W2914864020","https://openalex.org/W2964997335","https://openalex.org/W2989659372","https://openalex.org/W3032851638","https://openalex.org/W3038024682","https://openalex.org/W3190828211","https://openalex.org/W3194012445","https://openalex.org/W3210613226","https://openalex.org/W4312308076","https://openalex.org/W4312706257","https://openalex.org/W4382202651","https://openalex.org/W4391593898"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"letter,":[2],"we":[3,135,176,203],"study":[4],"the":[5,17,36,75,86,172,199,216,219],"Multi-Size":[6],"Agent":[7],"Path":[8,19],"Finding":[9,20],"(MSAPF)":[10],"problem,":[11],"which":[12,41,149,182],"is":[13,71,88,150,164,180],"a":[14,25,115,137,151,231],"generalization":[15],"of":[16,28,78,130,201,222],"Multi-Agent":[18],"(MAPF)":[21],"problem":[22,39],"and":[23,55,85,122,139,145,154,215],"has":[24],"wider":[26],"range":[27],"practical":[29],"applications":[30],"in":[31,40,50,63,66,106],"intelligent":[32],"transportation.":[33],"Compared":[34],"to":[35,83,95,224],"well-known":[37],"MAPF":[38,102],"each":[42],"agent":[43],"only":[44,111],"occupies":[45],"one":[46,99],"grid,":[47],"multi-size":[48,79,161,247],"agents":[49,80,248],"MSAPF":[51,108,191],"have":[52],"different":[53],"sizes":[54,61],"may":[56],"occupy":[57],"multiple":[58],"grids.":[59],"Different":[60],"result":[62],"two":[64,205],"bottlenecks":[65,129],"finding":[67],"conflict-free":[68,158],"paths.":[69],"One":[70],"that":[72,89,169,178,184,235],"conflicts":[73,92,113],"between":[74,119],"shortest":[76],"paths":[77,159],"are":[81,93,104],"difficult":[82],"resolve,":[84],"other":[87],"numerous":[90],"new":[91],"likely":[94],"occur":[96],"when":[97],"resolving":[98],"conflict.":[100],"Existing":[101],"algorithms":[103,238],"inefficient":[105],"solving":[107,127],"because":[109],"they":[110],"consider":[112],"involving":[114],"single":[116],"grid":[117],"or":[118],"adjacent":[120],"grids,":[121],"few":[123],"works":[124],"focus":[125],"on":[126,230],"these":[128],"MSAPF.":[131],"To":[132,197],"solve":[133],"MSAPF,":[134],"propose":[136,204],"novel":[138],"complete":[140],"algorithm":[141,153,168],"named":[142],"Global":[143],"Planning":[144],"Local":[146],"Update":[147],"(GPLU),":[148],"two-level":[152],"can":[155,186,239],"efficiently":[156],"find":[157,171],"for":[160,189],"agents.":[162],"GPLU":[163,179,185,223],"an":[165],"unbounded":[166],"sub-optimal":[167],"cannot":[170],"optimal":[173],"solution.":[174],"However,":[175],"prove":[177],"complete,":[181],"means":[183],"return":[187],"solutions":[188,195],"solvable":[190],"instances":[192],"if":[193],"such":[194],"exist.":[196],"improve":[198],"efficiency":[200,211],"GPLU,":[202],"optimization":[206],"strategies.":[207],"The":[208],"former":[209],"improves":[210],"while":[212],"ensuring":[213],"completeness,":[214],"latter":[217],"reduces":[218],"time":[220],"complexity":[221],"polynomial":[225],"time.":[226],"Extensive":[227],"experiments":[228],"conducted":[229],"popular":[232],"benchmark":[233],"show":[234],"our":[236],"proposed":[237],"support":[240],"<inline-formula":[241],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[242],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[243],"notation=\"LaTeX\">$20\\%\\sim":[244],"116.67\\%$</tex-math></inline-formula>":[245],"more":[246],"than":[249],"existing":[250],"MAPF/MSAPF":[251],"algorithms.":[252]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-28T00:00:00"}