{"id":"https://openalex.org/W2739335553","doi":"https://doi.org/10.1109/icra.2017.7989038","title":"Decentralized matroid optimization for topology constraints in multi-robot allocation problems","display_name":"Decentralized matroid optimization for topology constraints in multi-robot allocation problems","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2739335553","doi":"https://doi.org/10.1109/icra.2017.7989038","mag":"2739335553"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2017.7989038","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989038","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-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/A5048058450","display_name":"Ryan K. Williams","orcid":"https://orcid.org/0000-0002-2974-4746"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ryan K. Williams","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046644183","display_name":"Andrea Gasparri","orcid":"https://orcid.org/0000-0001-5765-9736"},"institutions":[{"id":"https://openalex.org/I119003972","display_name":"Roma Tre University","ror":"https://ror.org/05vf0dg29","country_code":"IT","type":"education","lineage":["https://openalex.org/I119003972"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea Gasparri","raw_affiliation_strings":["Department of Engineering, Roma Tre University, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Engineering, Roma Tre University, Roma, Italy","institution_ids":["https://openalex.org/I119003972"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049225259","display_name":"Giovanni Ulivi","orcid":"https://orcid.org/0000-0001-6471-3761"},"institutions":[{"id":"https://openalex.org/I119003972","display_name":"Roma Tre University","ror":"https://ror.org/05vf0dg29","country_code":"IT","type":"education","lineage":["https://openalex.org/I119003972"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giovanni Ulivi","raw_affiliation_strings":["Department of Engineering, Roma Tre University, Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Engineering, Roma Tre University, Roma, Italy","institution_ids":["https://openalex.org/I119003972"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048058450"],"corresponding_institution_ids":["https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":5.3872,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.96267958,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"293","last_page":"300"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9934999942779541,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9934999942779541,"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/T12288","display_name":"Optimization and Search Problems","score":0.9782000184059143,"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/T11182","display_name":"Auction Theory and Applications","score":0.96670001745224,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.9200696349143982},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6949079632759094},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6199504137039185},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6184149980545044},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5904095768928528},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5325288772583008},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4782252013683319},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.46998679637908936},{"id":"https://openalex.org/keywords/weighted-matroid","display_name":"Weighted matroid","score":0.4300631880760193},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40044206380844116},{"id":"https://openalex.org/keywords/matroid-partitioning","display_name":"Matroid partitioning","score":0.3533240556716919},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.32400748133659363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26902976632118225},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17094168066978455},{"id":"https://openalex.org/keywords/graphic-matroid","display_name":"Graphic matroid","score":0.1671087145805359},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14464709162712097}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9200696349143982},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6949079632759094},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6199504137039185},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6184149980545044},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5904095768928528},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5325288772583008},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4782252013683319},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.46998679637908936},{"id":"https://openalex.org/C124344645","wikidata":"https://www.wikidata.org/wiki/Q7979897","display_name":"Weighted matroid","level":5,"score":0.4300631880760193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40044206380844116},{"id":"https://openalex.org/C22425182","wikidata":"https://www.wikidata.org/wiki/Q6787906","display_name":"Matroid partitioning","level":4,"score":0.3533240556716919},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.32400748133659363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26902976632118225},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17094168066978455},{"id":"https://openalex.org/C111034964","wikidata":"https://www.wikidata.org/wiki/Q5597156","display_name":"Graphic matroid","level":3,"score":0.1671087145805359},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14464709162712097},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra.2017.7989038","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989038","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.uniroma3.it:11590/332640","is_oa":false,"landing_page_url":"http://hdl.handle.net/11590/332640","pdf_url":null,"source":{"id":"https://openalex.org/S4377196120","display_name":"Iris (Roma Tre University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119003972","host_organization_name":"Roma Tre University","host_organization_lineage":["https://openalex.org/I119003972"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.8299999833106995,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1609070905","https://openalex.org/W1842290172","https://openalex.org/W1972391046","https://openalex.org/W2009070933","https://openalex.org/W2020313791","https://openalex.org/W2054428995","https://openalex.org/W2090321074","https://openalex.org/W2099616537","https://openalex.org/W2107396783","https://openalex.org/W2125626250","https://openalex.org/W2135132740","https://openalex.org/W2142544818","https://openalex.org/W2144945296","https://openalex.org/W2157488300","https://openalex.org/W2162844575","https://openalex.org/W2601836945","https://openalex.org/W3099664902","https://openalex.org/W4210431029","https://openalex.org/W6785177498"],"related_works":["https://openalex.org/W2625145881","https://openalex.org/W2400862597","https://openalex.org/W2159059797","https://openalex.org/W1984819493","https://openalex.org/W2106233458","https://openalex.org/W278334329","https://openalex.org/W4246417054","https://openalex.org/W2058489697","https://openalex.org/W1975978423","https://openalex.org/W2952593185"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,54,93],"demonstrate":[4,117],"how":[5],"topological":[6],"constraints,":[7,13,35],"as":[8,10,30,77],"well":[9],"other":[11],"abstract":[12,63],"can":[14,39,131],"be":[15,40,132],"integrated":[16],"into":[17],"task":[18,44,58,103,110,129],"allocation":[19,45,59,104,111],"by":[20],"applying":[21],"the":[22,43,49,52],"combinatorial":[23,37],"theory":[24],"of":[25,33,51,109],"matroids.":[26],"By":[27],"modeling":[28],"problems":[29],"an":[31],"intersection":[32],"matroid":[34,79,106],"arbitrary":[36],"relationships":[38],"achieved":[41],"in":[42,114,139],"space.":[46],"To":[47],"illustrate":[48],"expressiveness":[50],"framework,":[53],"model":[55],"a":[56,67,78,95],"novel":[57],"problem":[60,74],"that":[61,98,126],"couples":[62],"per-robot":[64],"constraints":[65],"with":[66,84,105,136],"communication":[68],"spanning":[69],"tree":[70],"constraint.":[71],"As":[72],"our":[73,118],"is":[75],"cast":[76],"intersection,":[80],"provable":[81],"optimality":[82],"bounds":[83],"simple":[85],"greedy":[86,128],"algorithms":[87],"follows":[88],"immediately":[89],"from":[90],"theory.":[91],"Next,":[92],"present":[94],"decentralized":[96],"algorithm":[97],"applies":[99],"auction":[100],"methods":[101],"to":[102],"intersections.":[107],"Simulations":[108],"for":[112],"surveillance":[113],"urban":[115],"environments":[116],"results.":[119],"Finally,":[120],"Monte":[121],"Carlo":[122],"results":[123],"are":[124],"provided":[125],"indicate":[127],"allocations":[130],"highly":[133],"competitive":[134],"even":[135],"near-optimal":[137],"solutions":[138],"practice.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}