{"id":"https://openalex.org/W2774807875","doi":"https://doi.org/10.1109/iros.2017.8206450","title":"The Matroid Team Surviving Orienteers problem: Constrained routing of heterogeneous teams with risky traversal","display_name":"The Matroid Team Surviving Orienteers problem: Constrained routing of heterogeneous teams with risky traversal","publication_year":2017,"publication_date":"2017-09-01","ids":{"openalex":"https://openalex.org/W2774807875","doi":"https://doi.org/10.1109/iros.2017.8206450","mag":"2774807875"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2017.8206450","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2017.8206450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5033343539","display_name":"Stefan Jorgensen","orcid":"https://orcid.org/0000-0001-6699-937X"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Stefan Jorgensen","raw_affiliation_strings":["Department of Electrical Engineering, Stanford University, Stanford, California"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Stanford University, Stanford, California","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009883963","display_name":"Robert H. Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I2948394018","display_name":"Northrop Grumman (United States)","ror":"https://ror.org/05kewds18","country_code":"US","type":"company","lineage":["https://openalex.org/I2948394018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert H. Chen","raw_affiliation_strings":["NG Next, Northrop Grumman, Redondo Beach, California"],"affiliations":[{"raw_affiliation_string":"NG Next, Northrop Grumman, Redondo Beach, California","institution_ids":["https://openalex.org/I2948394018"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024975935","display_name":"Mark B. Milam","orcid":null},"institutions":[{"id":"https://openalex.org/I2948394018","display_name":"Northrop Grumman (United States)","ror":"https://ror.org/05kewds18","country_code":"US","type":"company","lineage":["https://openalex.org/I2948394018"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark B. Milam","raw_affiliation_strings":["NG Next, Northrop Grumman, Redondo Beach, California"],"affiliations":[{"raw_affiliation_string":"NG Next, Northrop Grumman, Redondo Beach, California","institution_ids":["https://openalex.org/I2948394018"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050003000","display_name":"Marco Pavone","orcid":"https://orcid.org/0000-0002-0206-4337"},"institutions":[{"id":"https://openalex.org/I13805885","display_name":"Vaughn College of Aeronautics and Technology","ror":"https://ror.org/056e22e24","country_code":"US","type":"education","lineage":["https://openalex.org/I13805885"]},{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marco Pavone","raw_affiliation_strings":["Department of Aeronautics & Astronautics, Stanford University, Stanford, California"],"affiliations":[{"raw_affiliation_string":"Department of Aeronautics & Astronautics, Stanford University, Stanford, California","institution_ids":["https://openalex.org/I13805885","https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5033343539"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":1.2743,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.88259767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5622","last_page":"5629"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991999864578247,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.8082596063613892},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.6508572101593018},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5314587354660034},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5108999609947205},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48768866062164307},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4745912253856659},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4618339538574219},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43668538331985474},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3960157036781311},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3654863238334656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3645917475223541},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3537207245826721},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31430763006210327},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22932565212249756},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09842303395271301}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.8082596063613892},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.6508572101593018},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5314587354660034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5108999609947205},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48768866062164307},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4745912253856659},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4618339538574219},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43668538331985474},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3960157036781311},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3654863238334656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3645917475223541},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3537207245826721},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31430763006210327},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22932565212249756},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09842303395271301},{"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/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2017.8206450","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2017.8206450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.75,"id":"https://metadata.un.org/sdg/14","display_name":"Life below water"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1492803088","https://openalex.org/W1562003885","https://openalex.org/W1680189815","https://openalex.org/W1694045780","https://openalex.org/W1979949281","https://openalex.org/W1983758874","https://openalex.org/W1994724899","https://openalex.org/W2003281104","https://openalex.org/W2063277077","https://openalex.org/W2063520056","https://openalex.org/W2090980435","https://openalex.org/W2112686410","https://openalex.org/W2125069195","https://openalex.org/W2142347270","https://openalex.org/W2151239055","https://openalex.org/W2153817623","https://openalex.org/W2202942124","https://openalex.org/W2240460283","https://openalex.org/W2346699423","https://openalex.org/W2408747761","https://openalex.org/W2500139799","https://openalex.org/W2531699011","https://openalex.org/W2621717961","https://openalex.org/W2622090745","https://openalex.org/W2739335553","https://openalex.org/W2757107770","https://openalex.org/W2988480584","https://openalex.org/W3013185133","https://openalex.org/W3099664902","https://openalex.org/W6724212191"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4233892543","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2037206237","https://openalex.org/W4310658774"],"abstract_inverted_index":{"Consider":[0],"a":[1,12,28,33,52,58,83,127,140,155,210,213],"setting":[2],"where":[3,170,212],"robots":[4,36,216],"must":[5,217],"visit":[6],"sites":[7],"represented":[8],"as":[9,102],"nodes":[10,43],"in":[11,105,112,126,223],"graph,":[13],"but":[14],"each":[15,75],"robot":[16,76],"may":[17],"fail":[18],"when":[19],"traversing":[20],"an":[21,134,190],"edge.":[22],"The":[23],"goal":[24],"is":[25,153,175,185],"to":[26,68,78,209],"find":[27],"set":[29,142],"of":[30,35,42,54,66,124,143,150,167,189,203,215],"paths":[31,50,144],"for":[32,138,193],"team":[34,63,214],"which":[37,97],"maximizes":[38],"the":[39,49,72,90,117,148,151,168,176,186,194,201,224],"expected":[40],"number":[41,65],"collectively":[44],"visited,":[45],"while":[46,220],"guaranteeing":[47],"that":[48,71,74,147],"satisfy":[51],"notion":[53],"\u201cindependence\u201d":[55],"formalized":[56],"by":[57,206],"matroid":[59],"(e.g.":[60],"limits":[61],"on":[62],"size,":[64],"visits":[67],"regions),":[69],"and":[70,108,110,120,145,181],"probabilities":[73],"survives":[77],"its":[79],"destination":[80],"are":[81],"above":[82],"given":[84],"threshold.":[85],"We":[86,115,131,199],"call":[87],"this":[88],"problem":[89],"Matroid":[91],"Team":[92],"Surviving":[93],"Orienteers":[94],"(MTSO)":[95],"problem,":[96],"has":[98],"broad":[99],"applications":[100],"such":[101],"environmental":[103],"monitoring":[104],"risky":[106],"regions":[107],"search":[109],"rescue":[111],"dangerous":[113],"conditions.":[114],"present":[116],"MTSO":[118],"formally":[119],"detail":[121],"numerous":[122],"examples":[123],"matroids":[125],"path":[128],"planning":[129],"context.":[130],"then":[132],"propose":[133],"approximate":[135],"greedy":[136],"algorithm":[137],"selecting":[139],"feasible":[141],"prove":[146],"value":[149],"output":[152],"within":[154],"factor":[156,188],"p":[157,171],"<inf":[158,162,172],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[159,163,173],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">s</inf>":[160,164,174],"/p":[161],"+":[165],"\u03bb":[166],"optimum,":[169],"per-robot":[177],"survival":[178],"probability":[179],"threshold":[180],"1/\u03bb":[182],"\u2264":[183],"1":[184],"approximation":[187],"oracle":[191],"routine":[192],"well":[195],"known":[196],"orienteering":[197],"problem.":[198],"demonstrate":[200],"efficiency":[202],"our":[204],"approach":[205],"applying":[207],"it":[208],"scenario":[211],"gather":[218],"information":[219],"avoiding":[221],"pirates":[222],"Coral":[225],"Triangle.":[226]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}