Skip to content
Conference

Deep Imitation Learning for Efficient Path-Following of Hyper-Redundant Robots

Jul 2026 · 2026 IEEE/ASME International Conference on Advanced Intelligent Mechatronics (AIM) · pp. 1-6 · 0 citations · 18 references

Abstract

Hyper-redundant robots are essential for navigation in highly constrained environments, yet their high-dimensional kinematics impose a severe computational burden on real-time motion planning. While optimization-based methods ensure tracking precision, their high computational latency makes them unsuitable for online feedback loops; conversely, geometric heuristics offer speed but lack kinematic fidelity. To resolve this efficiency-accuracy trade-off, we present an imitation learning framework tailored for path-following tasks. First, to address the instability of expert data generation caused by non-differentiable minimax objectives, we propose a refined Soft-Maximum formulation that produces smooth, kinetically consistent demonstrations. Second, we mitigate the covariate shift inherent in Behavior Cloning (BC) through a two-stage noise-injection curriculum, enabling the agent to learn robust recovery policies entirely offline without requiring an interactive expert. Finally, we design a structured policy network that effectively fuses high-dimensional path descriptors with low-dimensional proprioceptive states. Extensive simulations demonstrate that our approach achieves optimization-level accuracy with inference speeds comparable to geometric heuristics, validating its efficacy for high-precision inspection tasks.

View source

Similar papers

#artificial intelligence Preprint Aug 2026

Neural-Primitive: An Efficient End-to-end Local Planner with Primitive-based Imitation Learning for Autonomous Flight

Autonomous flight in unknown cluttered environments is hindered by the computation-quality-memory trilemma of onboard trajectory generation. In this paper, we propose an efficient end-to-end local planner via imitation learning. A lightweight offline-primitive-based dataset collection framework is designed to produce safe and high-quality trajectory primitives in non-convex environments. A compact neural network directly maps sensory inputs to polynomial coefficients that inherently encode higher-order dynamical information. The learned policy generates smooth, empirically collision-free and dynamically feasible trajectories in real time without back-end solving. It achieves ultra-fast computation (below 1ms on a standard desktop and average 3.68ms during onboard flight), while maintaining low onboard memory requirements (less than 1.5MiB). Extensive simulation benchmarks demonstrate superiority in both planning latency and target-reaching progress quality. Zero-shot deployment in real-world experiments further validates the robust sim-to-real transfer capability of the proposed method.

Zhitao Liu, Guangtong Xu, Zihan Wang et al. · 0 citations
Preprint Aug 2026

Learning Loco-Manipulation From SMPC Demonstrations With Sparse Offline-to-Online RL

This work uses Sample-based Model Predictive Control entirely in simulation as an automated, rapidly tunable expert to generate massive offline datasets and validate the robustness of this sim-to-real framework by successfully deploying complex loco-manipulation skills across different morphologies.

Martin Schuck, Maks Sorokin, S. Manni et al. · 0 citations
Jul 2026

Self-Supervised Bio-Inspired Robotic Trajectory Planning with Obstacle Avoidance

This follow-up work tests the feasibility of the neuro-inspired self-supervised learning framework for trajectory planning that leverages forward and inverse models as the internal supervisory mechanism in an environment that contains an obstacle, and demonstrates the tendency of the planner to exploit the learning signal provided by the forward and inverse models.

M. Krupa, Miroslav Cibula, Kristína Malinovská · 0 citations
Open access Sep 2026

Robust Task Generalization for Dual-Arm Learning from Demonstration

Dual-arm manipulation or physical human-robot coordination requires robots to adapt rapidly to changing environments and constraints. Traditional Learning from Demonstration approaches struggle to generalize when faced with out-of-distribution scenarios, requiring costly retraining. We propose a Movement Primitive learning algorithm based on Gaussian Processes, combined with real-time zero-shot adaptation through Pathwise Conditioning. The method encapsulates the predictive uncertainty of the demonstrated movement using heteroscedastic GPs and utilizes an update via Matheron's rule to instantaneously adjust the trajectory to new via-points, without the need to retrain the underlying model. This formulation is extended to dual-arm coordination by dynamically calculating 6D relative constraints to maintain a closed kinematic chain. Experimental results, both in 2D comparisons against task-parameterized models and in tasks with the ADAM robot, demonstrate robust adaptation with near-zero error in real time, making it applicable for highly changing environments.

Adrián Prados, L. Lishan, Alberto Mendez et al. · 0 citations
Preprint Aug 2026

Learning the Right Abstraction: Neural Reduced Dynamics for Complex Robot Control

A neural reduced dynamics framework is developed that separates the state the model propagates from what can be supplied as an input or recovered analytically, trains policies entirely inside the frozen learned model, and validates them back in the high-fidelity simulator.

Harry Zhang, Dan Negrut · 0 citations
Jul 2026

FARO: Feasibility-Aware Robot Motion Optimization

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 execution in real-world loco-manipulation scenarios.

Michal Ciebielski, Shafeef Omar, Aaron M. Johnson et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.