This report adopts a two-piece MINCO parameterization, trading time for smoothness without altering the trajectory's spatial profile, and replaces score regression with a ranking loss, preventing small score errors from reordering the candidate set.
Abstract
The one-stage planner YOPO maps a single depth image and the robot state directly to a set of candidate trajectories, trained by backpropagating through differentiable trajectory costs. This yields dense, geometrically informative supervision, but inherits the pathologies of soft-constrained optimization: the safety cost competes with the smoothness and goal-reaching terms, is non-convex across homotopy classes, and the single-piece polynomial is limited in expressiveness. In this report, we summarize several effective modifications. We adopt a two-piece MINCO parameterization, trading time for smoothness without altering the trajectory's spatial profile. We further lift YOPO's multi-modal prediction to span distinct homotopy classes, treating each motion primitive as a homotopy anchor that confines the trajectory to a feasible basin - without explicit safe-flight-corridor construction or front-end search. For dynamic feasibility, we impose barrier penalties on velocity and acceleration together with a curvature-dependent speed limit whose gradient acts only on the velocity, producing an adaptive-speed behavior that decelerates in cluttered regions or sharp turns. We replace score regression with a ranking loss, preventing small score errors from reordering the candidate set. These yield richer trajectory representations, safer obstacle avoidance, and more direct flight paths.
This work presents NeurRAFT, a generative planning framework based on anchor-level flow matching and clearance-aware preference tuning that operates on compact anchor waypoints, and directly reshape the pretrained planner's distribution toward safer solutions without augmenting inference.
Sibo Tian, Chang Liu, Ming-Hui Zheng et al.· 0 citations
A lightweight offline-primitive-based dataset collection framework is designed to produce safe and high-quality trajectory primitives in non-convex environments and demonstrates superiority in both planning latency and target-reaching progress quality.
Zhi-Tao Liu, Guang-Tong Xu, Zi-Han Wang et al.· IEEE Transactions on Industr...· 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
Robot skill generation is often approached from two distinct perspectives: normative trajectory optimization, which emphasizes smoothness-based criteria such as minimum jerk, and imitation-based learning, which prioritizes fidelity to demonstrated behaviors. While both paradigms aim to produce feasible and meaningful m...
Reza Azadeh· 2026 23rd International Conf...· 0 citations
This paper proposes a nested kino-dynamic framework for rapid feasibility checking and dynamically consistent trajectory generation given a candidate contact sequence and shows that the generated trajectories can be tracked using a reinforcement learning (RL)-based controller and are of sufficiently high quality for ex...
Michal Ciebielski, Shafeef Omar, Aaron M. Johnson et al.· arXiv.org· 0 citations
Hydra, a discrete World Action Model that tackles this by establishing a unified latent manifold over visual states, physical poses, and control actions, outperforms state-of-the-art navigation world models in goal-directed planning, while matching or exceeding the closed-loop execution capabilities of leading reactive...
Mohammad Nazeri, Alexandyr Card, S. Huber et al.· 1 citation· ⚡1
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.