---
格式版本: 2
标题: "Robust Patrol in a Dispersed Environment"
原文链接: "https://arxiv.org/abs/2608.10935"
发布日期: "2026-08-11"
发布时间校准状态: "found"
发布时间需复核: "否"
发布时间来源: "rule:local:strict_original_body"
发布时间证据: "**\\[v1\\]** Tue, 11 Aug 2026 14:03:21 UTC (186 KB)"
发布时间校准原因: "规则确认唯一严格发布时间，来源 local:strict_original_body"
发布时间校准置信度: "high"
发布时间候选数量: 18
发布时间严格候选数量: 6
发布时间原页读取状态: "source template page reused from URL open"
发布时间未找到原因: ""
发布时间校准时间: "2026-08-12T11:21:49+08:00"
发布时间仲裁状态: "skipped"
发布时间仲裁尝试次数: 0
发布时间仲裁耗时毫秒: 0
发现时间: "2026-08-12T11:16:29+08:00"
入库时间: "2026-08-12T03:21:49.842Z"
来源平台: "arXiv 学术论文搜索"
搜索渠道: "source_template"
搜索词: "https://arxiv.org/search/?query=performance&searchtype=all"
匹配关键词:
  - "performance"
相关厂家:
  []
相关专家:
  []
内容类型: "网页"
抓取工具: "Free Fetch + Defuddle"
清洗工具: "Defuddle Markdown + Defuddle/Readability 正文提取"
原始附件:
  []
AI优质: "否"
AI打分: 0
AI分档: "非优质"
AI质检状态: "不通过"
AI打分理由: "内容与项目完全无关，属于数学优化中的巡逻问题，未涉及任何超节点/AI Rack等主题"
AI质检模型: "ali-deepseek-v4-flash"
AI质检时间: "2026-08-12T11:22:03+08:00"
AI主题相关性: 0
AI来源权威性: 0
AI新颖性: 0
AI技术细节: 0
AI商业部署信号: 0
AI完整性: 0
采集批次: "2026年8月12日2点04分20秒"
采集批次ID: "20260812-020420-289"
去重键: "https://arxiv.org/abs/2608.10935"
---

## Mathematics > Optimization and Control

## Title:Robust Patrol in a Dispersed Environment

Authors:[Edward Mellor](https://arxiv.org/search/math?searchtype=author&query=Mellor,+E), [Kevin Glazebrook](https://arxiv.org/search/math?searchtype=author&query=Glazebrook,+K), [Kyle Lin](https://arxiv.org/search/math?searchtype=author&query=Lin,+K), [Rob Shone](https://arxiv.org/search/math?searchtype=author&query=Shone,+R)

[View PDF](https://arxiv.org/pdf/2608.10935) [HTML (experimental)](https://arxiv.org/html/2608.10935v1)

> Abstract:We consider a patrol problem in which a patroller moves among several geographically dispersed locations to detect attackers that arrive over time. Once the patroller arrives at a location, they can spend any amount of time searching for attackers at that location---and detect an attacker there with some location-dependent instantaneous detection rate---before moving to a different location. The objective of the patroller is to minimize the expected time an attacker stays undetected at a location, regardless of where and when the attack occurs. In the special case where travel times are negligible, we elucidate an optimal cyclic policy in which the patroller allocates a fixed fraction of their effort to each location continuously. The patrol problem becomes significantly more challenging when travel times cannot be ignored. We introduce two types of cyclic patrol patterns based on common patrol practice for perimeter patrol and border patrol, respectively, and derive formulae for the expected time to detect an attack in both cases. We also provide an algorithm for finding the best search time parameters in both of these cases. We give several examples where these cycle types perform well and numerically demonstrate that the optimal patrol policy depends highly on the structure and parameters of each patrol problem.

| Subjects: | Optimization and Control (math.OC) |
| --- | --- |
| Cite as: | [arXiv:2608.10935](https://arxiv.org/abs/2608.10935) \[math.OC\] |
|  | (or [arXiv:2608.10935v1](https://arxiv.org/abs/2608.10935v1) \[math.OC\] for this version) |
|  | [https://doi.org/10.48550/arXiv.2608.10935](https://doi.org/10.48550/arXiv.2608.10935) |

## Submission history

From: Robert Shone \[[view email](https://arxiv.org/show-email/64f6a6f5/2608.10935)\]  
**\[v1\]** Tue, 11 Aug 2026 14:03:21 UTC (186 KB)

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2608.10935) | Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))
