跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+806新增论文
+644其中 AI 相关
+92已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-20 08:48 · 全站最近入库:2026-11-20 19:58各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-20 08:48最近发现新增版本:2026-11-20 19:58库内论文最新更新时间:2026-11-20 02:59

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

28,961 已收录论文24,030 AI 相关8,912 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-20 08:46(北京时间)
新论文 · v1arXiv:2611.25558

Communication-Aware UAV Spatio-Temporal Relay Cooperation and Planning in Complex Urban Environments

Haoyu Zhang, Yingjie He, Zehao Zhuo, Xiqun Chen, Zhenyu Gao

原文摘要

Unmanned aerial vehicles (UAVs) are increasingly deployed in low-altitude urban airspace for delivery, emergency response, and other applications. However, UAV mobility across spatially heterogeneous urban communication environments can lead to time-varying communication outages, disrupting mission execution and compromising flight safety. To address this challenge, this paper proposes a Spatio-Temporal Relay Cooperation and Planning (ST-RCP) framework that leverages delivery UAVs as opportunistic communication relays for disconnected UAVs without requiring additional communication infrastructure. The framework predicts communication blind-spot events over a finite planning horizon, constructs a helper-event compatibility graph, and jointly optimizes relay selection, obstacle-aware trajectory replanning, and communication-aware scheduling. Multiple planners are evaluated to investigate the trade-offs among communication coverage, computational cost, and energy consumption. Experiments based on real-world traffic scenarios compare the performance of ST-RCP against baseline methods. In the peak scenario, ST-RCP improves descent-phase communication coverage by 29.93% compared with the base-station baseline and by 27.38%, 22.02%, and 15.20% compared with configurations using one, two, and three dedicated relay UAVs, respectively. Process flexibility analysis demonstrates that predictive task-aware relaying expands the pool of feasible relay resources and improves communication continuity while maintaining the feasibility of delivery missions. These findings demonstrate the potential of trajectory-enabled UAV coordination to enhance the safety and resilience of urban aerial operations.

cs.RO

版本更新 · v2arXiv:2607.14821

Blurring Modal Boundaries: A Unified Survey from Single- to Multi-Modal Person Re-ldentification

Xiao Wang, Bing Wang, Bin Yang, Cuiqun Chen, Xin Xu, Mang Ye

原文摘要

Person re-identification (ReID) serves as a critical component in intelligent surveillance systems, aiming to match identities across disjoint camera networks. While traditional methods primarily rely on single-modal RGB imagery, they are often constrained by environmental challenges such as low illumination and occlusion. To overcome these limitations, the field is rapidly evolving toward cross-modal and multi-modal paradigms. This survey presents a comprehensive overview of this transition, systematically reviewing key cross-modal tasks including visible-infrared (VI-ReID), text-image (TI-ReID), sketch-based (Sketch-ReID), and the emerging Non-Line-of-Sight (NLOS) ReID, which extends perception beyond direct visibility. Furthermore, we examine tri-spectral and multi-modal fusion ReID, discussing how complementary information from diverse sensors enhances robustness. Beyond summarizing datasets, challenges, and methodologies, we propose a Transformer-based baseline framework for visible-infrared ReID, designed to effectively capture modality-invariant features. Finally, based on the current landscape, we outline several promising directions for future research.

cs.CV

新论文 · v1arXiv:2611.24005

How Reward Gain Imbalance Shapes Ranking: Rethinking Rubric-Based Reward Aggregation

Zhengyuan Fan, Zhonghua Wu, Tianyu Cheng, Qun Chen

原文摘要

Rubric-based reinforcement learning constructs rewards for aligning large language models with human preferences, typically by equally aggregating continuous scores that a judge assigns to individual criteria. However, scoring heterogeneity across criteria can distort candidate rankings. Existing work has focused on improving judges, learning criterion weights, or refining aggregation, whereas the interaction between scoring heterogeneity and ranking remains insufficiently understood. We formalize this heterogeneity as \emph{reward gain imbalance}: each criterion enters the aggregated reward with its own reward gain, the gap between its expected scores on satisfied and unsatisfied responses. Counterintuitively, our experiments show that removing this imbalance, even with ground-truth labels, lowers ranking accuracy. To explain this, we derive an exact decomposition of the reward difference between any two candidates into a base satisfaction signal, a reward gain imbalance term, and a residual term, showing that reward gain imbalance can attenuate or amplify the base signal, and finding that misrankings usually concentrate on pairs where it attenuates. Guided by this analysis, we propose the adaptive \textbf{D}ual-\textbf{C}enter \textbf{C}lipping aggregation (DCC), which bounds each criterion's contribution to the reward difference instead of simply removing the imbalance. Using only the scores of the current candidate group, it determines a clipping interval that imposes a common upper bound on per-criterion score differences between candidates, limiting the excessive influence of extreme scores while preserving continuous judgment information....

stat.ML · cs.AI