Jul 2026· 2026 23rd International Conference on Ubiquitous Robots (UR)· pp. 390-396· 0 citations· 17 references
Computer Science
Abstract
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 motions, they are typically formulated separately. In practice, however, many robotic skills require trajectories that are both dynamically smooth and faithful to demonstrations. We propose a unified framework for normative–imitative trajectory optimization that makes this trade-off explicit and tunable. Our framework formulates trajectory generation as a constrained quadratic program combining weighted linear-operator smoothness penalties, a quadratic imitation anchoring term, and affine equality constraints for feasibility. For affine-constrained instances, the resulting problem is strictly convex, admits a unique global minimizer, and can be solved efficiently using standard quadratic programming techniques. Our proposed formulation unifies a broad class of smoothness objectives, including minimum velocity, acceleration, jerk, snap, and elastic energy models, within a single operator-based representation, while incorporating demonstration fidelity in a principled manner. Simulation and real-world experiments on a UR5e robotic arm demonstrate that our framework provides predictable interpolation between purely normative and purely imitative behaviors, offering a compact and extensible foundation for trajectory learning from demonstration.
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.
A Movement Primitive learning algorithm based on Gaussian Processes, combined with real-time zero-shot adaptation through Pathwise Conditioning, which encapsulates the predictive uncertainty of the demonstrated movement using heteroscedastic GPs and utilizes an update via Matheron's rule to instantaneously adjust the t...
Adrián Prados, L. Lishan, Alberto Mendez et al.· Jornadas de Automática· 0 citations
Simulation studies on RoboMimic trajectories show that the RMP-inspired feedback primarily improves pose reproduction accuracy and disturbance recovery, whereas the SSGP-based weighting substantially reduces terminal translational and rotational jerk, with a slight accuracy compromise relative to RMP-DMP.
A new framework that produces guidance at the full-trajectory level to suit the planning horizon of autonomous driving and provides a formal criterion for deciding when and how to inject human input into the policy-update loop is proposed, leveraging the Lagrangian method to solve the constrained optimization problem.
Li-Fei Dai, Yi-Qun Liu, Hao Zhang et al.· IEEE Transactions on Neural...· 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
This work proposes a hybrid trajectory planning framework that integrates IL-based multimodal trajectory proposal with differentiable optimization, and introduces a surrounding agent centric data augmentation strategy that reuses real-world trajectories of surrounding vehicles as additional expert demonstrations, there...
Shihao Zhang, Zi-Yu Song, Zhaochen Xia et al.· Proceedings of the Instituti...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.