{"id":"https://openalex.org/W1995813020","doi":"https://doi.org/10.1177/0278364913504011","title":"Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations","display_name":"Persistent monitoring in discrete environments: Minimizing the maximum weighted latency between observations","publication_year":2013,"publication_date":"2013-10-04","ids":{"openalex":"https://openalex.org/W1995813020","doi":"https://doi.org/10.1177/0278364913504011","mag":"1995813020"},"language":"en","primary_location":{"id":"doi:10.1177/0278364913504011","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364913504011","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","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/A5011592650","display_name":"Soroush Alamdari","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Soroush Alamdari","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066622082","display_name":"Elaheh Fata","orcid":"https://orcid.org/0000-0003-0006-5341"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Elaheh Fata","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Canada","Department of Electrical and Computer Engineering, University of Waterloo, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Canada#TAB#","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103134580","display_name":"Stephen L. Smith","orcid":"https://orcid.org/0000-0002-8636-407X"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephen L Smith","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Waterloo, Canada","Department of Electrical and Computer Engineering, University of Waterloo, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Waterloo, Canada#TAB#","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5011592650"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":9.4277,"has_fulltext":false,"cited_by_count":125,"citation_normalized_percentile":{"value":0.9812094,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":"33","issue":"1","first_page":"138","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9955000281333923,"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.9945999979972839,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7760453224182129},{"id":"https://openalex.org/keywords/neighbourhood","display_name":"Neighbourhood (mathematics)","score":0.6449133157730103},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.6339581608772278},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5625907182693481},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5609106421470642},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.5551090240478516},{"id":"https://openalex.org/keywords/patrolling","display_name":"Patrolling","score":0.4927416145801544},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46003589034080505},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44298073649406433},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43583235144615173},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4301767945289612},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43002742528915405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3797561526298523}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7760453224182129},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.6449133157730103},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.6339581608772278},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5625907182693481},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5609106421470642},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.5551090240478516},{"id":"https://openalex.org/C110698143","wikidata":"https://www.wikidata.org/wiki/Q651389","display_name":"Patrolling","level":2,"score":0.4927416145801544},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46003589034080505},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44298073649406433},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43583235144615173},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4301767945289612},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43002742528915405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3797561526298523},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364913504011","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364913504011","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W191547824","https://openalex.org/W1517111841","https://openalex.org/W1544032329","https://openalex.org/W1603050797","https://openalex.org/W1636918467","https://openalex.org/W1861199746","https://openalex.org/W1951820257","https://openalex.org/W1987474585","https://openalex.org/W2042986967","https://openalex.org/W2047083748","https://openalex.org/W2064155562","https://openalex.org/W2074313392","https://openalex.org/W2078209379","https://openalex.org/W2078882488","https://openalex.org/W2080164368","https://openalex.org/W2092297192","https://openalex.org/W2093284501","https://openalex.org/W2124294571","https://openalex.org/W2125009529","https://openalex.org/W2132531944","https://openalex.org/W2133725796","https://openalex.org/W2141154005","https://openalex.org/W2141355868","https://openalex.org/W2148926063","https://openalex.org/W2157503093","https://openalex.org/W2160179157","https://openalex.org/W2165298539","https://openalex.org/W2168210873","https://openalex.org/W2296326525","https://openalex.org/W2611093227","https://openalex.org/W2611804663","https://openalex.org/W2964235823","https://openalex.org/W4232896595","https://openalex.org/W4238555168","https://openalex.org/W4298406840"],"related_works":["https://openalex.org/W2079263399","https://openalex.org/W4221167366","https://openalex.org/W4287780535","https://openalex.org/W4226211922","https://openalex.org/W1712180277","https://openalex.org/W2024517697","https://openalex.org/W2029933769","https://openalex.org/W3021699323","https://openalex.org/W2551034790","https://openalex.org/W2125212169"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,73],"consider":[4],"the":[5,28,53,57,63,71,75,83,93,110,129,152,155],"problem":[6],"of":[7,19,21,43,59,78,97,114,176,178],"planning":[8],"a":[9,12,16,31,67,79,105,124,181,186],"path":[10],"for":[11,128,184,188],"robot":[13,64],"to":[14,81,88,103,173],"monitor":[15],"known":[17],"set":[18],"features":[20],"interest":[22],"in":[23],"an":[24,137,142],"environment.":[25],"We":[26,117,131,161],"represent":[27,41],"environment":[29],"as":[30],"graph":[32],"with":[33],"vertex":[34,54,80,159],"weights":[35,55],"and":[36,52,141,157,180],"edge":[37,45],"lengths.":[38],"The":[39],"vertices":[40,179],"regions":[42,51],"interest,":[44],"lengths":[46],"give":[47,56],"travel":[48],"times":[49],"between":[50,86,154],"importance":[58,94],"each":[60],"region.":[61],"As":[62],"repeatedly":[65],"performs":[66],"closed":[68,106],"walk":[69,107],"on":[70],"graph,":[72],"define":[74],"weighted":[76,91,112],"latency":[77,113],"be":[82,171],"maximum":[84,111,156],"time":[85,126],"visits":[87],"that":[89,98,108,119,167],"vertex,":[90],"by":[92],"(vertex":[95],"weight)":[96],"vertex.":[99,116],"Our":[100],"goal":[101],"is":[102,151],"find":[104],"minimizes":[109],"any":[115],"show":[118],"there":[120],"does":[121],"not":[122],"exist":[123],"polynomial":[125],"algorithm":[127,140],"problem.":[130],"then":[132],"provide":[133,162],"two":[134],"approximation":[135],"algorithms;":[136],"O(log":[138,143],"n)-approximation":[139],"\u03c1":[144,149],"G":[145,150],")-approximation":[146],"algorithm,":[147],"where":[148],"ratio":[153],"minimum":[158],"weights.":[160],"simulation":[163],"results":[164],"which":[165],"demonstrate":[166],"our":[168],"algorithms":[169],"can":[170],"applied":[172],"problems":[174],"consisting":[175],"thousands":[177],"case":[182],"study":[183],"patrolling":[185],"city":[187],"crime.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2}],"updated_date":"2026-05-03T06:03:33.228499","created_date":"2025-10-10T00:00:00"}