{"id":"https://openalex.org/W4406619973","doi":"https://doi.org/10.1145/3704814.3704826","title":"Optimization of Agent Patrol Algorithm for Patrolling Set of Points with Different Frequency","display_name":"Optimization of Agent Patrol Algorithm for Patrolling Set of Points with Different Frequency","publication_year":2024,"publication_date":"2024-11-28","ids":{"openalex":"https://openalex.org/W4406619973","doi":"https://doi.org/10.1145/3704814.3704826"},"language":"en","primary_location":{"id":"doi:10.1145/3704814.3704826","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3704814.3704826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Computer Science and Application Engineering","raw_type":"proceedings-article"},"type":"conference-paper","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/A5055596195","display_name":"Zhifei Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Zhifei Chen","raw_affiliation_strings":["Department of Computer Science, University College London, London, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-3035-1488","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University College London, London, United Kingdom","institution_ids":["https://openalex.org/I45129253"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5055596195"],"corresponding_institution_ids":["https://openalex.org/I45129253"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"56","last_page":"59"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"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.9990000128746033,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9954000115394592,"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/T12288","display_name":"Optimization and Search Problems","score":0.9912999868392944,"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/patrolling","display_name":"Patrolling","score":0.9672176837921143},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6455621123313904},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5835158228874207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49240243434906006}],"concepts":[{"id":"https://openalex.org/C110698143","wikidata":"https://www.wikidata.org/wiki/Q651389","display_name":"Patrolling","level":2,"score":0.9672176837921143},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6455621123313904},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5835158228874207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49240243434906006},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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":1,"locations":[{"id":"doi:10.1145/3704814.3704826","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3704814.3704826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th International Conference on Computer Science and Application Engineering","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":7,"referenced_works":["https://openalex.org/W1991227700","https://openalex.org/W2047632181","https://openalex.org/W2118217956","https://openalex.org/W2157824860","https://openalex.org/W2939752533","https://openalex.org/W3158940377","https://openalex.org/W4289521015"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","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"],"abstract_inverted_index":{"The":[0],"design":[1],"of":[2,80,99],"agent":[3],"patrol":[4,14,27],"system":[5,28],"with":[6,39,87],"different":[7],"task":[8],"targets":[9],"needs":[10],"to":[11,24,48,107],"develop":[12],"reasonable":[13],"algorithms":[15,64],"and":[16,35,52,61,72,145],"strategies.":[17],"This":[18],"work":[19],"proposes":[20],"an":[21],"efficient":[22],"algorithm":[23,34,38,90,102,120,141],"optimize":[25],"robotic":[26],"based":[29],"on":[30],"the":[31,36,49,53,58,78,81,96,100,112,118,122,129,140],"pinwheel":[32,89],"scheduling":[33,63],"greedy":[37],"optimal":[40],"characteristics.":[41],"It":[42],"can":[43],"perform":[44],"patrolling":[45,68,113],"tasks":[46],"according":[47],"checkpoints":[50,69],"number":[51],"visit":[54],"frequency":[55],"provided":[56],"by":[57,125,135],"user.":[59],"One-dimensional":[60],"two-dimensional":[62],"are":[65],"designed":[66],"for":[67],"in":[70,147],"linear":[71],"planar":[73],"distributions":[74],"respectively.":[75],"To":[76],"assess":[77],"effectiveness":[79],"optimized":[82],"algorithms,":[83],"a":[84],"comparison":[85],"test":[86],"traditional":[88],"is":[91,103,133],"conducted,":[92],"which":[93],"shows":[94],"that":[95,139],"time":[97,124],"complexity":[98],"combined":[101,119],"reduced":[104,134],"from":[105],"O(n\u00b2)":[106],"O(log":[108],"n),":[109],"significantly":[110],"improving":[111],"efficiency.":[114],"In":[115],"real-world":[116],"test,":[117],"reduces":[121],"running":[123],"about":[126],"25%,":[127],"while":[128],"peak":[130],"memory":[131],"usage":[132],"nearly":[136],"17%,":[137],"proving":[138],"has":[142],"better":[143],"stability":[144],"scalability":[146],"resource-constrained":[148],"systems.":[149]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}