跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 04:40 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-15 04:40最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

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

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

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

找到 2 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 04:38(北京时间)
新论文 · v1arXiv:2611.11646

ColNav: Uncertainty-Aware Spacetime Collision Checking with Bounding Volume Hierarchies

Sanjeev Ramkumar Sudha, Lars Ivar Hatledal, Erlend M. Coates

原文摘要

Safe navigation for mobile robots in dynamic and uncertain environments requires planning paths that avoid collisions with other moving targets. Typically this involves forward propagating the robot motion and checking for collisions at sampled points in space and time. Such methods can miss collisions between sampled points and are not robust to uncertainty in the state estimates. We propose ColNav, a robust collision check formulation with geometric volumes. The key aspect of our approach is encoding the uncertainty in the targets' and the ego robot's positions and velocities into spacetime tubes, in two variants that consume bounded-set and Gaussian uncertainty descriptions, respectively. The tubes are organised in bounding volume hierarchies, so that a single tree traversal covers the entire horizon, rather than testing sampled time instants, and returns a robust geometric certificate together with an estimate of the time to collision. Static and dynamic obstacles share the same representation. Our approach reaches the goal with a 100% success rate under prediction model mismatch, where the best baseline reaches 65%, and maintains up to three times the clearance in dense traffic. We also validate real-time operation on a physical robot.

cs.RO

版本更新 · v2arXiv:2606.12019

MPPI-based Informative Trajectory Planning for Search and Capture of Drifting Targets with ASVs

Sanjeev Ramkumar Sudha, Marija Popović, Erlend M. Coates

原文摘要

Autonomous surface vehicles (ASVs) offer an efficient solution for environmental cleanup as well as search and rescue operations in open waters. Targets in these settings drift continuously, so efficient search must balance exploration of unobserved regions with tracking of known targets. However, most target tracking and pursuit scenarios consider simple guidance behaviours and short-term predictions for decision-making. In this letter, we address the problem of search and capture of multiple drifting targets, such as litter, in marine environments, using an adaptive informative planning approach. A key aspect of our strategy is a spatiotemporal informative planning method based on model predictive path integral (MPPI) control, a sampling-based model predictive control method. Our planner balances search and tracking objectives with a cost design that couples spatiotemporal target drift predictions and exploration objectives. The planner directly generates kinematic-level commands by optimising continuous trajectories over long horizons. In the interception stage, we use pure pursuit guidance for physical capture of the targets. Simulations show that our planner captures up to 18% more targets than the strongest baseline, proving its efficiency for environmental cleanup. Finally, we validate our approach in field trials with an ASV.

cs.RO