{"id":"https://openalex.org/W3137443162","doi":"https://doi.org/10.1109/lra.2021.3067275","title":"Failure-Resilient Coverage Maximization With Multiple Robots","display_name":"Failure-Resilient Coverage Maximization With Multiple Robots","publication_year":2021,"publication_date":"2021-03-18","ids":{"openalex":"https://openalex.org/W3137443162","doi":"https://doi.org/10.1109/lra.2021.3067275","mag":"3137443162"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2021.3067275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3067275","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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 Robotics and Automation Letters","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/A5020144658","display_name":"Md Ishat-E-Rabban","orcid":"https://orcid.org/0000-0003-2623-4836"},"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":true,"raw_author_name":"Md. Ishat-E-Rabban","raw_affiliation_strings":["Department of Computer Science, University of Maryland College Park, Hyattsville, Maryland, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland College Park, Hyattsville, Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"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, Hyattsville, Maryland, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Maryland College Park, Hyattsville, Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020144658"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":1.2742,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.80479175,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"6","issue":"2","first_page":"3894","last_page":"3901"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"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.9988999962806702,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9958999752998352,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9686999917030334,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7445039749145508},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.7048925161361694},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6738184690475464},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6108901500701904},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.595445454120636},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5810154676437378},{"id":"https://openalex.org/keywords/resilience","display_name":"Resilience (materials science)","score":0.43905553221702576},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4228602349758148},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3797941207885742},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3269397020339966},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26671192049980164},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10407966375350952},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07815754413604736}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7445039749145508},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.7048925161361694},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6738184690475464},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6108901500701904},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.595445454120636},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5810154676437378},{"id":"https://openalex.org/C2779585090","wikidata":"https://www.wikidata.org/wiki/Q3457762","display_name":"Resilience (materials science)","level":2,"score":0.43905553221702576},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4228602349758148},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3797941207885742},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3269397020339966},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26671192049980164},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10407966375350952},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07815754413604736},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C97355855","wikidata":"https://www.wikidata.org/wiki/Q11473","display_name":"Thermodynamics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2021.3067275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2021.3067275","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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 Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5257535618","display_name":null,"funder_award_id":"1943368","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1126974217","https://openalex.org/W1601460292","https://openalex.org/W1680189815","https://openalex.org/W1989923929","https://openalex.org/W2011193572","https://openalex.org/W2016002891","https://openalex.org/W2104969271","https://openalex.org/W2106502371","https://openalex.org/W2148182166","https://openalex.org/W2149746310","https://openalex.org/W2151766068","https://openalex.org/W2182566326","https://openalex.org/W2183421640","https://openalex.org/W2401610261","https://openalex.org/W2500139799","https://openalex.org/W2567355071","https://openalex.org/W2601836945","https://openalex.org/W2795832897","https://openalex.org/W2963918661","https://openalex.org/W2964302474","https://openalex.org/W3003936704","https://openalex.org/W6686094655","https://openalex.org/W6686456952","https://openalex.org/W6750608665"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W2402949237","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2594118609","https://openalex.org/W2765425000","https://openalex.org/W3204684126","https://openalex.org/W4389478405","https://openalex.org/W2735578456"],"abstract_inverted_index":{"The":[0,72],"task":[1],"of":[2,21,112,121,156],"maximizing":[3],"coverage":[4,60],"using":[5],"multiple":[6],"robots":[7,64],"has":[8],"several":[9],"applications":[10],"such":[11,23],"as":[12],"surveillance,":[13],"exploration,":[14],"and":[15,97,114,135],"environmental":[16],"monitoring.":[17],"A":[18,37],"major":[19],"challenge":[20],"deploying":[22],"multi-robot":[24],"systems":[25],"in":[26,110,160],"a":[27,58,136,144,161],"practical":[28,162],"scenario":[29],"is":[30,55,75],"to":[31,56,67,77,152],"ensure":[32],"resilience":[33],"against":[34],"robot":[35],"failures.":[36,71],"recent":[38],"work":[39],"(L.":[40],"Zhou":[41],"et":[42],"al.,":[43],"2019)":[44],"introduced":[45],"the":[46,53,63,89,93,98,107,119,132,148,154],"Resilient":[47],"Coverage":[48],"Maximization":[49],"(RCM)":[50],"problem":[51,74,151],"where":[52],"goal":[54],"maximize":[57],"submodular":[59],"utility":[61],"when":[62],"are":[65],"subject":[66],"adversarial":[68],"attacks":[69],"or":[70],"RCM":[73,90],"known":[76],"be":[78],"NP-hard.":[79],"In":[80],"this":[81],"letter,":[82],"we":[83,125],"propose":[84],"two":[85],"approximation":[86],"algorithms":[87,104,130,159],"for":[88],"problem,":[91],"namely,":[92],"Ordered":[94],"Greedy":[95],"(OrG)":[96],"Local":[99],"Search":[100],"(LS)":[101],"algorithm.":[102,140],"Both":[103],"empirically":[105,126],"outperform":[106],"state-of-the-art":[108],"solution":[109,134],"terms":[111],"accuracy":[113],"running":[115],"time.":[116],"To":[117],"demonstrate":[118],"effectiveness":[120],"our":[122,128,157],"proposed":[123,129,158],"solution,":[124],"compare":[127],"with":[131],"existing":[133],"brute":[137],"force":[138],"optimal":[139],"We":[141],"also":[142],"perform":[143],"case":[145],"study":[146],"on":[147],"persistent":[149],"monitoring":[150],"show":[153],"applicability":[155],"setting.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}