跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

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

arXiv 最近完成扫描:2026-11-23 01:07 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-23 01:07最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

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

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

Kairos: A Unified PDDL Planner for Robots: Plans in Milliseconds, with a Guarantee for Every Answer

Francisco Martín Rico, Esther Aguado González, Francisco Miguel Moreno Olivo, Rodrigo Pérez Rodríguez, José Miguel Guerrero Hernández, Francisco J. Rodríguez Lera

原文摘要

Robots that plan while they act need a task planner that reads the models their designers write, answers within milliseconds, and says what each answer means. Models are written in the Planning Domain Definition Language (PDDL), which has grown from classical planning to durative actions, numeric resources, time windows and continuous change, while planners cover one fragment each and differ in what their failures mean. The contribution in artificial intelligence is Kairos, a single planner, not a portfolio of existing planners, that covers the whole language and derives what each answer guarantees from the search that produced it. We prove when the exhaustion of a search shows that no plan exists, and give a relaxation of temporal tasks that proves unsolvability where temporal search cannot. For the compression of durative actions, we give a criterion on the values that actions read, prove that compression is sound, and show that it is not complete, so its failure is never reported as a proof. An independent validator checks every plan. The engineering application is on-line task planning for robots: Kairos is open source, packaged for the Robot Operating System, and the default planner of a widely used planning framework. On 1,756 public tasks from nine suites, Kairos solves more tasks than the strongest evaluated planner of each suite within 100 milliseconds, 1 second and 30 seconds; it proves ten of eleven unsolvable tasks, and handles each of the seventeen language features probed, where no other planner handles more than eight.

cs.AI · cs.RO

新论文 · v1arXiv:2611.19894

EasyNav: A Modular Architecture for Real-Time Navigation Across Heterogeneous Robot Environments

Francisco Martín Rico, Francisco Miguel Moreno, Juan Sebastián Cely Gutiérrez, Esther Aguado, Miguel Ángel De Miguel Paraíso, José Miguel Guerrero

原文摘要

Most robot navigation stacks implicitly bind mapping, localization, planning, and control to specific representations and data flows, yielding architectures hard to extend, compare experimentally, or reason about end-to-end timing. This is critical in heterogeneous scenarios, where multiple spatial representations, sensing modalities, and coordinate frames coexist and evolve at different rates. This paper presents a navigation architecture centered on an explicit, shared navigation state that serves as the sole interaction interface between modular components. Constraining mapping, localization, planning, and control to operate over this shared state enables interchangeable, representation-agnostic pipelines under explicit compatibility and timing contracts. We realize this architecture as EasyNav, an open source ROS 2 framework, and validate it through real-robot experiments, including indoor navigation with laser sensing and large-scale indoor-outdoor navigation with GPS and 3D LiDAR across multi-level routes. Compared with Nav2 under matched conditions, EasyNav reduces reaction latency from 377 to 33 ms indoors and from 71 to 8 ms outdoors, while also using less CPU and memory.

cs.RO