New Obstacle Avoidance Motion Planning: A Safe Koopman Planning Method
Xucheng Liu, Ruiqi Ke, Yandong Wang, Zongyu Zuo
Beihang University
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
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.
逐年被引趋势
暂无年度引用数据
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIReinforcement Learning in Robotics
Robotic Path Planning Algorithms · Robot Manipulation and Learning