跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+1085新增论文
+884其中 AI 相关
+130已有论文修订
+59新增 AI 导读

arXiv 最近完成扫描:2026-11-18 04:28 · 全站最近入库:2026-11-18 19:45各信源进度 →

统计口径与数据新鲜度

统计 2026-11-17 23:16 — 2026-11-18 23:16(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-18 04:28最近发现新增版本:2026-11-18 19:45库内论文最新更新时间:2026-11-18 08:00

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

26,870 已收录论文22,374 AI 相关8,156 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-18 04:27(北京时间)
版本更新 · v2arXiv:2608.27507

Learning Complementary Routes for Scouting Persimmon Orchards during Shoot Growth with CoverShare

Junhao Cao, Tao Wang, Zipeng Xie, Hongyi Xia, Jianian Wu, Lixia Huang

原文摘要

At the study orchard, scouting during persimmon shoot growth focuses on leaf color change, leaf area, and internode length. Several routes may share an access lane, yet each can offer a view of row segments that the others miss. We introduce CoverShare to learn complementary routes under a fixed action budget. Within Policy Gradient for Parallel State Entropy maximization (PGPSE), CoverShare redistributes auxiliary rewards according to the state coverage lost when each policy is omitted and the number of policies visiting each state. It preserves the pooled entropy objective and total auxiliary reward. We simulated the annotated road network of a 6.7-ha site with 107 observable persimmon scouting units across five zones. At 40 actions per route, six distinct policies covered an expected 17.84 units perinspection, compared with 8.28 for six independent runs of one policy, averaged across eight training seeds. With the same policies trained on 40-action routes, extending each inspection route to 80 and 120 actions raised coverage to 22.52 and 28.38 units. Across seven public discrete-state tasks, CoverShare increased state support by a mean of 16.29% over the team-entropy baseline. Controlled ablations identified leave-one-policy-out coverage as the main contributor to these gains.

cs.LG · cs.AI