Aug 2026· IEEE Transactions on Neural Networks and Learning Systems· Vol PP· 0 citations
Medicine
TL;DR
The Safe-Koopman Framework is introduced, an operator-theoretic motion planning method that generalizes obstacle-free demonstrations to planar planning tasks with obstacles and avoids collisions observed in the unconstrained Koopman baseline.
Abstract
Robot learning from demonstration (LfD) in obstacle-laden environments presents a fundamental conflict between mimicking expert dynamics and maintaining safety. This article introduces the Safe-Koopman Framework, an operator-theoretic motion planning method that generalizes obstacle-free demonstrations to planar planning tasks with obstacles. Leveraging the Koopman operator with random Fourier features (RFFs), the method lifts nonlinear robot motion into a linear feature space to capture the global kinematic topology of demonstrations. To address safety generalization, two components are proposed. First, a dynamical system modulation mechanism smoothly blends the nominal imitation flow with a local safety-critical flow, reducing discontinuities associated with hard switching. Second, a radial loss is formulated as a data-driven relaxation of control barrier function (CBF) boundary conditions, penalizing inward velocity components near obstacle boundaries. Under the zero-loss idealization and stated regularity assumptions, the radial condition supports forward invariance of the safe set; in implementation, the method empirically maintains positive clearance. The nominal spectral stability of the learned Koopman operator is further analyzed, along with the effect of local nonlinear modulation on this conclusion. Experiments on the LASA handwriting trajectory benchmark show that the proposed method avoids collisions observed in the unconstrained Koopman baseline and reduces jerk compared with artificial potential field (APF)-based obstacle avoidance while maintaining competitive kinematic fidelity.
A task-space receding-horizon controller that uses a short contact-consistent rollout to generate a terminal kinematic reference satisfying internal non-penetration constraints, then computes only the first input of a smooth minimum-acceleration transition toward that reference.
Collaborative robots (cobots) operating in shared human-robot workspaces require reactive, computationally lightweight obstacle avoidance to guarantee both safety and task continuity. This paper presents a simulation-based study of obstacle avoidance for the 6-DOF UR3 cobot (Universal Robots) using Modulation Dynamical...
Le Nam Chau, Anh Vo Khai Pham, Mai Thị Tuyết Nguyễn et al.· 2026 11th International Conf...· 0 citations
Addressing the challenges of obstacle avoidance for autonomous vehicles in complex dynamic environments, traditional Artificial Potential Field (APF) methods often suffer from delayed responses to dynamic obstacles and generate paths that violate vehicle kinematic constraints. To overcome these limitations, this paper...
The experimental results demonstrate that the proposed Field-guided RRT achieves a better balance among path efficiency, planning time, obstacle-clearance maintenance, and trajectory execution capability compared with conventional RRT-based methods.
Chen-Yueh Wen, Siyuan Zhang, M. Grigorev et al.· Machines· 0 citations
PC-MM-SAC is presented, a task-oriented multimodal reinforcement-learning framework with a lightweight physics-constrained action-execution layer for local navigation in complex static obstacle environments that achieves the highest success rate among the evaluated methods under the current task setting.
Yawei Tian, Yu Chen, Zhong-Liang Deng et al.· Scientific Reports· 0 citations
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 sig...
M. Krupa, Miroslav Cibula, Kristína Malinovská· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.