跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+979新增论文
+781其中 AI 相关
+119已有论文修订
+95新增 AI 导读

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

统计口径与数据新鲜度

统计 2026-11-20 07:48 — 2026-11-21 07:48(北京时间) · 点击数字查看对应简报;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 社区发现

浏览论文库

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

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

Contingency-Aware Planning via Certified Neural Hamilton-Jacobi Reachability

Kasidit Muenprasitivej, Derya Aksaray

原文摘要

Hamilton-Jacobi (HJ) reachability provides formal safety guarantees for dynamical systems, but repeatedly solving the HJ partial differential equation in changing environments limits its use in real-time planning. This paper introduces learning-based reachability and an online safety certification that together enable real-time contingency-aware planning in unknown environments with probabilistic safety guarantees. We use Fourier Neural Operator (FNO) to approximate the HJ solution operator under varying obstacle configurations. To certify the learned reach-avoid set, we recast robust scenario optimization as multiple hypothesis testings over its sublevel sets, which yields a simultaneous guarantee across candidate levels and recovers the largest certifiable volume at the prescribed safety level. Within this certified set, the induced recovery policy is guaranteed to return the system to a safe region in finite time under any admissible disturbance. Numerical results show that the learning and certification pipeline updates reach-avoid sets at real-time rates and is demonstrated on youBot simulation.

cs.RO · eess.SY