{"id":"https://openalex.org/W4286580165","doi":"https://doi.org/10.1109/lra.2022.3193242","title":"Min-Max Vertex Cycle Covers With Connectivity Constraints for Multi-Robot Patrolling","display_name":"Min-Max Vertex Cycle Covers With Connectivity Constraints for Multi-Robot Patrolling","publication_year":2022,"publication_date":"2022-07-22","ids":{"openalex":"https://openalex.org/W4286580165","doi":"https://doi.org/10.1109/lra.2022.3193242"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2022.3193242","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lra.2022.3193242","pdf_url":"https://ieeexplore.ieee.org/ielx7/7083369/9831196/09837406.pdf","source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://ieeexplore.ieee.org/ielx7/7083369/9831196/09837406.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089690774","display_name":"Jurgen Scherer","orcid":"https://orcid.org/0000-0001-6045-4168"},"institutions":[{"id":"https://openalex.org/I4210123126","display_name":"Silicon Austria Labs (Austria)","ror":"https://ror.org/03b1qgn79","country_code":"AT","type":"company","lineage":["https://openalex.org/I4210123126"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Jurgen Scherer","raw_affiliation_strings":["Silicon Austria Labs, Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Silicon Austria Labs, Graz, Austria","institution_ids":["https://openalex.org/I4210123126"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052147335","display_name":"Angela P. Schoellig","orcid":"https://orcid.org/0000-0003-4012-4668"},"institutions":[{"id":"https://openalex.org/I4210127509","display_name":"Vector Institute","ror":"https://ror.org/03kqdja62","country_code":"CA","type":"facility","lineage":["https://openalex.org/I4210127509"]},{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Angela P. Schoellig","raw_affiliation_strings":["Institute for Aerospace Studies and Vector Institute, University of Toronto, Toronto, ON, Canada"],"affiliations":[{"raw_affiliation_string":"Institute for Aerospace Studies and Vector Institute, University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I4210127509","https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024032794","display_name":"Bernhard Rinner","orcid":"https://orcid.org/0000-0002-8793-3828"},"institutions":[{"id":"https://openalex.org/I4210166741","display_name":"University of Klagenfurt","ror":"https://ror.org/05q9m0937","country_code":"AT","type":"education","lineage":["https://openalex.org/I4210166741"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Bernhard Rinner","raw_affiliation_strings":["Institute of Networked and Embedded Systems, University of Klagenfurt, Klagenfurt am Wörthersee, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Networked and Embedded Systems, University of Klagenfurt, Klagenfurt am Wörthersee, Austria","institution_ids":["https://openalex.org/I4210166741"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089690774"],"corresponding_institution_ids":["https://openalex.org/I4210123126"],"apc_list":null,"apc_paid":null,"fwci":1.3813,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8175235,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"7","issue":"4","first_page":"10152","last_page":"10159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9990000128746033,"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.9990000128746033,"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.9883999824523926,"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"}},{"id":"https://openalex.org/T11502","display_name":"Facility Location and Emergency Management","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1407","display_name":"Organizational Behavior and Human Resource Management"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/patrolling","display_name":"Patrolling","score":0.9500889778137207},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6547755002975464},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6000286340713501},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5515630841255188},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5398198366165161},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4888848662376404},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4817333519458771},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.43034934997558594},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3794498145580292},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3784189522266388},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37426549196243286},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2810630798339844},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2795053720474243},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17591241002082825},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15416687726974487}],"concepts":[{"id":"https://openalex.org/C110698143","wikidata":"https://www.wikidata.org/wiki/Q651389","display_name":"Patrolling","level":2,"score":0.9500889778137207},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6547755002975464},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6000286340713501},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5515630841255188},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5398198366165161},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4888848662376404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4817333519458771},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.43034934997558594},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3794498145580292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3784189522266388},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37426549196243286},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2810630798339844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2795053720474243},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17591241002082825},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15416687726974487},{"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":1,"locations":[{"id":"doi:10.1109/lra.2022.3193242","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lra.2022.3193242","pdf_url":"https://ieeexplore.ieee.org/ielx7/7083369/9831196/09837406.pdf","source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1109/lra.2022.3193242","is_oa":true,"landing_page_url":"https://doi.org/10.1109/lra.2022.3193242","pdf_url":"https://ieeexplore.ieee.org/ielx7/7083369/9831196/09837406.pdf","source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4286580165.pdf","grobid_xml":"https://content.openalex.org/works/W4286580165.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1486993561","https://openalex.org/W1543672909","https://openalex.org/W2046280257","https://openalex.org/W2054085698","https://openalex.org/W2071848017","https://openalex.org/W2131994692","https://openalex.org/W2157503093","https://openalex.org/W2219284106","https://openalex.org/W2258629489","https://openalex.org/W2557827245","https://openalex.org/W2571149404","https://openalex.org/W2593112539","https://openalex.org/W2772747678","https://openalex.org/W2800330536","https://openalex.org/W2913190903","https://openalex.org/W2956148522","https://openalex.org/W3009422966","https://openalex.org/W3091974399","https://openalex.org/W3099728999","https://openalex.org/W3161242575","https://openalex.org/W4232693667"],"related_works":["https://openalex.org/W2182622946","https://openalex.org/W4286580165","https://openalex.org/W4313227037","https://openalex.org/W2018238558","https://openalex.org/W4307416302","https://openalex.org/W2964261839","https://openalex.org/W1834854720","https://openalex.org/W2889606199","https://openalex.org/W2032278054","https://openalex.org/W2281046621"],"abstract_inverted_index":{"We":[0,40],"consider":[1],"a":[2,17,25,45,64,99,122],"multi-robot":[3,87],"patrolling":[4,88],"scenario":[5],"with":[6,31,63,179],"intermittent":[7],"connectivity":[8],"constraints,":[9],"ensuring":[10],"that":[11,71,91,153,188],"robots'":[12],"data":[13,208],"finally":[14],"arrive":[15],"at":[16],"base":[18],"station.":[19],"In":[20,78],"particular,":[21],"each":[22],"robot":[23],"traverses":[24],"closed":[26],"tour":[27,74,201],"periodically":[28],"and":[29,95,115,134,151,184],"meets":[30],"the":[32,42,48,57,72,83,140,148,164,167,189,196,199],"robots":[33,138,186],"on":[34,131,177],"neighboring":[35],"tours":[36,69,206],"to":[37,136,163,181,194],"exchange":[38],"data.":[39],"model":[41,96],"problem":[43,53,58,111],"as":[44,98,126],"variant":[46],"of":[47,59,67,107,142,166,198],"min-max":[49],"vertex":[50],"cycle":[51],"cover":[52],"(MMCCP),":[54],"which":[55],"is":[56,76,93],"covering":[60],"all":[61],"vertices":[62,133,183],"given":[65],"number":[66],"disjoint":[68],"such":[70],"longest":[73,200],"length":[75,197],"minimal.":[77],"this":[79,110],"work,":[80],"we":[81,117],"introduce":[82],"minimum":[84],"idleness":[85],"connectivity-constrained":[86],"problem,":[89],"show":[90,152],"it":[92,97],"NP-hard,":[94],"mixed-integer":[100],"linear":[101],"program":[102],"(MILP).":[103],"The":[104],"computational":[105],"complexity":[106],"exactly":[108],"solving":[109,147],"restrains":[112],"practical":[113],"applications,":[114],"therefore":[116],"develop":[118],"approximate":[119],"algorithms":[120],"taking":[121],"solution":[123,144],"for":[124,207],"MMCCP":[125],"input.":[127],"Our":[128],"simulation":[129],"experiments":[130],"10":[132,185],"up":[135,180],"3":[137],"compare":[139],"results":[141],"different":[143],"approaches":[145],"(including":[146],"MILP":[149,168],"formulation)":[150],"our":[154],"greedy":[155,190],"algorithm":[156,192],"can":[157],"obtain":[158],"an":[159],"objective":[160],"value":[161],"close":[162],"one":[165],"formulations":[169],"but":[170],"requires":[171],"much":[172],"less":[173],"computation":[174],"time.":[175],"Experiments":[176],"instances":[178],"100":[182],"indicate":[187],"approximation":[191],"tries":[193],"keep":[195],"small":[202],"by":[203],"extending":[204],"smaller":[205],"exchange.":[209]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}