Skip to content
AI News HubLIVE
Original source2 min read

Maze Runner: Autonomous Maze Navigation with Line-Based Localization and Control Barrier Functions

Summary

Maze Runner is an open-source C++/ROS 2 autonomy stack that enables end-to-end maze navigation on a simulated Husarion ROSbot XL with a 2D LiDAR. It extracts wall lines with RANSAC and total least squares, supports EKF localization and EKF SLAM, plans with A* or Hybrid A*, and controls with NMPC plus discrete-time control barrier functions. In simulation, the robot completes a 135 m route with 1.0 cm localization RMSE (known map) and 24 cm (SLAM), planning in 6 ms and NMPC solving in 11.7 ms on average within an 80 ms budget.

SourcearXiv RoboticsAuthor: Alvaro J. Gaona, Lucas G\'omez-Velayos, Peter Pasuy-Quevedo
Maze Runner: Autonomous Maze Navigation with Line-Based Localization and Control Barrier Functions
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 6 Nov 2026]

Title:Maze Runner: Autonomous Maze Navigation with Line-Based Localization and Control Barrier Functions

View a PDF of the paper titled Maze Runner: Autonomous Maze Navigation with Line-Based Localization and Control Barrier Functions, by Alvaro J. Gaona and 2 other authors

View PDF HTML (experimental)

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.

Comments: 10 pages, 8 figures, 1 table. Code: this https URL

Subjects:

Robotics (cs.RO); Systems and Control (eess.SY)

Cite as: arXiv:2611.12949 [cs.RO]

(or arXiv:2611.12949v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2611.12949

arXiv-issued DOI via DataCite

Submission history

From: Alvaro Gaona [view email] [v1] Fri, 6 Nov 2026 22:32:59 UTC (704 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Maze Runner: Autonomous Maze Navigation with Line-Based Localization and Control Barrier Functions, by Alvaro J. Gaona and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.RO

new | recent | 2026-11

Change to browse by:

cs cs.SY eess eess.SY

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Presents a complete C++/ROS 2 autonomy stack covering perception, localization, planning, and control.
  • Uses RANSAC and total least squares for line-based wall extraction with uncertainty, supporting both known-map EKF and online EKF SLAM.
  • Combines NMPC with discrete-time control barrier functions on LiDAR points for safety in narrow corridors and against unmapped obstacles.
  • Demonstrates 135 m autonomous maze traversal with 1.0 cm localization RMSE (known map) and 24 cm (SLAM), 6 ms planning, and 11.7 ms average NMPC solve time.

Highlights and analysis are generated automatically and may contain errors. Check the original source.