{"id":"https://openalex.org/W3013896853","doi":"https://doi.org/10.1109/tro.2022.3158227","title":"Risk-Aware Submodular Optimization for Multirobot Coordination","display_name":"Risk-Aware Submodular Optimization for Multirobot Coordination","publication_year":2022,"publication_date":"2022-04-06","ids":{"openalex":"https://openalex.org/W3013896853","doi":"https://doi.org/10.1109/tro.2022.3158227","mag":"3013896853"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2022.3158227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2022.3158227","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"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 Robotics","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/A5041045546","display_name":"Lifeng Zhou","orcid":"https://orcid.org/0000-0001-7927-8504"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]},{"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":"Lifeng Zhou","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA, USA","General Robotics, Automation, Sensing and Perception Laboratory, University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Virginia Tech, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"General Robotics, Automation, Sensing and Perception Laboratory, University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086188394","display_name":"Pratap Tokekar","orcid":"https://orcid.org/0000-0002-3715-0382"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pratap Tokekar","raw_affiliation_strings":["Department of Computer Science, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5041045546"],"corresponding_institution_ids":["https://openalex.org/I79576946","https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":1.3147,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.81479665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"5","first_page":"3064","last_page":"3084"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9919000267982483,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9911999702453613,"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/submodular-set-function","display_name":"Submodular set function","score":0.9527454972267151},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7392081022262573},{"id":"https://openalex.org/keywords/cvar","display_name":"CVAR","score":0.679978609085083},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.49017199873924255},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48818713426589966},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4673832654953003},{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.4655753970146179},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.4563884735107422},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4511777460575104},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.42793360352516174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3560645878314972},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3540325462818146},{"id":"https://openalex.org/keywords/expected-shortfall","display_name":"Expected shortfall","score":0.22526994347572327},{"id":"https://openalex.org/keywords/risk-management","display_name":"Risk management","score":0.1652090847492218}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9527454972267151},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7392081022262573},{"id":"https://openalex.org/C2779922397","wikidata":"https://www.wikidata.org/wiki/Q5014755","display_name":"CVAR","level":4,"score":0.679978609085083},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.49017199873924255},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48818713426589966},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4673832654953003},{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.4655753970146179},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.4563884735107422},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4511777460575104},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.42793360352516174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3560645878314972},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3540325462818146},{"id":"https://openalex.org/C5496284","wikidata":"https://www.wikidata.org/wiki/Q5420856","display_name":"Expected shortfall","level":3,"score":0.22526994347572327},{"id":"https://openalex.org/C32896092","wikidata":"https://www.wikidata.org/wiki/Q189447","display_name":"Risk management","level":2,"score":0.1652090847492218},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"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":1,"locations":[{"id":"doi:10.1109/tro.2022.3158227","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2022.3158227","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"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 Robotics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G2669754732","display_name":null,"funder_award_id":"IIS-1637915","funder_id":"https://openalex.org/F4320335353","funder_display_name":"National Science Foundation of Sri Lanka"},{"id":"https://openalex.org/G4641987079","display_name":null,"funder_award_id":"N00014-18-1-2829","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320335353","display_name":"National Science Foundation of Sri Lanka","ror":"https://ror.org/010xaa060"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W1106997938","https://openalex.org/W1647779468","https://openalex.org/W1680189815","https://openalex.org/W1989453388","https://openalex.org/W1989923929","https://openalex.org/W2011193572","https://openalex.org/W2019291268","https://openalex.org/W2061820396","https://openalex.org/W2092401564","https://openalex.org/W2094658339","https://openalex.org/W2125069195","https://openalex.org/W2131824593","https://openalex.org/W2136032111","https://openalex.org/W2157488300","https://openalex.org/W2168983555","https://openalex.org/W2217134819","https://openalex.org/W2549766072","https://openalex.org/W2583768145","https://openalex.org/W2605019791","https://openalex.org/W2622976012","https://openalex.org/W2738761080","https://openalex.org/W2739335553","https://openalex.org/W2757107770","https://openalex.org/W2781849003","https://openalex.org/W2788083269","https://openalex.org/W2808970843","https://openalex.org/W2891317153","https://openalex.org/W2892376036","https://openalex.org/W2922048356","https://openalex.org/W2963510622","https://openalex.org/W2963918661","https://openalex.org/W2964283858","https://openalex.org/W2986543921","https://openalex.org/W2988480584","https://openalex.org/W3003506411","https://openalex.org/W3021487874","https://openalex.org/W3022966133","https://openalex.org/W3023013592","https://openalex.org/W3040162929","https://openalex.org/W3089748765","https://openalex.org/W3098161317","https://openalex.org/W3099664902","https://openalex.org/W3124407081","https://openalex.org/W3139273809","https://openalex.org/W3175672857","https://openalex.org/W4236670843","https://openalex.org/W4285719527","https://openalex.org/W6679608865"],"related_works":["https://openalex.org/W4252399622","https://openalex.org/W3019887169","https://openalex.org/W3010065501","https://openalex.org/W1499990180","https://openalex.org/W4241672388","https://openalex.org/W2382791850","https://openalex.org/W4313349761","https://openalex.org/W4385627918","https://openalex.org/W4320232260","https://openalex.org/W2788083269"],"abstract_inverted_index":{"We":[0,13,155,187,197,247],"study":[1,189],"the":[2,39,46,56,74,85,88,101,113,122,127,130,137,182,190,204,219,241,249,252],"problem":[3,19,191],"of":[4,48,87,112,129,147,184,192,251],"incorporating":[5],"risk":[6,28,31],"while":[7],"making":[8],"combinatorial":[9,148],"decisions":[10],"under":[11,92,163],"uncertainty.":[12],"formulate":[14],"a":[15,22,30,93,109,145,199,232],"discrete":[16,63],"submodular":[17,64,131,195],"maximization":[18],"for":[20,165,174,218],"selecting":[21],"set":[23,132],"using":[24],"conditional":[25],"value":[26],"at":[27,244],"(CVaR),":[29],"metric":[32],"commonly":[33],"used":[34,44],"in":[35,45,52,140,153],"financial":[36],"analysis.":[37],"While":[38],"CVaR":[40,89],"has":[41],"recently":[42],"been":[43],"optimization":[47,65,149],"linear":[49],"cost":[50,90],"functions":[51],"robotics,":[53],"we":[54,72,223],"take":[55],"first":[57],"step":[58],"toward":[59],"extending":[60],"this":[61],"to":[62,180,212],"and":[66,115,134,169],"provide":[67],"several":[68],"positive":[69],"results.":[70],"Specifically,":[71],"propose":[73,224],"sequential":[75],"greedy":[76],"algorithm":[77,106,138,229],"that":[78,100,119,136,151,202,230],"provides":[79],"an":[80,116,225],"approximation":[81,97],"guarantee":[82,98],"on":[83,121,167],"finding":[84],"maxima":[86],"function":[91,133],"matroid":[94],"constraint.":[95],"The":[96],"shows":[99],"solution":[102,201],"produced":[103],"by":[104],"our":[105,185],"is":[107],"within":[108],"constant":[110],"factor":[111],"optimal":[114],"additive":[117],"term":[118],"depends":[120],"optimal.":[123],"Our":[124],"analysis":[125],"uses":[126],"curvature":[128],"proves":[135],"runs":[139],"polynomial":[141],"time.":[142],"This":[143],"formulates":[144],"number":[146],"problems":[150],"appear":[152],"robotics.":[154],"use":[156],"two":[157],"such":[158],"problems,":[159],"i.e.,":[160],"vehicle":[161],"assignment":[162,228,234],"uncertainty":[164],"mobility":[166],"demand":[168,245],"sensor":[170],"selection":[171],"with":[172],"failures":[173],"environmental":[175],"monitoring,":[176],"as":[177],"case":[178],"studies":[179],"demonstrate":[181],"efficacy":[183],"formulation.":[186],"also":[188],"adaptive":[193,226],"risk-aware":[194],"maximization.":[196],"design":[198],"heuristic":[200],"triggers":[203,231],"replanning":[205],"only":[206,235],"when":[207,236],"certain":[208],"conditions":[209],"are":[210],"satisfied,":[211],"eliminate":[213],"unnecessary":[214],"planning.":[215],"In":[216],"particular,":[217],"online":[220],"mobility-on-demand":[221],"study,":[222],"triggering":[227],"new":[233],"it":[237],"can":[238],"potentially":[239],"reduce":[240],"waiting":[242],"time":[243],"locations.":[246],"verify":[248],"performance":[250],"proposed":[253],"algorithms":[254],"through":[255],"simulations.":[256]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}