Skip to content

论文arXiv 2611.1294911 天前

Maze Runner开源栈:基于线特征与CBF实现迷宫自主导航 ​

本文由 AI 根据公开内容整理,可能有误,请以原文为准:Maze Runner: Autonomous Maze Navigation with Line-Based Localization and Control Barrier Functions(arXiv 2611.12949)

核心内容 ​

针对迷宫等稀疏重复几何环境下的定位漂移与窄廊道安全通行难题,研究团队发布开源自主导航栈Maze Runner。该系统基于C++与ROS 2构建,在Gazebo仿真环境中搭载2D LiDAR的Husarion ROSbot XL上完成端到端验证。实测数据显示,机器人在135米复杂迷宫路径中,基于已知地图的定位RMSE仅为1.0cm,SLAM模式下为24cm;全局规划器返回路径耗时6ms,非线性模型预测控制器(NMPC)平均求解时间11.7ms,严格控制在80ms实时预算内。

技术架构采用RANSAC与总体最小二乘法提取墙线特征并量化不确定性,同时支持EKF定位与在线EKF SLAM两种模式。规划层结合膨胀占据栅格、A视线捷径或前向混合A算法;控制层利用离散时间控制屏障函数(CBFs)约束世界坐标系LiDAR点,确保对墙壁及未建图障碍物的主动避障。核心算法封装为无ROS依赖且经单元测试的独立库,整套系统提供单一可复现构建环境,便于算法移植与二次开发。

关键看点 ​

  • 线特征感知:采用RANSAC与总体最小二乘法从2D LiDAR扫描中提取墙线,输出单线不确定性估计,适配稀疏重复几何结构
  • 双模定位:同一线特征前端驱动EKF已知地图定位(RMSE 1.0cm)与在线EKF SLAM(RMSE 24cm),兼顾精度与建图需求
  • 安全控制:NMPC跟踪轨迹并结合离散时间CBFs约束世界系LiDAR点,防止碰撞墙壁及未建图障碍物,求解均值11.7ms
  • 工程架构:核心算法解耦为ROS-free单元测试库,规划耗时6ms,提供单一可复现环境,支持Husarion ROSbot XL仿真验证

工程与产业观察 ​

该工作为结构化狭窄空间导航提供了高实时性基准方案。其将线特征不确定性与CBF安全约束深度耦合的工程实践,解决了纯视觉/点云在重复纹理下易失效的痛点。无ROS依赖的核心库设计与全栈可复现环境,显著降低了具身智能算法在特种机器人上的部署与验证门槛。

英文摘要 (Abstract) ​

Maze navigation requires localization from sparse, repetitive geometry, planning through narrow corridors, and control that stays safe when the estimate or the map is wrong. We present Maze Runner, an open autonomy stack in C++ and ROS 2 that addresses these needs end to end on a simulated Husarion ROSbot XL with a 2D LiDAR in Gazebo. Perception extracts wall lines from each scan with RANSAC and total least squares, with per-line uncertainty. The same line front end feeds two estimators: an Extended Kalman Filter (EKF) that localizes against a line map built from the maze mesh, and an EKF SLAM variant that builds the line map online. Planning runs online on an inflated occupancy grid with A* plus line-of-sight shortcutting, or with a forward-only Hybrid A*. A nonlinear Model Predictive Controller (NMPC) tracks the plan while discrete-time Control Barrier Functions (CBFs) on world-frame LiDAR points keep the robot clear of walls and unmapped obstacles. The algorithms live in a ROS-free, unit-tested core library, and the whole stack builds and runs from a single reproducible environment. In simulation, the robot drives a 135 m route through the maze with 1.0 cm localization RMSE against the known map and 24 cm in SLAM mode, the planner returns a path in 6 ms, and the NMPC solves in 11.7 ms on average, never exceeding its 80 ms budget.

作者:Alvaro J. Gaona, Lucas G'omez-Velayos, Peter Pasuy-Quevedo

基于本页技术方向关联的整机参数、核心零部件、实测报告与同赛道选型横评。

外部来源

本页事实对应的公开页面,以原文为准。(点击将离开本站)

  1. arXiv 2611.12949:Maze Runner: Autonomous Maze Navigation with Line-Based Localization and Control Barrier Functions ↗访问 2026-11-11