{"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":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["UM-SJTU Joint Institute, Shanghai Jiao Tong University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0003-2880-8653","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&M University, College Station, TX, USA","Mechanical Engineering Department, Texas A and M University, College Station, TX, USA"],"raw_orcid":"https://orcid.org/0000-0002-9223-7456","affiliations":[{"raw_affiliation_string":"Mechanical Engineering Department, Texas A&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"],"raw_orcid":"https://orcid.org/0000-0002-5434-7945","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":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8112,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70868463,"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":"Collaborative Research: A Comprehensive Dynamic Search Framework for Asynchronous Multi-Objective Multi-Agent Planning","funder_award_id":"2120529","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7481737389","display_name":"Collaborative Research: A Comprehensive Dynamic Search Framework for Asynchronous Multi-Objective Multi-Agent Planning","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,113,194,226,249],"for":[7,53,68,114,144,148,154,195,227,243,274,298],"multiple":[8,54,228],"agents":[9,29,55,95,260],"from":[10,220,250],"start":[11],"to":[12,62,80,83,109,121,209,213,223,252,294,308,327],"goal":[13],"locations.":[14],"This":[15,132],"paper":[16,133,218,255,289],"considers":[17],"a":[18,33,139,163,264,324,335],"generalization":[19],"of":[20,35,94,129,204,216,266,277,316,320,331],"MAPF":[21,104],"called":[22],"Combinatorial":[24],"(MCPF)":[27],"where":[28,259],"must":[30,261],"collectively":[31,262],"visit":[32,263],"set":[34,265],"intermediate":[36,267],"target":[37,57,141,268],"locations":[38,269],"before":[39,270],"reaching":[40,271],"their":[41,272],"goals.":[42],"MCPF":[43,82],"is":[44,78,98,162],"challenging":[45],"as":[46],"it":[47,117],"involves":[48],"both":[49],"planning":[50,245],"and":[56,63,146,181,238,318],"sequencing,":[58],"i.e.,":[59],"assigning":[60],"targets":[61,97,317],"computing":[64],"the":[65,92,127,200,221,257,275,286,329,332],"visiting":[66],"order":[67],"each":[69],"agent.":[70],"A":[71],"recent":[72],"method":[73,165],"Conflict-Based":[74],"Steiner":[75],"Search":[76],"(CBSS)":[77],"developed":[79,107],"solve":[81,168,285],"optimality,":[84],"which,":[85],"however,":[86],"does":[87],"not":[88],"scale":[89],"well":[90],"when":[91],"number":[93],"or":[96,280],"large":[99],"(e.g.":[100],"50":[101],"targets).":[102],"While":[103,240],"research":[105],"has":[106],"methods":[108,206,242],"plan":[110,224],"bounded":[111,123,183,192,303],"sub-optimality":[112],"many":[115,130],"agents,":[116],"remains":[118],"unknown":[119],"how":[120],"find":[122,191,295],"sub-optimal":[124,184,193],"solutions":[125,297],"in":[126,172,231,234,334],"presence":[128],"targets.":[131,211],"fills":[134],"this":[135,217,254,288],"gap":[136],"by":[137,159],"developing":[138],"methodAK*for":[140],"sequencing":[142],"(A":[143],"Approximation":[145],"K*":[147],"K-best),":[149],"which":[150,305],"leverages":[151],"approximation":[152],"algorithms":[153],"traveling":[155,299],"salesman":[156,300],"problems.AK*is":[157],"motivated":[158],"MCPF,":[160],"but":[161],"standalone":[164],"that":[166,190,312],"can":[167,313],"K-best":[169,296],"routing":[170],"problems":[171,301],"general.":[173],"We":[174,322],"prove":[175],"thatAK*has":[176],"worst-case":[177],"polynomial":[178],"runtime":[179],"complexity":[180],"finds":[182],"solutions.":[185],"WithAK*,":[186],"we":[187],"develop":[188],"twoCBSSvariants":[189],"MCPF.":[196],"Our":[197],"results":[198],"verify":[199],"fast":[201],"running":[202],"speeds":[203],"our":[205],"with":[207,302],"up":[208],"200":[210],"Note":[212],"Practitioners\u2014The":[214],"motivation":[215],"originates":[219],"need":[222],"conflict-free":[225],"mobile":[229],"robots":[230],"cluttered":[232],"environment":[233],"warehouse":[235,336],"logistics,":[236],"manufacturing":[237],"inspection.":[239],"existing":[241],"multi-agent":[244,310],"typically":[246],"consider":[247],"finding":[248],"starts":[251],"goals,":[253,273],"investigates":[256],"case,":[258],"purpose":[276],"inspection,":[278],"picking":[279],"placing":[281],"parts,":[282],"etc.":[283],"To":[284],"problem,":[287],"first":[290],"develops":[291],"an":[292],"algorithm":[293],"sub-optimality,":[304],"then":[306],"leads":[307],"two":[309],"planners":[311],"handle":[314],"hundreds":[315],"tens":[319],"agents.":[321],"provide":[323],"Gazebo":[325],"simulation":[326],"showcase":[328],"usage":[330],"planner":[333],"like":[337],"environment.":[338]},"counts_by_year":[{"year":2025,"cited_by_count":5}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}