跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 21:56各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 21:56库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2607.04689

RCT-AD: Reliability-Aware Context and Temporal BEV Reasoning for End-to-End Autonomous Driving

Argho Dey, Yunfei Yin, Swachha Ray, Md Minhazul Islam, Zheng Yuan, Sijing Xiong, Hongyu Liu, Zhiqiu Huang

原文摘要

Reliable temporal representation learning is important for end-to-end autonomous driving, particularly when visual observations are degraded by occlusion, motion blur, illumination variation, and sensor noise. Existing Bird's-Eye-View (BEV) approaches provide a unified representation for perception and planning; however, temporal features are commonly aggregated across frames without explicitly accounting for the reliability of individual observations. Consequently, low-quality or inconsistent features may propagate through temporal representations and degrade downstream perception, prediction, and planning. To address this problem, we propose RCT-AD, a Reliability-Aware Context and Temporal BEV Reasoning framework for end-to-end autonomous driving that explicitly models feature reliability and temporal consistency within a shared BEV representation. RCT-AD introduces a Reliable Context Awareness (RCA) module that estimates frame-level reliability using spatial, semantic, temporal, and visual-quality cues, and selectively preserves trustworthy information through a reliability-guided temporal memory mechanism. When the current observation is unreliable, historical high-reliability features are aligned and integrated to construct a more stable temporal BEV representation. A Temporal Trajectory Planner models long-term temporal dependencies and multi-agent interactions, while semantic segmentation and motion-guided detection provide complementary supervision for refining the shared BEV representation. Experiments on the nuScenes benchmark demonstrate consistent improvements across perception, motion prediction, and trajectory planning. RCT-AD achieves 61.5 NDS, 52.9 mAP, and 52.3 mIoU while maintaining competitive computational efficiency. These results demonstrate the effectiveness of reliability-aware temporal BEV reasoning for unified perception, prediction, and planning.

cs.RO · cs.CV

版本更新 · v2arXiv:2604.05484

CoEnv: Code-Driven Exploration in Real-to-Sim Digital Twins for Multi-Arm Manipulation

Li Kang, Yutao Fan, Rui Li, Heng Zhou, Yiran Qin, Zhemeng Zhang, Songtao Huang, Xiufeng Song 等 14 位作者

原文摘要

General-purpose coding agents can now write, debug, and refine entire robot programs, but only if they have somewhere to practice. Physical hardware is a poor practice ground: exploratory rollouts are slow to reset and, when several arms share a workspace, unsafe. Generic simulation benchmarks are safe but do not match the geometry, assets, or viewpoints of the workspace where the robot must actually work. We present CoEx (Code-driven Exploration), which lets the agent practice in an executable digital twin of its own deployment workspace. The twin is built by CoEnv, our real-to-sim framework, which reconstructs the physical scene from multi-view RGBD into a physics simulation. Inside it, a centralized code agent explores at the program level, writing a complete multi-arm program, running it in the twin, and refining it against grounded verification (privileged state checks, checkpoint predicates on risky steps, and adaptive viewpoints against inter-arm occlusion). Verified programs transfer to hardware through collision-checked deployment. On five real-world multi-arm tasks with up to three heterogeneous robots, CoEx reaches 70% average success, against 50% for the same system without the code agent (where a VLM must choose every primitive step by step), outperforms two prior VLM-planning frameworks, and produces verified episodes at 3.8-11.7x the ablated rate. Because every verified rollout is also a demonstration, exploration leaves reusable experience behind: a $π_{0.5}$ policy fine-tuned purely on 200 agent-generated rollouts reaches 100% and 70% real-robot success on two tasks, with no human demonstrations.

cs.RO · cs.CV