{"id":"https://openalex.org/W4401415081","doi":"https://doi.org/10.1109/icra57147.2024.10611463","title":"Combining Coordination and Independent Coverage in MultiRobot Graph Patrolling","display_name":"Combining Coordination and Independent Coverage in MultiRobot Graph Patrolling","publication_year":2024,"publication_date":"2024-05-13","ids":{"openalex":"https://openalex.org/W4401415081","doi":"https://doi.org/10.1109/icra57147.2024.10611463"},"language":"en","primary_location":{"id":"doi:10.1109/icra57147.2024.10611463","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icra57147.2024.10611463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Robotics and Automation (ICRA)","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/A5074381508","display_name":"Carlos Diaz Alvarenga","orcid":null},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Carlos Diaz Alvarenga","raw_affiliation_strings":["University of Milan,Department of Computer Science,Milan,Italy"],"affiliations":[{"raw_affiliation_string":"University of Milan,Department of Computer Science,Milan,Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090235510","display_name":"Nicola Basilico","orcid":"https://orcid.org/0000-0002-4512-3480"},"institutions":[{"id":"https://openalex.org/I156087764","display_name":"University of California, Merced","ror":"https://ror.org/00d9ah105","country_code":"US","type":"education","lineage":["https://openalex.org/I156087764"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicola Basilico","raw_affiliation_strings":["University of California,Department of Computer Science and Engineering,Merced,CA,USA"],"affiliations":[{"raw_affiliation_string":"University of California,Department of Computer Science and Engineering,Merced,CA,USA","institution_ids":["https://openalex.org/I156087764"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081177797","display_name":"Stefano Carpin","orcid":"https://orcid.org/0000-0003-3837-7463"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Carpin","raw_affiliation_strings":["University of Milan,Department of Computer Science,Milan,Italy"],"affiliations":[{"raw_affiliation_string":"University of Milan,Department of Computer Science,Milan,Italy","institution_ids":["https://openalex.org/I189158943"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074381508"],"corresponding_institution_ids":["https://openalex.org/I189158943"],"apc_list":null,"apc_paid":null,"fwci":1.099,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78525651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"4413","last_page":"4419"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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.9984999895095825,"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.9945999979972839,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/patrolling","display_name":"Patrolling","score":0.9362108707427979},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6969742178916931},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4699578285217285},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4039720892906189},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3524359464645386},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.32078808546066284}],"concepts":[{"id":"https://openalex.org/C110698143","wikidata":"https://www.wikidata.org/wiki/Q651389","display_name":"Patrolling","level":2,"score":0.9362108707427979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6969742178916931},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4699578285217285},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4039720892906189},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3524359464645386},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.32078808546066284},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra57147.2024.10611463","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icra57147.2024.10611463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W119501476","https://openalex.org/W1545109557","https://openalex.org/W1989667750","https://openalex.org/W1995813020","https://openalex.org/W2032243783","https://openalex.org/W2101234009","https://openalex.org/W2249989021","https://openalex.org/W2940265767","https://openalex.org/W2972533757","https://openalex.org/W2972792971","https://openalex.org/W2981079744","https://openalex.org/W2986899354","https://openalex.org/W3023749047","https://openalex.org/W3091451655","https://openalex.org/W3096120809","https://openalex.org/W3158940377","https://openalex.org/W3170635652","https://openalex.org/W4229038794","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/W2163146706","https://openalex.org/W3206391274","https://openalex.org/W167683769","https://openalex.org/W2332242917","https://openalex.org/W2095900292","https://openalex.org/W2374340569"],"abstract_inverted_index":{"Graph":[0],"patrolling":[1,19,66,200],"algorithms":[2],"provide":[3],"effective":[4],"strategies":[5,20,201],"for":[6,166,177,208],"coordinating":[7,59],"mobile":[8],"robots":[9,61],"in":[10,36,143,188,193],"the":[11,25,37,42,51,69,73,77,109,112,123,147,152,167,185,213],"context":[12],"of":[13,44,111,122,145,151],"autonomously":[14],"surveilling":[15],"valuable":[16],"assets.":[17],"Optimizing":[18],"often":[21],"aims":[22],"to":[23,30,62,86,136,157,173,204],"minimize":[24],"time":[26],"between":[27],"subsequent":[28],"visits":[29],"a":[31,33,64,97,115,119,226],"vertex,":[32],"measure":[34],"known":[35],"literature":[38],"as":[39],"idleness.":[40],"In":[41],"domain":[43],"multi-robot":[45],"patrolling,":[46],"two":[47,103],"approaches":[48],"have":[49],"received":[50],"most":[52,194],"attention":[53],"so":[54],"far.":[55],"The":[56],"first":[57],"involves":[58],"all":[60,128],"follow":[63],"shared":[65,120],"strategy":[67],"covering":[68],"entire":[70],"graph,":[71],"while":[72],"second":[74],"approach":[75],"partitions":[76],"environment":[78,124],"into":[79,114],"disjoint":[80,132],"areas":[81,133],"that":[82,100,117,221],"are":[83],"then":[84,161],"assigned":[85],"individual":[87,137],"robots.":[88,138],"Starting":[89],"from":[90],"these":[91,102],"existing":[92],"solutions,":[93],"this":[94],"paper":[95],"introduces":[96],"new":[98],"method":[99],"bridges":[101],"complementary":[104],"approaches.":[105],"Our":[106],"technique":[107],"splits":[108],"vertices":[110],"graph":[113,153],"partition":[116],"includes":[118],"portion":[121],"patrolled":[125],"collectively":[126],"by":[127],"robots,":[129],"along":[130],"with":[131],"allocated":[134],"exclusively":[135],"This":[139],"problem":[140,168,179,210],"is":[141,155],"formulated":[142],"terms":[144],"minimizing":[146],"maximum":[148],"weighted":[149],"idleness":[150],"and":[154,169,183,190],"shown":[156],"be":[158,217],"NP-hard.":[159],"We":[160,181],"describe":[162],"an":[163],"exact":[164,214],"solution":[165,215],"propose":[170],"various":[171],"heuristics":[172],"efficiently":[174],"compute":[175],"solutions":[176],"large":[178],"instances.":[180],"evaluate":[182],"compare":[184],"proposed":[186,223],"techniques":[187],"simulation":[189],"demonstrate":[191],"that,":[192],"cases,":[195],"our":[196,222],"methods":[197],"produce":[198],"better":[199],"when":[202],"compared":[203],"classic":[205],"solutions.":[206],"Moreover,":[207],"small":[209],"instances":[211],"where":[212],"can":[216],"found,":[218],"we":[219],"show":[220],"heuristic":[224],"has":[225],"competitive":[227],"performance":[228],"ratio.":[229]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}