A Hierarchical Hybrid Trajectory Planning Method Based on a TTA-Driven Dynamic Risk Filtering Mechanism

To reduce the conservatism of local trajectory planning in dynamic road scenarios caused by redundant projection of predicted trajectories, this paper proposes a hierarchical hybrid trajectory-planning framework with a time-to-arrival (TTA)-driven dynamic risk-filtering mechanism. In the Frenet coordinate system, road boundaries, ego states, and static and dynamic obstacles are represented uniformly to construct an S–L fused risk field and an S–T spatiotemporal interaction graph, enabling the filtering of temporally irrelevant conflict regions based on TTA relationships. At the path-planning layer, risk-guided adaptive sampling is integrated with dynamic programming and quadratic programming to improve search efficiency and trajectory quality. At the speed-planning layer, spatiotemporal coordination is achieved through non-uniform discretization, safe-corridor extraction, and speed-profile optimization. Simulation results show that the proposed method generates safe, smooth, continuous, and executable local trajectories in scenarios involving static-obstacle avoidance, adjacent-vehicle cut-ins, non-motorized road-user crossings, and mixed multi-obstacle interactions, while reducing unnecessary deceleration and detours. Ablation results further indicate that adaptive sampling reduces the number of DP search nodes by approximately 50% and the average planning time by about 30%, while maintaining a nearly unchanged minimum safety distance. These findings demonstrate that the proposed framework effectively suppresses redundant conflict regions and improves planning efficiency, solution feasibility, and motion continuity without compromising safety.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2026-04-22
DOI
https://doi.org/10.3390/electronics15091782
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Hierarchical Hybrid Trajectory Planning Method Based on a TTA-Driven Dynamic Risk Filtering Mechanism

Huakun Deng, Lin Hu, Jing Huang, Tao Huang
Electronics
Robotic Path Planning Algorithms
article

A Hierarchical Hybrid Trajectory Planning Method Based on a TTA-Driven Dynamic Risk Filtering Mechanism

Huakun Deng, Lin Hu, Jing Huang, Tao Huang
article en

Abstract

To reduce the conservatism of local trajectory planning in dynamic road scenarios caused by redundant projection of predicted trajectories, this paper proposes a hierarchical hybrid trajectory-planning framework with a time-to-arrival (TTA)-driven dynamic risk-filtering mechanism. In the Frenet coordinate system, road boundaries, ego states, and static and dynamic obstacles are represented uniformly to construct an S–L fused risk field and an S–T spatiotemporal interaction graph, enabling the filtering of temporally irrelevant conflict regions based on TTA relationships. At the path-planning layer, risk-guided adaptive sampling is integrated with dynamic programming and quadratic programming to improve search efficiency and trajectory quality. At the speed-planning layer, spatiotemporal coordination is achieved through non-uniform discretization, safe-corridor extraction, and speed-profile optimization. Simulation results show that the proposed method generates safe, smooth, continuous, and executable local trajectories in scenarios involving static-obstacle avoidance, adjacent-vehicle cut-ins, non-motorized road-user crossings, and mixed multi-obstacle interactions, while reducing unnecessary deceleration and detours. Ablation results further indicate that adaptive sampling reduces the number of DP search nodes by approximately 50% and the average planning time by about 30%, while maintaining a nearly unchanged minimum safety distance. These findings demonstrate that the proposed framework effectively suppresses redundant conflict regions and improves planning efficiency, solution feasibility, and motion continuity without compromising safety.

ElectronicsVol. 15(9)
Hunan University (CN), Changsha University of Science and Technology (CN)
National Natural Science Foundation of China, National Science Fund for Distinguished Young Scholars
Sustainable cities and communities
Openalex Percentile: Top 6%
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.