{"id":"https://openalex.org/W2200450867","doi":"https://doi.org/10.1109/iros.2015.7353849","title":"Visibility-based persistent monitoring with robot teams","display_name":"Visibility-based persistent monitoring with robot teams","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W2200450867","doi":"https://doi.org/10.1109/iros.2015.7353849","mag":"2200450867"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2015.7353849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2015.7353849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 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/A5086188394","display_name":"Pratap Tokekar","orcid":"https://orcid.org/0000-0002-3715-0382"},"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"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pratap Tokekar","raw_affiliation_strings":["Department of Electrical and Computer Engineering\u2019 Virginia Tech, Blacksburg, VA, U.S.A","Department of Mechanical Engineer and Applied Mechanics, University of Pennsylvania","Department of Electrical and Computer Engineering' Virginia Tech, Blacksburg, VA, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering\u2019 Virginia Tech, Blacksburg, VA, U.S.A","institution_ids":[]},{"raw_affiliation_string":"Department of Mechanical Engineer and Applied Mechanics, University of Pennsylvania","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering' Virginia Tech, Blacksburg, VA, U.S.A","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087021192","display_name":"Vijay Kumar","orcid":"https://orcid.org/0000-0002-3902-9391"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vijay Kumar","raw_affiliation_strings":["Department of Mechanical Engineering and Applied Mechanics, University of Pennsylvania, Philadelphia, PA, U.S.A"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering and Applied Mechanics, University of Pennsylvania, Philadelphia, PA, U.S.A","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086188394"],"corresponding_institution_ids":["https://openalex.org/I79576946"],"apc_list":null,"apc_paid":null,"fwci":1.841,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.90460956,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"3387","last_page":"3394"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9977999925613403,"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/polygon","display_name":"Polygon (computer graphics)","score":0.7320122718811035},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7170209884643555},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.7132163047790527},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6405074000358582},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6262045502662659},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5541549921035767},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5368443131446838},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5257871150970459},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.49472615122795105},{"id":"https://openalex.org/keywords/visibility-polygon","display_name":"Visibility polygon","score":0.4800242483615875},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4745037257671356},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4668733775615692},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45827364921569824},{"id":"https://openalex.org/keywords/collision-detection","display_name":"Collision detection","score":0.4218944311141968},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.351839154958725},{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.32937192916870117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32301002740859985},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30827832221984863},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.2742310166358948},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.21566301584243774}],"concepts":[{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.7320122718811035},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7170209884643555},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.7132163047790527},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6405074000358582},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6262045502662659},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5541549921035767},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5368443131446838},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5257871150970459},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.49472615122795105},{"id":"https://openalex.org/C1449246","wikidata":"https://www.wikidata.org/wiki/Q7936080","display_name":"Visibility polygon","level":4,"score":0.4800242483615875},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4745037257671356},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4668733775615692},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45827364921569824},{"id":"https://openalex.org/C199668693","wikidata":"https://www.wikidata.org/wiki/Q1550329","display_name":"Collision detection","level":3,"score":0.4218944311141968},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.351839154958725},{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.32937192916870117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32301002740859985},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30827832221984863},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.2742310166358948},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.21566301584243774},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2015.7353849","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2015.7353849","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.7200000286102295,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1966360761","https://openalex.org/W1986642089","https://openalex.org/W1993447512","https://openalex.org/W1995813020","https://openalex.org/W1998756569","https://openalex.org/W2008416425","https://openalex.org/W2034656218","https://openalex.org/W2038498300","https://openalex.org/W2041437464","https://openalex.org/W2047083748","https://openalex.org/W2053460888","https://openalex.org/W2071701840","https://openalex.org/W2074313392","https://openalex.org/W2094658339","https://openalex.org/W2102172432","https://openalex.org/W2116740932","https://openalex.org/W2124294571","https://openalex.org/W2132531944","https://openalex.org/W2144571961","https://openalex.org/W2251414797","https://openalex.org/W2295887384","https://openalex.org/W2794831594","https://openalex.org/W3021731471","https://openalex.org/W4232146578","https://openalex.org/W4285719527","https://openalex.org/W6600534748"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2154329468","https://openalex.org/W53644101","https://openalex.org/W2987051945","https://openalex.org/W2372903818","https://openalex.org/W1825136300","https://openalex.org/W2102467404","https://openalex.org/W2030848465","https://openalex.org/W2182340620","https://openalex.org/W2023314550"],"abstract_inverted_index":{"We":[0,156],"study":[1],"the":[2,69,73,76,81,86,96,104,109,138,143,154,160,186,190,206,212],"problem":[3,117],"of":[4,10,25,63,72,75,83,137,179,192,208],"planning":[5],"paths":[6,46,102,144],"for":[7,47,133,174],"a":[8,23,29,64,129,150,163,176,198],"team":[9],"robots":[11,37,49],"motivated":[12],"by":[13,68,95],"coverage,":[14],"persistent":[15],"monitoring":[16,175],"and":[17,80,103,128],"surveillance":[18],"applications.":[19],"The":[20,41,61,90],"input":[21,187],"is":[22,43,54,66,93,106,118,202,211],"set":[24,178,207],"target":[26,53,180,209],"points":[27],"in":[28,153],"polygonal":[30],"environment":[31],"that":[32,51,158],"must":[33],"be":[34],"monitored":[35],"using":[36],"with":[38],"omni-directional":[39],"cameras.":[40],"goal":[42],"to":[44,107,147,189,217],"compute":[45],"all":[48,100],"such":[50],"every":[52],"visible":[55],"from":[56,224],"at":[57],"least":[58],"one":[59],"path.":[60],"cost":[62,92,98],"path":[65,77,87],"given":[67,94,177],"weighted":[70],"combination":[71],"length":[74],"(travel":[78],"time)":[79],"number":[82],"viewpoints":[84],"along":[85],"(measurement":[88],"time).":[89],"overall":[91],"maximum":[97,110],"over":[99],"robot":[101],"objective":[105],"minimize":[108],"cost.":[111],"In":[112,120,140,215],"its":[113],"general":[114],"form,":[115],"this":[116,121],"NP-hard.":[119],"paper,":[122],"we":[123,184,196,220],"present":[124,197,222],"an":[125,171],"optimal":[126,172],"algorithm":[127,173],"constant":[130],"factor":[131],"approximation":[132,200],"two":[134],"special":[135,164],"versions":[136],"problem.":[139],"both":[141],"cases,":[142],"are":[145],"restricted":[146],"lie":[148],"on":[149],"pre-defined":[151],"curve":[152,161],"polygon.":[155,214],"show":[157],"if":[159,183,205],"satisfies":[162],"property,":[165],"termed":[166],"chain-visibility,":[167],"then":[168,195],"there":[169],"exists":[170],"locations.":[181],"Furthermore,":[182],"restrict":[185],"polygon":[188],"class":[191],"street":[193],"polygons,":[194],"constant-factor":[199],"which":[201],"applicable":[203],"even":[204],"locations":[210],"entire":[213],"addition":[216],"theoretical":[218],"proofs,":[219],"also":[221],"results":[223],"simulation":[225],"studies.":[226]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}