Comparative Analysis of Local Trajectory Planning Algorithms in ROS2

Local path planners are essential for real-time obstacle avoidance, particularly in unpredictable industrial environments. This study compares three ROS 2 local path-planning algorithms: Dynamic Window Approach (DWB), Model Predictive Path Integral (MPPI), and Regulated Pure Pursuit (RPP). These planners are part of the Robot Operating System 2 (ROS 2) navigation stack (Nav2), with DWB and MPPI as built-in controllers, and RPP integrated as a controller option.While previous studies have focused on simulations or simple real-world environments with static obstacles, few have examined dynamic and unpredictable scenarios. To address this, experiments were conducted with a Clearpath Jackal robot in environments with static and dynamic obstacles. Key metrics, including distance to obstacles, frequency of recovery behaviors, and path smoothness, were used to compare the planners performance in both real-world and simulated settings.MPPI offers a strong balance across all metrics, making it ideal for dynamic environments requiring both safety and efficiency. DWB excels in fast navigation, though with closer proximity to obstacles, while RPP produces smooth paths but struggles in highly dynamic environments. These results provide valuable insights for selecting the right local path planner for autonomous robots in industrial applications like manufacturing and warehousing.

Authors

Institutions

Publication Details

Published
2025-04-14
DOI
https://doi.org/10.1109/simpar62925.2025.10979015
Citations
3
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
3.83
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Comparative Analysis of Local Trajectory Planning Algorithms in ROS2

Hendrik Rose, Philipp Braun, Seifalla Mohamed Elbouhy, Asan Adamanov
3 citations
Robotic Path Planning Algorithms
3.83
article

Comparative Analysis of Local Trajectory Planning Algorithms in ROS2

Hendrik Rose, Philipp Braun, Seifalla Mohamed Elbouhy, Asan Adamanov
article en
3 citations

Abstract

Local path planners are essential for real-time obstacle avoidance, particularly in unpredictable industrial environments. This study compares three ROS 2 local path-planning algorithms: Dynamic Window Approach (DWB), Model Predictive Path Integral (MPPI), and Regulated Pure Pursuit (RPP). These planners are part of the Robot Operating System 2 (ROS 2) navigation stack (Nav2), with DWB and MPPI as built-in controllers, and RPP integrated as a controller option.While previous studies have focused on simulations or simple real-world environments with static obstacles, few have examined dynamic and unpredictable scenarios. To address this, experiments were conducted with a Clearpath Jackal robot in environments with static and dynamic obstacles. Key metrics, including distance to obstacles, frequency of recovery behaviors, and path smoothness, were used to compare the planners performance in both real-world and simulated settings.MPPI offers a strong balance across all metrics, making it ideal for dynamic environments requiring both safety and efficiency. DWB excels in fast navigation, though with closer proximity to obstacles, while RPP produces smooth paths but struggles in highly dynamic environments. These results provide valuable insights for selecting the right local path planner for autonomous robots in industrial applications like manufacturing and warehousing.

Universität Hamburg (DE), Hamburg University of Technology (DE)
Sustainable cities and communities
Openalex Percentile: Top 7%
Robotic Path Planning Algorithms
3.83
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.