{"id":"https://openalex.org/W2968153723","doi":"https://doi.org/10.1109/eucnc.2019.8802015","title":"A Multi-Robot Cooperative Patrolling Algorithm with Sharing Multiple Cycles","display_name":"A Multi-Robot Cooperative Patrolling Algorithm with Sharing Multiple Cycles","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2968153723","doi":"https://doi.org/10.1109/eucnc.2019.8802015","mag":"2968153723"},"language":"en","primary_location":{"id":"doi:10.1109/eucnc.2019.8802015","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eucnc.2019.8802015","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 European Conference on Networks and Communications (EuCNC)","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/A5052178012","display_name":"Youngtaek Hong","orcid":"https://orcid.org/0000-0003-2104-5905"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Youngtaek Hong","raw_affiliation_strings":["School of Electrical and Electronic Engineering, Yonsei University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Electronic Engineering, Yonsei University, Seoul, South Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074792730","display_name":"Yeosun Kyung","orcid":null},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Yeosun Kyung","raw_affiliation_strings":["School of Electrical and Electronic Engineering, Yonsei University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Electronic Engineering, Yonsei University, Seoul, South Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027772072","display_name":"Seong\u2010Lyun Kim","orcid":"https://orcid.org/0000-0002-5228-9913"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seong-Lyun Kim","raw_affiliation_strings":["School of Electrical and Electronic Engineering, Yonsei University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Electronic Engineering, Yonsei University, Seoul, South Korea","institution_ids":["https://openalex.org/I193775966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052178012"],"corresponding_institution_ids":["https://openalex.org/I193775966"],"apc_list":null,"apc_paid":null,"fwci":0.1768,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.53353659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"300","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.998199999332428,"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.998199999332428,"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.9916999936103821,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.98580002784729,"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/hamiltonian-path","display_name":"Hamiltonian path","score":0.7039580345153809},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6855873465538025},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6148130297660828},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5156584978103638},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5134680867195129},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5102739334106445},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.4831806719303131},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47172728180885315},{"id":"https://openalex.org/keywords/patrolling","display_name":"Patrolling","score":0.4607814848423004},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45661088824272156},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4375850260257721},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.41471365094184875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3806496858596802},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.2650860548019409},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2184462547302246},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.14916926622390747}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.7039580345153809},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6855873465538025},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6148130297660828},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5156584978103638},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5134680867195129},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5102739334106445},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.4831806719303131},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47172728180885315},{"id":"https://openalex.org/C110698143","wikidata":"https://www.wikidata.org/wiki/Q651389","display_name":"Patrolling","level":2,"score":0.4607814848423004},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45661088824272156},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4375850260257721},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.41471365094184875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3806496858596802},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.2650860548019409},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2184462547302246},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.14916926622390747},{"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/eucnc.2019.8802015","is_oa":false,"landing_page_url":"https://doi.org/10.1109/eucnc.2019.8802015","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 European Conference on Networks and Communications (EuCNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W119501476","https://openalex.org/W1929098649","https://openalex.org/W2108880818","https://openalex.org/W2124111503","https://openalex.org/W2125298348","https://openalex.org/W2411650265","https://openalex.org/W2499840057","https://openalex.org/W2787007285","https://openalex.org/W6678634614"],"related_works":["https://openalex.org/W4387272283","https://openalex.org/W4299647289","https://openalex.org/W1618127724","https://openalex.org/W2155631825","https://openalex.org/W2952856011","https://openalex.org/W2011032737","https://openalex.org/W2078431586","https://openalex.org/W2069133957","https://openalex.org/W140019436","https://openalex.org/W2157110847"],"abstract_inverted_index":{"In":[0,18],"this":[1],"paper,":[2],"a":[3,25,91,95],"multiple":[4,164],"Cycle":[5],"Sharing":[6],"Algorithm":[7],"(CSA)":[8],"is":[9,36,55,89,126,138],"proposed":[10],"to":[11,38,85,121,128],"solve":[12],"the":[13,19,32,40,50,72,107,122,130,133,147,153,160,169],"Multi-Robot":[14],"Patrolling":[15],"Problem":[16,125],"(MRPP).":[17],"MRPP,":[20],"robots":[21,62,76],"visit":[22,63,77],"vertices":[23,35,64,78],"in":[24,94,109],"graph":[26,47,51,73,143,161],"continuously.":[27],"The":[28,81,119],"evaluation":[29],"metric":[30],"of":[31,34,42,71,132],"idleness":[33,48,52,60,74],"considered":[37],"evaluate":[39],"performance":[41],"an":[43,139],"algorithm.":[44],"Minimizing":[45],"average":[46,59],"and":[49,67,113],"standard":[53,69,87],"deviation":[54,70,88],"covered":[56],"because":[57],"smaller":[58,68],"means":[61,75],"more":[65,79],"often,":[66],"regularly.":[80],"most":[82],"effective":[83],"way":[84],"minimize":[86,129],"finding":[90,152],"Hamiltonian":[92,98,135],"cycle":[93,99],"graph.":[96],"A":[97],"visits":[100],"each":[101],"vertex":[102,108],"exactly":[103],"once,":[104],"except":[105],"for":[106,151],"which":[110],"it":[111,117],"starts":[112],"ends,":[114],"thus":[115],"visiting":[116],"twice.":[118],"solution":[120],"Traveling":[123],"Salesman":[124],"known":[127],"cost":[131,155],"corresponding":[134],"cycle.":[136],"It":[137],"NP-complete":[140],"problem.":[141],"If":[142],"size":[144],"becomes":[145],"larger":[146],"longer":[148],"time":[149,171],"required":[150],"minimum":[154],"cycle;":[156],"however,":[157],"by":[158],"partitioning":[159],"correctly":[162],"into":[163],"sections":[165],"with":[166],"cooperative":[167],"robots,":[168],"calculation":[170],"can":[172],"be":[173],"reduced":[174],"remarkably.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}