{"id":"https://openalex.org/W4403021882","doi":"https://doi.org/10.1109/tase.2024.3466183","title":"A Bounded Sub-Optimal Approach for Multi-Agent Combinatorial Path Finding","display_name":"A Bounded Sub-Optimal Approach for Multi-Agent Combinatorial Path Finding","publication_year":2024,"publication_date":"2024-10-01","ids":{"openalex":"https://openalex.org/W4403021882","doi":"https://doi.org/10.1109/tase.2024.3466183"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2024.3466183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2024.3466183","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Transactions on Automation Science and Engineering","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/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["UM-SJTU Joint Institute, Shanghai Jiao Tong University, Shanghai, China"],"affiliations":[{"raw_affiliation_string":"UM-SJTU Joint Institute, Shanghai Jiao Tong University, Shanghai, China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033570895","display_name":"Sivakumar Rathinam","orcid":"https://orcid.org/0000-0002-9223-7456"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sivakumar Rathinam","raw_affiliation_strings":["Mechanical Engineering Department, Texas A&#x0026;M University, College Station, TX, USA","Mechanical Engineering Department, Texas A and M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Mechanical Engineering Department, Texas A&#x0026;M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Mechanical Engineering Department, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048906141","display_name":"Howie Choset","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Howie Choset","raw_affiliation_strings":["Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"],"affiliations":[{"raw_affiliation_string":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018561143"],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":1.3748,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.82319961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"22","issue":null,"first_page":"7590","last_page":"7605"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991999864578247,"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.9991999864578247,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9592999815940857,"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"}},{"id":"https://openalex.org/T12391","display_name":"Artificial Immune Systems Applications","score":0.9458000063896179,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/bounded-function","display_name":"Bounded function","score":0.7049469947814941},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5604697465896606},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5206212997436523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4828279912471771},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.46619099378585815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36327266693115234},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32930266857147217},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32164767384529114},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19943088293075562},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10750442743301392}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7049469947814941},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5604697465896606},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5206212997436523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4828279912471771},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.46619099378585815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36327266693115234},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32930266857147217},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32164767384529114},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19943088293075562},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10750442743301392},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2024.3466183","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2024.3466183","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"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 Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G6210591215","display_name":null,"funder_award_id":"2120529","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7481737389","display_name":null,"funder_award_id":"2120219","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W57618227","https://openalex.org/W1488757178","https://openalex.org/W1551562380","https://openalex.org/W1968594877","https://openalex.org/W1974713906","https://openalex.org/W1976720680","https://openalex.org/W1988718763","https://openalex.org/W1989407213","https://openalex.org/W2009945360","https://openalex.org/W2016583826","https://openalex.org/W2040572217","https://openalex.org/W2042872950","https://openalex.org/W2050819731","https://openalex.org/W2061594663","https://openalex.org/W2071566036","https://openalex.org/W2086917808","https://openalex.org/W2117226423","https://openalex.org/W2123030512","https://openalex.org/W2123726099","https://openalex.org/W2139059344","https://openalex.org/W2155191411","https://openalex.org/W2162750432","https://openalex.org/W2168003214","https://openalex.org/W2191404279","https://openalex.org/W2314579004","https://openalex.org/W2406007181","https://openalex.org/W2567337980","https://openalex.org/W2579451340","https://openalex.org/W2735197257","https://openalex.org/W2741892665","https://openalex.org/W2808475207","https://openalex.org/W2914296650","https://openalex.org/W2962992409","https://openalex.org/W2963382051","https://openalex.org/W2965230525","https://openalex.org/W3086406985","https://openalex.org/W3091078866","https://openalex.org/W3134901932","https://openalex.org/W3187649900","https://openalex.org/W3206820044","https://openalex.org/W3216907783","https://openalex.org/W4283798458","https://openalex.org/W4285022255","https://openalex.org/W4312858026","https://openalex.org/W4367281433","https://openalex.org/W4399261818","https://openalex.org/W4401163469","https://openalex.org/W6632662516","https://openalex.org/W6721983959","https://openalex.org/W6738126737","https://openalex.org/W6763034266","https://openalex.org/W6763563180"],"related_works":["https://openalex.org/W3013085049","https://openalex.org/W1560496689","https://openalex.org/W1992739770","https://openalex.org/W4386900933","https://openalex.org/W4229058035","https://openalex.org/W3125672081","https://openalex.org/W4385301946","https://openalex.org/W2006389905","https://openalex.org/W4297797135","https://openalex.org/W2904666330"],"abstract_inverted_index":{"Multi-Agent":[0,23],"Path":[1,25],"Finding":[2,26],"(MAPF)":[3],"seeks":[4],"collision-free":[5,51],"paths":[6,52,115,215,247,270],"for":[7,53,68,116,146,150,154,160,216,248,264,295,319],"multiple":[8,54,249],"agents":[9,29,55,97,281],"from":[10,241,271],"start":[11],"to":[12,62,82,85,111,123,230,234,244,273,315,329,348],"goal":[13],"locations.":[14],"This":[15,134],"paper":[16,135,239,276,310],"considers":[17],"a":[18,33,141,173,285,345,356],"generalization":[19],"of":[20,35,96,131,225,237,287,298,337,341,352],"MAPF":[21,106],"called":[22],"Combinatorial":[24],"(MCPF)":[27],"where":[28,280],"must":[30,282],"collectively":[31,283],"visit":[32,284],"set":[34,286],"intermediate":[36,288],"target":[37,57,147,289],"locations":[38,290],"before":[39,291],"reaching":[40,292],"their":[41,293],"goals.":[42],"MCPF":[43,84],"is":[44,80,100,167,172],"challenging":[45],"as":[46],"it":[47,119],"involves":[48],"both":[49],"planning":[50,266],"and":[56,63,152,195,259,339],"sequencing,":[58],"i.e.,":[59],"assigning":[60],"targets":[61,99,338],"computing":[64],"the":[65,94,129,221,242,278,296,307,350,353],"visiting":[66],"order":[67],"each":[69],"agent.":[70],"A":[71],"recent":[72],"method":[73,142,175],"Conflict-Based":[74],"Steiner":[75],"Search":[76],"(<monospace":[77],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[78,144,165,188,202,208],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">CBSS</monospace>)":[79],"developed":[81,109],"solve":[83,178,306],"optimality,":[86],"which,":[87],"however,":[88],"does":[89],"not":[90],"scale":[91],"well":[92],"when":[93],"number":[95],"or":[98,301],"large":[101],"(e.g.":[102],"50":[103],"targets).":[104],"While":[105,261],"research":[107],"has":[108,190],"methods":[110,227,263],"plan":[112,245],"bounded":[113,125,197,213,324],"sub-optimality":[114],"many":[117,132],"agents,":[118],"remains":[120],"unknown":[121],"how":[122],"find":[124,212,316],"sub-optimal":[126,198,214],"solutions":[127,318],"in":[128,182,252,255,355],"presence":[130],"targets.":[133,232],"fills":[136],"this":[137,238,275,309],"gap":[138],"by":[139,169],"developing":[140],"<monospace":[143,164,187,201,207],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">AK*</monospace>":[145,166,189],"sequencing":[148],"(A":[149],"Approximation":[151],"K*":[153],"K-best),":[155],"which":[156,326],"leverages":[157],"approximation":[158],"algorithms":[159],"traveling":[161,320],"salesman":[162,321],"problems.":[163],"motivated":[168],"MCPF,":[170],"but":[171],"standalone":[174],"that":[176,186,211,333],"can":[177,334],"K-best":[179,317],"routing":[180],"problems":[181,322],"general.":[183],"We":[184,343],"prove":[185],"worst-case":[191],"polynomial":[192],"runtime":[193],"complexity":[194],"finds":[196],"solutions.":[199],"With":[200],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">AK*</monospace>,":[203],"we":[204],"develop":[205],"two":[206,330],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">CBSS</monospace>":[209],"variants":[210],"MCPF.":[217],"Our":[218],"results":[219],"verify":[220],"fast":[222],"running":[223],"speeds":[224],"our":[226],"with":[228,323],"up":[229],"200":[231],"Note":[233],"Practitioners\u2014The":[235],"motivation":[236],"originates":[240],"need":[243],"conflict-free":[246],"mobile":[250],"robots":[251],"cluttered":[253],"environment":[254],"warehouse":[256,357],"logistics,":[257],"manufacturing":[258],"inspection.":[260],"existing":[262],"multi-agent":[265,331],"typically":[267],"consider":[268],"finding":[269],"starts":[272],"goals,":[274,294],"investigates":[277],"case,":[279],"purpose":[297],"inspection,":[299],"picking":[300],"placing":[302],"parts,":[303],"etc.":[304],"To":[305],"problem,":[308],"first":[311],"develops":[312],"an":[313],"algorithm":[314],"sub-optimality,":[325],"then":[327],"leads":[328],"planners":[332],"handle":[335],"hundreds":[336],"tens":[340],"agents.":[342],"provide":[344],"Gazebo":[346],"simulation":[347],"showcase":[349],"usage":[351],"planner":[354],"like":[358],"environment.":[359]},"counts_by_year":[{"year":2025,"cited_by_count":5}],"updated_date":"2025-12-27T23:08:20.325037","created_date":"2025-10-10T00:00:00"}