Spectral-linear representation is introduced as a compact joint-space representation that combines an endpoint-conditioned linear reference path with a small set of globally supported eigenmodes derived from a conditioned temporal kernel that is more predictive of bottleneck success than latent width alone.
Abstract
Guided diffusion planners for robot manipulators often fail in bottleneck scenes. The reason is that local collision corrections must be coordinated through a limited latent parameterization. This study examines the issue at the level of trajectory representation. Spectral-linear representation is introduced as a compact joint-space representation that combines an endpoint-conditioned linear reference path with a small set of globally supported eigenmodes derived from a conditioned temporal kernel. Using a shared training corpus, conditioning scheme, guidance rule, and dense-evaluation protocol, spectral-linear representation is compared with five representative alternatives across six representation families and dimensionality sweeps from 14 to 448 dimensions. With 14 latent dimensions, spectral-linear representation attains the highest structured-scene success rates among the tested families, reaching 74.2% on narrow-passage scenes and 84.5% on rack-like scenes. Expert-only controls, per-family guidance tuning, and a Transformer-backbone rerun are consistent with the same broad ranking pattern. These results indicate that, under limited guidance budgets and within the tested protocol, the representation structure is more predictive of bottleneck success than latent width alone.
The PccDiffuser is presented, a conditional diffusion framework for continuum robots that learns a multimodal distribution over complete configuration-space paths and samples multiple candidate solutions in parallel, which are subsequently converted into an executable trajectory by time allocation considering actuator...
Large-scale multi-robot trajectory planning faces significant challenges in computational efficiency, scalability, trajectory quality, and safety, especially in complex, obstacle-dense environments. To address this, we propose CHORD, a hierarchical generative framework for multi-robot motion planning. At the macroscopi...
Kang Ding, Chun-Xuan Jiao, Yun-Ze Hu et al.· IEEE Transactions on Automat...· 0 citations
This work replaces the costly convex relaxation step required by nominal GCS with a single forward pass through a Graph Attention Network that predicts a set of highly probable candidate paths through the graph, and generates a lightweight ranking network that orders these candidates by their estimated trajectory cost.
Ananya Trivedi, Sarvesh Prajapati, M. K. M. Jaffar et al.· 0 citations
Motion planning for redundant manipulators in high-dimensional configuration spaces, while simultaneously handling complex obstacles and multiple motion performance constraints, remains a challenge. In this article, a motion planning method for manipulators based on a Graphs of Convex Sets constructed via Gaussian Mixt...
Yong Zhang, Ziqiang Zhang, Ling-Li Cui et al.· IEEE Transactions on Automat...· 0 citations
Recent end-to-end neural motion planners generate trajectories from raw sensor observations, avoiding the privileged geometric models required by classical planners. However, collision-free planning in cluttered environments remains challenging. We present NeurRAFT, a generative planning framework based on anchor-level...
Sibo Tian, Chang Liu, Ming-Hui Zheng et al.· 0 citations
In trajectory planning for autonomous driving, hybrid planning architectures are often realized as a collection of disparate modules, each with its own objectives. This lack of a unifying principle can lead to inconsistencies between the initial and refined trajectory, resulting in suboptimal behavior. We address this...
Steffen Hagedorn, Aron Distelzweig, Alexandru Condurache· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.