跳到正文
研踪PaperTrail

YOUR RESEARCH, IN SIGHT

让下一篇重要论文,不再错过。

覆盖计算机全学科,以 AI 为快捷入口。关注方向、作者和关键词,把发现变成持续的研究积累。

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

全站更新概况

+1072新增论文
+845其中 AI 相关
+94已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-09 19:37 · 全站最近入库:2026-11-09 13:22各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-09 19:37最近发现新增版本:2026-11-09 13:22库内论文最新更新时间:2026-11-07 02:59

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

18,172 已收录论文15,506 AI 相关4,527 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-09 19:35(北京时间)
版本更新 · v3arXiv:2606.16881

SGM-SLAM: Scene Graph Matching for Data-Efficient Distributed SLAM

Yewei Huang, Tixiao Shan, Abhinav Rajvanshi, Niluthpol Chowdhury Mithun, Yaxuan Li, Brendan Englot, Han-Pang Chiu

原文摘要

We introduce a data-efficient distributed Simultaneous Localization and Mapping (SLAM) framework for multi-robot operation in GPS-denied and communication-constrained environments. The framework is designed for teams of robots equipped with LiDAR, cameras, and inertial sensors, where robots may operate from independently initialized local coordinate frames and share only limited spatial overlap. Our approach constructs a scene graph by using fused RGB-LiDAR point clouds to generate both a semantically segmented point cloud layer, and a layer of discrete bounded objects, to accompany estimated robot trajectories. Scene graph matching is performed collaboratively through exchanging and matching object data with neighboring robots. To maximize communication efficiency, we utilize a multi-step data exchange and optimization process. We demonstrate the effectiveness and communication efficiency of the proposed approach using real-world datasets containing limited trajectory overlap, viewpoint variation, repeated structures, and degraded visual conditions.

cs.RO

新论文 · v1arXiv:2611.08445

用于在线预测对手动作的隐马尔可夫偏好模型

A Hidden Markov Preference Model for Online Prediction of Adversary Actions

Angel Daruna, Michael Cogswell, Tixiao Shan, Yi Yao, Han-Pang Chiu, Ajay Divakaran

AI 速读 基于摘要

作者提出一种隐马尔可夫偏好模型,用潜在行为机制状态和可行性掩码的动作树,在线预测攻击者的下一步动作。

cs.LG

查看原文摘要

A defender anticipating an attacker needs a probability distribution over the attacker's next action from information available before that action occurs. Two structures complicate this: the attacker's behavioral regime persists and can switch within an episode, and each action combines an operation with state-dependent arguments whose feasible values change over time. We capture both with a hidden Markov model whose latent state is the active regime and whose regime-conditioned action law is defined on a feasibility-masked tree of executable actions. The same likelihood forms the next-action distribution and updates the regime belief once the action is seen, and a partially observed prefix contributes its resolved local factors. Estimation separates into convex logistic fits that Baum-Welch reuses when regimes are unlabeled. We derive a reach-weighted nodewise KL expression for regime information, a sequence-wise log-loss bound for switching regime paths, and a uniform fallback guarantee. On the CAGE 2 cyber defense benchmark the filtered latent state is worth 0.8 nats per step, and after a controller switch the loss begins to fall in three steps against ten for a recurrent baseline.

版本更新 · v3arXiv:2509.23626

Fieldable Low-Light Multi-Task Perception via Foundation-Model-Assisted Domain Adaptation

Beomseok Kang, Niluthpol Chowdhury Mithun, Mikhail Sizintsev, Han-Pang Chiu, Supun Samarasekera

原文摘要

Fieldable low-light perception systems require both semantic and geometric scene understanding under severe domain shift and embedded compute constraints. We present FAMDA, a foundation-model-assisted self-training framework for unsupervised domain adaptation (UDA) in multi-task dense prediction. The framework integrates segmentation and depth foundation models into a self-training paradigm to generate high-quality pseudo-labels for the target domain, distilling their generalization capabilities into a single lightweight student network. To connect the method to deployment, we instantiate the adapted student on a compact handheld low-light prototype with DomiNite imaging and Jetson Orin Nano embedded compute. We evaluate on standard synthetic-to-real multi-task UDA benchmarks for comparison with prior work and on our field-collected low-light dataset to validate daytime-to-low-light adaptation in the target application setting. Across these evaluations, the proposed approach achieves strong segmentation and depth accuracy with substantially lower memory use and inference latency than direct foundation-model inference, demonstrating a practical path toward embedded multi-task perception for low-light field systems.

cs.CV