{"id":"https://openalex.org/W4313639219","doi":"https://doi.org/10.1109/tro.2022.3232268","title":"Robust Multiple-Path Orienteering Problem: Securing Against Adversarial Attacks","display_name":"Robust Multiple-Path Orienteering Problem: Securing Against Adversarial Attacks","publication_year":2023,"publication_date":"2023-01-06","ids":{"openalex":"https://openalex.org/W4313639219","doi":"https://doi.org/10.1109/tro.2022.3232268"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2022.3232268","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2022.3232268","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/A5017567994","display_name":"Guangyao Shi","orcid":"https://orcid.org/0000-0001-5656-1091"},"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":"Guangyao Shi","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041045546","display_name":"Lifeng Zhou","orcid":"https://orcid.org/0000-0001-7927-8504"},"institutions":[{"id":"https://openalex.org/I72816309","display_name":"Drexel University","ror":"https://ror.org/04bdffz58","country_code":"US","type":"education","lineage":["https://openalex.org/I72816309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lifeng Zhou","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Drexel University, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I72816309"]}]},{"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":3,"corresponding_author_ids":["https://openalex.org/A5017567994"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":2.2107,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.89535701,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"39","issue":"3","first_page":"2060","last_page":"2077"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9991000294685364,"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.9991000294685364,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/orienteering","display_name":"Orienteering","score":0.7292803525924683},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5667247176170349},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.5575604438781738},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49788975715637207},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.47736048698425293},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46651187539100647},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4614068567752838},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.44899386167526245},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42467665672302246},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38369205594062805},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38273340463638306},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38064315915107727},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.321397602558136},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.297980397939682},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09865763783454895}],"concepts":[{"id":"https://openalex.org/C513932644","wikidata":"https://www.wikidata.org/wiki/Q29358","display_name":"Orienteering","level":2,"score":0.7292803525924683},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5667247176170349},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.5575604438781738},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49788975715637207},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.47736048698425293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46651187539100647},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4614068567752838},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.44899386167526245},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42467665672302246},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38369205594062805},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38273340463638306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38064315915107727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.321397602558136},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.297980397939682},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09865763783454895},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"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/tro.2022.3232268","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2022.3232268","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":[{"id":"https://metadata.un.org/sdg/15","score":0.6299999952316284,"display_name":"Life in Land"}],"awards":[{"id":"https://openalex.org/G135316153","display_name":null,"funder_award_id":"1943368","funder_id":"https://openalex.org/F4320335353","funder_display_name":"National Science Foundation of Sri Lanka"},{"id":"https://openalex.org/G7128948291","display_name":null,"funder_award_id":"N000141812829","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1562003885","https://openalex.org/W1625390266","https://openalex.org/W1981174120","https://openalex.org/W2015159529","https://openalex.org/W2022149436","https://openalex.org/W2051384576","https://openalex.org/W2073110021","https://openalex.org/W2105933141","https://openalex.org/W2113873983","https://openalex.org/W2125069195","https://openalex.org/W2126316555","https://openalex.org/W2148026779","https://openalex.org/W2151239055","https://openalex.org/W2153233841","https://openalex.org/W2183421640","https://openalex.org/W2221184070","https://openalex.org/W2396961959","https://openalex.org/W2495591843","https://openalex.org/W2531699011","https://openalex.org/W2572839999","https://openalex.org/W2574318813","https://openalex.org/W2604420937","https://openalex.org/W2608044266","https://openalex.org/W2774807875","https://openalex.org/W2791580684","https://openalex.org/W2795832897","https://openalex.org/W2891317153","https://openalex.org/W2902183398","https://openalex.org/W2956013814","https://openalex.org/W2962907715","https://openalex.org/W2963360571","https://openalex.org/W2963918661","https://openalex.org/W2964175192","https://openalex.org/W2964302474","https://openalex.org/W2985558354","https://openalex.org/W3003506411","https://openalex.org/W3040162929","https://openalex.org/W3089748765","https://openalex.org/W3123069145","https://openalex.org/W6679608865","https://openalex.org/W6686094655","https://openalex.org/W6689175234","https://openalex.org/W6737165829","https://openalex.org/W6750608665"],"related_works":["https://openalex.org/W4249387127","https://openalex.org/W1543810005","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W2622090745","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4313343266","https://openalex.org/W4299354108"],"abstract_inverted_index":{"The":[0],"multiple-path":[1,68],"orienteering":[2,69],"problem":[3,27,70],"asks":[4],"for":[5,7,41,145,239],"paths":[6],"a":[8,125,130,200,212,220],"team":[9,55],"of":[10,84,97,250],"robots":[11,116,191],"that":[12,81,134,152],"maximize":[13],"the":[14,23,53,66,106,142,153,161,174,184,190,204,207,248],"total":[15],"reward":[16],"collected":[17],"while":[18],"satisfying":[19],"budget":[20],"constraints":[21],"on":[22,49,136,225],"path":[24,197],"length.":[25],"This":[26],"models":[28],"many":[29],"multirobot":[30],"routing":[31],"tasks,":[32],"such":[33],"as":[34,211],"exploring":[35],"unknown":[36],"environments":[37],"and":[38,102,120,141,179,216,242],"information":[39],"gathering":[40],"environmental":[42],"monitoring.":[43],"In":[44,105,148,203,230],"this":[45,98],"article,":[46],"we":[47,73,150,235],"focus":[48],"how":[50],"to":[51,57,194,232,246],"make":[52],"robot":[54],"robust":[56,67],"failures":[58],"when":[59,115,160,173,183],"operating":[60],"in":[61,219],"adversarial":[62],"environments.":[63],"We":[64,93],"introduce":[65],"(RMOP),":[71],"where":[72],"seek":[74],"worst":[75],"case":[76],"guarantees":[77],"against":[78],"an":[79],"adversary":[80],"is":[82,110,124,164,177,187,209],"capable":[83],"attacking":[85],"at":[86],"most":[87],"<inline-formula":[88,137,167],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[89,138,168],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[90,139,169],"notation=\"LaTeX\">$\\alpha$</tex-math></inline-formula>":[91,140],"robots.":[92],"consider":[94],"two":[95],"versions":[96],"problem:":[99],"RMOP":[100,103,208],"offline":[101,107],"online.":[104],"version,":[108,206],"there":[109],"no":[111],"communication":[112],"or":[113],"replanning":[114],"execute":[117],"their":[118,196],"plans,":[119],"our":[121,251],"main":[122],"contribution":[123],"general":[126],"approximation":[127,132,143,159,172,182],"scheme":[128],"with":[129],"bounded":[131,201],"guarantee":[133],"depends":[135],"factor":[144,171],"single-robot":[146],"orienteering.":[147],"particular,":[149],"show":[151],"algorithm":[154],"yields":[155],"a:":[156],"1)":[157],"constant-factor":[158,181],"cost":[162,175,185],"function":[163,176,186],"modular;":[165],"2)":[166],"notation=\"LaTeX\">$\\log$</tex-math></inline-formula>":[170],"submodular;":[178],"3)":[180],"submodular,":[188],"but":[189],"are":[192],"allowed":[193],"exceed":[195],"budgets":[198],"by":[199],"amount.":[202],"online":[205],"modeled":[210],"two-player":[213],"sequential":[214],"game":[215],"solved":[217],"adaptively":[218],"receding":[221],"horizon":[222],"fashion":[223],"based":[224],"Monte":[226],"Carlo":[227],"tree":[228],"search.":[229],"addition":[231],"theoretical":[233],"analysis,":[234],"perform":[236],"simulation":[237],"studies":[238],"ocean":[240],"monitoring":[241],"tunnel":[243],"information-gathering":[244],"applications":[245],"demonstrate":[247],"efficacy":[249],"approach.":[252]},"counts_by_year":[{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}