{"id":"https://openalex.org/W2157503093","doi":"https://doi.org/10.1109/tro.2011.2179580","title":"On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms","display_name":"On Cooperative Patrolling: Optimal Trajectories, Complexity Analysis, and Approximation Algorithms","publication_year":2012,"publication_date":"2012-01-06","ids":{"openalex":"https://openalex.org/W2157503093","doi":"https://doi.org/10.1109/tro.2011.2179580","mag":"2157503093"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2011.2179580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2011.2179580","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1101.3973","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049920415","display_name":"Fabio Pasqualetti","orcid":"https://orcid.org/0000-0002-8457-8656"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fabio Pasqualetti","raw_affiliation_strings":["Center for Control, Dynamical Systems and Computation, University of California, Santa Barbara, CA, USA"],"affiliations":[{"raw_affiliation_string":"Center for Control, Dynamical Systems and Computation, University of California, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001771133","display_name":"Antonio Franchi","orcid":"https://orcid.org/0000-0002-5670-1282"},"institutions":[{"id":"https://openalex.org/I4210112925","display_name":"Max Planck Institute for Biological Cybernetics","ror":"https://ror.org/026nmvv73","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210112925"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Antonio Franchi","raw_affiliation_strings":["Department of Human Perception Cognition and Action, Max Plank Institute for Biological Cybernetics, Tubingen, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Human Perception Cognition and Action, Max Plank Institute for Biological Cybernetics, Tubingen, Germany","institution_ids":["https://openalex.org/I4210112925"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068353454","display_name":"Francesco Bullo","orcid":"https://orcid.org/0000-0002-4785-2118"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Francesco Bullo","raw_affiliation_strings":["Center for Control, Dynamical Systems and Computation, University of California, Santa Barbara, CA, USA"],"affiliations":[{"raw_affiliation_string":"Center for Control, Dynamical Systems and Computation, University of California, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5049920415"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":23.8416,"has_fulltext":false,"cited_by_count":198,"citation_normalized_percentile":{"value":0.99649963,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"28","issue":"3","first_page":"592","last_page":"606"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9987999796867371,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/patrolling","display_name":"Patrolling","score":0.8694396615028381},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6496265530586243},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.583096444606781},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5359457731246948},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.48823121190071106},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4651504456996918},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.4624751806259155},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44616925716400146},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.4452729821205139},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4344823956489563},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3875981867313385},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3260214030742645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21221032738685608},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1773705780506134}],"concepts":[{"id":"https://openalex.org/C110698143","wikidata":"https://www.wikidata.org/wiki/Q651389","display_name":"Patrolling","level":2,"score":0.8694396615028381},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6496265530586243},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.583096444606781},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5359457731246948},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.48823121190071106},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4651504456996918},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.4624751806259155},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44616925716400146},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.4452729821205139},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4344823956489563},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3875981867313385},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3260214030742645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21221032738685608},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1773705780506134},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tro.2011.2179580","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2011.2179580","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"},{"id":"pmh:oai:arXiv.org:1101.3973","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1101.3973","pdf_url":"https://arxiv.org/pdf/1101.3973","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:escidoc.org:escidoc:1787623","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-0013-B720-8","pdf_url":null,"source":{"id":"https://openalex.org/S7407052962","display_name":"Max Planck Digital Library","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_1787623","is_oa":false,"landing_page_url":"https://hdl.handle.net/11858/00-001M-0000-0013-B720-8","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transaction on Robotics","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1101.3973","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1101.3973","pdf_url":"https://arxiv.org/pdf/1101.3973","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W70974423","https://openalex.org/W175308317","https://openalex.org/W1424654272","https://openalex.org/W1516427227","https://openalex.org/W1523723368","https://openalex.org/W1543672909","https://openalex.org/W1568961751","https://openalex.org/W1603050797","https://openalex.org/W2027056835","https://openalex.org/W2027163500","https://openalex.org/W2040612001","https://openalex.org/W2043869641","https://openalex.org/W2047087577","https://openalex.org/W2050819731","https://openalex.org/W2071701840","https://openalex.org/W2080164368","https://openalex.org/W2090939570","https://openalex.org/W2094658339","https://openalex.org/W2098656877","https://openalex.org/W2101224349","https://openalex.org/W2103670431","https://openalex.org/W2109631474","https://openalex.org/W2125298348","https://openalex.org/W2128740072","https://openalex.org/W2144617950","https://openalex.org/W2149619235","https://openalex.org/W2149888497","https://openalex.org/W2155183030","https://openalex.org/W2157584247","https://openalex.org/W2158020336","https://openalex.org/W2161128818","https://openalex.org/W2165142526","https://openalex.org/W2331903232","https://openalex.org/W2611243847","https://openalex.org/W2611804663","https://openalex.org/W2963574499","https://openalex.org/W4205300528","https://openalex.org/W4250886557","https://openalex.org/W6602969409","https://openalex.org/W6631230212","https://openalex.org/W6636007085"],"related_works":["https://openalex.org/W170273588","https://openalex.org/W2337788814","https://openalex.org/W2092973197","https://openalex.org/W2404411151","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"The":[0],"subject":[1],"of":[2,8,14,17,25,32,59,91,101,141,160,164,177],"this":[3],"paper":[4],"is":[5,148,187],"the":[6,12,23,43,47,60,64,76,83,89,99,132,139,151,157,168,175],"patrolling":[7,169],"an":[9,72,135],"environment":[10],"with":[11,28,82],"aid":[13],"a":[15,80,92,107,117,127,144,161,178,184,192],"team":[16,113],"autonomous":[18],"agents.":[19],"We":[20,78],"consider":[21],"both":[22],"design":[24,176],"open-loop":[26],"trajectories":[27],"optimal":[29,38,136],"properties":[30],"and":[31,46,63,85,95,111,115,189],"distributed":[33,128],"control":[34],"laws":[35],"converging":[36],"to":[37,67],"trajectories.":[39],"As":[40],"performance":[41],"criteria,":[42],"refresh":[44,109,153,180],"time":[45,53,65,110,119,146,154,181],"latency":[48,112],"are":[49],"considered,":[50],"i.e.,":[51],"respectively,":[52],"gap":[54],"between":[55],"any":[56],"two":[57],"visits":[58],"same":[61],"region":[62],"necessary":[66],"inform":[68],"every":[69],"agent":[70],"about":[71],"event":[73],"occurred":[74],"in":[75,167],"environment.":[77],"associate":[79],"graph":[81,186],"environment,":[84],"we":[86,104,125,172,190],"study":[87],"separately":[88],"case":[90,100,140],"chain,":[93],"tree,":[94],"cyclic":[96,185],"graph.":[97],"For":[98,138],"chain":[102],"graph,":[103,143],"first":[105],"describe":[106,126],"minimum":[108,152,179],"trajectory":[114,182],"propose":[116],"polynomial":[118,145],"algorithm":[120,147],"for":[121,150,183],"its":[122],"computation.":[123],"Then,":[124],"procedure":[129],"that":[130,174],"steers":[131],"robots":[133,165],"toward":[134],"trajectory.":[137],"tree":[142],"developed":[149],"problem,":[155],"under":[156],"technical":[158],"assumption":[159],"constant":[162,193],"number":[163],"involved":[166],"task.":[170],"Finally,":[171],"show":[173],"NP-hard,":[188],"develop":[191],"factor":[194],"approximation":[195],"algorithm.":[196]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":21},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":20},{"year":2015,"cited_by_count":18},{"year":2014,"cited_by_count":19},{"year":2013,"cited_by_count":18},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}