A hierarchical conditional diffusion framework is proposed for structured joint-space trajectory generation, which is conditioned on start and goal positions, static workspace geometry, and dynamic obstacle motions, and achieves 93.5% planning success versus 82.5% for the best learning-based baseline, Hierarchical Diffusion Policy (HDP).
Abstract
Real-time trajectory planning for 6-DoF robotic manipulators in environments containing moving obstacles remains an open challenge because planners must simultaneously satisfy collision avoidance, joint limits, and strict latency constraints. Existing diffusion-based planners suffer from three structural limitations: single-resolution denoising that forces global topology and local geometry to compete for model capacity within a single pass; static obstacle snapshots applied uniformly across all trajectory waypoints, which is incorrect because the obstacle moves by the time the arm reaches waypoints several seconds into the future; and scalar collision guidance that cannot localize corrective effort along the trajectory. In this paper, a hierarchical conditional diffusion framework is proposed for structured joint-space trajectory generation, which is conditioned on start and goal positions, static workspace geometry, and dynamic obstacle motions. To guarantee temporal consistency, a spatio-temporal cross-attention module is employed to align each waypoint query with predicted obstacle state at its corresponding execution time. Furthermore, a learned GuidanceScheduler is proposed that uses a waypoint-wise collision penalty profile, enabling temporally directed guidance during denoising instead of a scalar penalty. The framework is trained on 10,800 expert trajectories for the Kinova J2S6S300 manipulator and evaluated on 1200 held-out scenarios. It achieves 93.5% planning success versus 82.5% for the best learning-based baseline, Hierarchical Diffusion Policy (HDP), an absolute improvement of 11 percentage points, and 95.0% when combined with ST-CHOMP post-processing, at 243 ms inference latency.
A training-free diffusion-based motion planner that replaces learned global trajectory scores with analytical local scores derived from obstacle, smoothness, velocity, and inter-agent feasibility terms, which yields a decomposed denoising procedure that retains the optimization structure of classical trajectory methods...
Michael Y. Fatemi, Jin-Hao Liang, Ferdinando Fioretto· 0 citations
Autonomous navigation in dynamic environments requires computing spatiotemporal trajectories that satisfy non-holonomic motion constraints. When the trajectories of the moving obstacles are predictable or known, a promising approach is to rely on the combination of state lattices constructed from precomputed feasible m...
Marat Agranovskiy, Konstantin S. Yakovlev· 0 citations
Autonomous navigation in dynamic environments is a critical challenge, particularly when spaces are shared with other mobile agents whose future trajectories are known. While traditional grid-based planners efficiently find collision-free paths, their reliance on stop-and-turn mechanics over $2^k$-connected grids produ...
Many robotic manipulation tasks require both unconstrained motion in free space and precise tracking of constrained paths. Seamlessly switching between these motion types while replanning trajectories online, for example, during human–robot interaction, is a challenging problem. We propose a novel receding-horizon...
F. Beck, Thies Oelerich, Minh Nhat Vu et al.· Journal of Intelligent &...· 0 citations
Collision-free relative motion planning for spacecraft in uncertain local orbital environments is critical for on-orbit servicing, inspection, and collision risk mitigation. Yet, existing graph- and tree-based planners typically restrict trajectory propagation to discrete connections, with guarantees tied to the mainta...
Tian-Ji Ma, Bin Nan, Ming-Yao Sun et al.· Aerospace· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.