{"id":"https://openalex.org/W4415265185","doi":"https://doi.org/10.1177/02783649251379517","title":"Multi-robot search in 3D environments using submodularity with matroid intersection constraints","display_name":"Multi-robot search in 3D environments using submodularity with matroid intersection constraints","publication_year":2025,"publication_date":"2025-10-16","ids":{"openalex":"https://openalex.org/W4415265185","doi":"https://doi.org/10.1177/02783649251379517"},"language":"en","primary_location":{"id":"doi:10.1177/02783649251379517","is_oa":false,"landing_page_url":"https://doi.org/10.1177/02783649251379517","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","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":"Yan-Shuo Li","orcid":"https://orcid.org/0000-0002-5467-2254"},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Yan-Shuo Li","raw_affiliation_strings":["National Central University"],"raw_orcid":"https://orcid.org/0000-0002-5467-2254","affiliations":[{"raw_affiliation_string":"National Central University","institution_ids":["https://openalex.org/I22265921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039241771","display_name":"Kuo-Shih Tseng","orcid":"https://orcid.org/0000-0002-7818-5821"},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Kuo-Shih Tseng","raw_affiliation_strings":["National Central University"],"raw_orcid":"https://orcid.org/0000-0002-7818-5821","affiliations":[{"raw_affiliation_string":"National Central University","institution_ids":["https://openalex.org/I22265921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039241771"],"corresponding_institution_ids":["https://openalex.org/I22265921"],"apc_list":null,"apc_paid":null,"fwci":0.9389,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.81100437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"45","issue":"8","first_page":"1145","last_page":"1164"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/matroid","display_name":"Matroid","score":0.8973000049591064},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6388999819755554},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5688999891281128},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.517799973487854},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.5072000026702881},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.476500004529953},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4074999988079071},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.39959999918937683},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.3828999996185303}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8973000049591064},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6388999819755554},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5688999891281128},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5210000276565552},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.517799973487854},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.5072000026702881},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.476500004529953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4758000075817108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45019999146461487},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.39959999918937683},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.3828999996185303},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.3806000053882599},{"id":"https://openalex.org/C178621168","wikidata":"https://www.wikidata.org/wiki/Q16155113","display_name":"Oriented matroid","level":4,"score":0.3804999887943268},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.37439998984336853},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3695000112056732},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.35679998993873596},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.3422999978065491},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.32280001044273376},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3098999857902527},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.30169999599456787},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.2833000123500824},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2773999869823456},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2721000015735626},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.2689000070095062},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.2533999979496002},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25119999051094055}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/02783649251379517","is_oa":false,"landing_page_url":"https://doi.org/10.1177/02783649251379517","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5591169399","display_name":null,"funder_award_id":"112-2221-E-008-075","funder_id":"https://openalex.org/F4320331164","funder_display_name":"National Science and Technology Council"},{"id":"https://openalex.org/G8703651025","display_name":null,"funder_award_id":"113-2221-E-008-101-MY2","funder_id":"https://openalex.org/F4320331164","funder_display_name":"National Science and Technology Council"}],"funders":[{"id":"https://openalex.org/F4320331164","display_name":"National Science and Technology Council","ror":"https://ror.org/00wnb9798"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1451359022","https://openalex.org/W1517928915","https://openalex.org/W1599161138","https://openalex.org/W1680189815","https://openalex.org/W1965680834","https://openalex.org/W1972391046","https://openalex.org/W1979503164","https://openalex.org/W1982707864","https://openalex.org/W2066381607","https://openalex.org/W2080379754","https://openalex.org/W2097685766","https://openalex.org/W2110896443","https://openalex.org/W2169240708","https://openalex.org/W2346699423","https://openalex.org/W2531699011","https://openalex.org/W2739335553","https://openalex.org/W2757107770","https://openalex.org/W2774807875","https://openalex.org/W2790514337","https://openalex.org/W2805072236","https://openalex.org/W2883975974","https://openalex.org/W2892186189","https://openalex.org/W2953441850","https://openalex.org/W2968982573","https://openalex.org/W2975796181","https://openalex.org/W3013185133","https://openalex.org/W3023009541","https://openalex.org/W3039818432","https://openalex.org/W3089142063","https://openalex.org/W3092357259","https://openalex.org/W3101257960","https://openalex.org/W3109907338","https://openalex.org/W3125164440","https://openalex.org/W4210356871","https://openalex.org/W4212900945","https://openalex.org/W4229446899","https://openalex.org/W4249502209","https://openalex.org/W4285792173","https://openalex.org/W4288336313","https://openalex.org/W4319302559","https://openalex.org/W4319878801","https://openalex.org/W4320157551","https://openalex.org/W4389001387","https://openalex.org/W4392251604","https://openalex.org/W4401417245"],"related_works":[],"abstract_inverted_index":{"The":[0,42,61,74,146],"multi-robot":[1,165],"search":[2,59,166,173],"problem":[3,23,34,44],"is":[4,28,45,55,64,121],"challenging":[5],"since":[6],"it":[7,27],"involves":[8],"task":[9],"allocation,":[10],"minimal":[11],"routing,":[12],"and":[13,70,132,142,168],"maximal":[14,32],"coverage":[15,33,43],"problems,":[16],"which":[17],"are":[18,138],"NP-hard.":[19],"To":[20],"solve":[21],"this":[22],"with":[24,79,134],"theoretical":[25],"guarantees,":[26],"reformulated":[29],"as":[30],"a":[31,67,71],"subject":[35],"to":[36,57,162],"the":[37,52,122,151],"intersection":[38,62],"of":[39,66,159],"matroid":[40,63],"constraints.":[41],"solved":[46],"by":[47],"utilizing":[48],"its":[49],"submodularity.":[50],"Additionally,":[51],"workload":[53],"balance":[54],"considered":[56],"enhance":[58],"efficiency.":[60],"composed":[65],"routing":[68],"constraint":[69],"clustering":[72],"constraint.":[73],"proposed":[75,139],"algorithm,":[76],"Multi-Robot":[77],"Search":[78],"Matroid":[80],"constraints":[81],"(MRSM),":[82],"achieves":[83],"<mml:math":[84,106],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[85,107],"overflow=\"scroll\">":[86,108],"<mml:mo>(</mml:mo>":[87],"<mml:mn>1</mml:mn>":[88],"<mml:mo>/</mml:mo>":[89],"<mml:mn>3</mml:mn>":[90],"<mml:mrow>":[91,96,109,112],"<mml:mo>)</mml:mo>":[92],"</mml:mrow>":[93,100,116,119],"<mml:mover":[94,110],"accent=\"true\">":[95,111],"<mml:mi>O</mml:mi>":[97,113],"<mml:mi>P</mml:mi>":[98,114],"<mml:mi>T</mml:mi>":[99,115],"<mml:mo>\u02dc</mml:mo>":[101,117],"</mml:mover>":[102,118],"</mml:math>":[103,120],",":[104],"where":[105],"optimal":[123],"performance":[124],"under":[125],"spanning-tree":[126],"structures.":[127],"Furthermore,":[128],"Dynamic":[129],"MRSM":[130,133,152],"(D-MRSM)":[131],"Hexagonal":[135],"Packing":[136],"(MRSM-Hex)":[137],"for":[140,171],"unknown":[141],"large-scale":[143],"environments,":[144],"respectively.":[145],"experiment":[147],"results":[148],"show":[149],"that":[150],"approaches":[153],"outperform":[154],"state-of-the-art":[155],"methods":[156],"in":[157,164],"terms":[158],"expected":[160],"time":[161],"detection":[163],"problems":[167],"scale":[169],"effectively":[170],"large":[172],"spaces.":[174]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-04T06:09:54.619538","created_date":"2025-10-17T00:00:00"}