Hierarchical Path Planning for Wheeled Mobile Robots in Warehouse Logistics via BIRRT* and MPPI

Abstract Warehouse logistics environments contain dense obstacles and narrow passages and impose strict real-time requirements on mobile-robot navigation. This study proposes a BIRRT*-MPPI hierarchical path-planning method to address the slow convergence and redundant paths of conventional RRT* global planning and the limited local adaptability of MPPI in cluttered environments. At the global level, bidirectional RRT* is combined with an environment-perception model, a density-aware dynamic goal-bias strategy, and an on-the-fly inter-tree connection mechanism. The resulting reference path is refined using line-of-sight pruning and spline smoothing. At the local level, an MPPI controller uses an obstacle distance field and a weighted multi-objective cost function under kinematic and control constraints. In the complex maze environment, compared with RRT*, RRT*-APF, and RRT*-DWA, the proposed method reduced the average runtime by 77.8%, 65.7%, and 63.8%, respectively; reduced the average iteration count by 75.2%, 58.5%, and 71.9%, respectively; and shortened the average path length by 18.7%, 2.4%, and 2.1%, respectively. Across four static simulation environments, the proposed method generally achieved shorter planning times, fewer iterations, and shorter paths than the comparison methods. These results demonstrate the potential of the hierarchical planner for wheeled mobile-robot navigation in structured warehouse environments.

Authors

Institutions

Publication Details

Journal
Engineering Research Express
Published
2026-11-17
DOI
https://doi.org/10.1088/2631-8695/aec36a
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Hierarchical Path Planning for Wheeled Mobile Robots in Warehouse Logistics via BIRRT* and MPPI

Yali Xi
3 links
Engineering Research Express
Robotic Path Planning Algorithms
article

Hierarchical Path Planning for Wheeled Mobile Robots in Warehouse Logistics via BIRRT* and MPPI

Yali Xi
article en

Abstract

Abstract Warehouse logistics environments contain dense obstacles and narrow passages and impose strict real-time requirements on mobile-robot navigation. This study proposes a BIRRT*-MPPI hierarchical path-planning method to address the slow convergence and redundant paths of conventional RRT* global planning and the limited local adaptability of MPPI in cluttered environments. At the global level, bidirectional RRT* is combined with an environment-perception model, a density-aware dynamic goal-bias strategy, and an on-the-fly inter-tree connection mechanism. The resulting reference path is refined using line-of-sight pruning and spline smoothing. At the local level, an MPPI controller uses an obstacle distance field and a weighted multi-objective cost function under kinematic and control constraints. In the complex maze environment, compared with RRT*, RRT*-APF, and RRT*-DWA, the proposed method reduced the average runtime by 77.8%, 65.7%, and 63.8%, respectively; reduced the average iteration count by 75.2%, 58.5%, and 71.9%, respectively; and shortened the average path length by 18.7%, 2.4%, and 2.1%, respectively. Across four static simulation environments, the proposed method generally achieved shorter planning times, fewer iterations, and shorter paths than the comparison methods. These results demonstrate the potential of the hierarchical planner for wheeled mobile-robot navigation in structured warehouse environments.

Engineering Research Express
Lanzhou Resources & Environment Voc-Tech University (CN)
Industry, innovation and infrastructure
Robotic Path Planning Algorithms
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.

Laika access coming soon