An Adaptive Bounded Hybrid A* Planner for Autonomous Mining Trucks in Confined Unstructured Mining Environments

Automated valet-parking trajectory planning has been widely studied in structured environments, whereas its counterpart in unstructured environments remains insufficiently explored. The working face of an open-pit mine is a typical unstructured production environment, where autonomous mining trucks (AMTs) must perform collision-free and kinematically feasible maneuvers under irregular boundaries, locally confined passages, large vehicle footprints, and strict terminal pose requirements. To address this problem, we introduce an adaptive bounded Hybrid A* planner for AMT maneuver planning at mining working faces. The proposed planner integrates local-geometry-aware top-K motion primitive scheduling, adaptive rollout-length assignment, progress-reward-based dual-cost correction, and bounded continuation after the first feasible Reeds–Shepp closure. By ranking and filtering motion primitives according to obstacle clearance, maneuver margin, goal distance, and heading alignment, the planner reduces ineffective successor generation during search. By adapting rollout lengths to local spatial constraints and primitive curvature, it improves the consistency between expansion scale and environmental structure. By retaining the first feasible Reeds–Shepp connection as an initial upper bound and continuing bounded refinement, it improves the final returned path beyond the first feasible solution. Comparative studies demonstrate that, relative to the conventional Hybrid A* baseline, the proposed planner reduces the average final planning time, generated nodes, and final path cost by 54.73%, 74.10%, and 12.76%, respectively, in the abstract mine-like scenarios. In the real-map-derived mining working-face scenarios, the corresponding reductions are 25.12%, 37.98%, and 7.15%, respectively. These results indicate that the proposed method reduces search redundancy while improving the efficiency–quality trade-off in confined and geometrically irregular working-face environments.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2026-09-09
DOI
https://doi.org/10.3390/s26185720
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
article

An Adaptive Bounded Hybrid A* Planner for Autonomous Mining Trucks in Confined Unstructured Mining Environments

Zijie Meng, Ruixin Zhang
Sensors
Robotic Path Planning Algorithms
article

An Adaptive Bounded Hybrid A* Planner for Autonomous Mining Trucks in Confined Unstructured Mining Environments

Zijie Meng, Ruixin Zhang
article en

Abstract

Automated valet-parking trajectory planning has been widely studied in structured environments, whereas its counterpart in unstructured environments remains insufficiently explored. The working face of an open-pit mine is a typical unstructured production environment, where autonomous mining trucks (AMTs) must perform collision-free and kinematically feasible maneuvers under irregular boundaries, locally confined passages, large vehicle footprints, and strict terminal pose requirements. To address this problem, we introduce an adaptive bounded Hybrid A* planner for AMT maneuver planning at mining working faces. The proposed planner integrates local-geometry-aware top-K motion primitive scheduling, adaptive rollout-length assignment, progress-reward-based dual-cost correction, and bounded continuation after the first feasible Reeds–Shepp closure. By ranking and filtering motion primitives according to obstacle clearance, maneuver margin, goal distance, and heading alignment, the planner reduces ineffective successor generation during search. By adapting rollout lengths to local spatial constraints and primitive curvature, it improves the consistency between expansion scale and environmental structure. By retaining the first feasible Reeds–Shepp connection as an initial upper bound and continuing bounded refinement, it improves the final returned path beyond the first feasible solution. Comparative studies demonstrate that, relative to the conventional Hybrid A* baseline, the proposed planner reduces the average final planning time, generated nodes, and final path cost by 54.73%, 74.10%, and 12.76%, respectively, in the abstract mine-like scenarios. In the real-map-derived mining working-face scenarios, the corresponding reductions are 25.12%, 37.98%, and 7.15%, respectively. These results indicate that the proposed method reduces search redundancy while improving the efficiency–quality trade-off in confined and geometrically irregular working-face environments.

SensorsVol. 26(18)
China University of Mining and Technology (CN)
Openalex Percentile: Top 13%
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.

An Adaptive Bounded Hybrid A* Planner for Autonomous Mining Trucks in Confined Unstructured Mining Environments — Zijie Meng, Ruixin Zhang · Sensors (2026) | TGRS Research Map | TGRS