arXiv:2605.09659cs.RO2026-05

安全在线更新非线性系统模型,兼顾实时性与可靠性。

SACK : Safe Active Continual Koopman Learning for Uncertain Systems with Contractive Guarantees

论文配图:SACK : Safe Active Continual Koopman Learning for Uncertain Systems with Contractive Guarantees
图 1 · 摘自论文原文
  • 基于收缩性约束实现安全在线迭代优化
  • 在分布偏移下保持模型误差小于0.15
  • 适合机器人等高安全要求的实时控制场景

Koopman算子理论通过线性算子作用于提升观测量,为非线性动力学建模提供强大工具,使线性控制方法可用于非线性系统。然而,这类模型通常依赖数据学习,在模型不确定性和训练/部署间分布偏移下性能下降。尽管已有研究探索在线适应,但多数基于神经网络的更新方式计算开销大且缺乏形式化安全保证,难以用于实时、高安全要求的机器人应用。本文提出SACK框架,统一处理持续自适应的Koopman学习,支持任务执行过程中的安全高效模型在线优化。首先离线学习一个Koopman模型,随后通过具有收缩性保障的自适应律进行在线修正,理论上可保证在分布偏移和模型不确定性下的收敛性。为提高数据效率并加速收敛,整合主动学习策略以驱动系统采集信息量大的数据,同时完成任务目标。该控制问题被建模为含主动学习目标与安全约束的非凸优化问题。进一步推导出模型近似误差的理论界,并将其嵌入鲁棒模型预测控制(MPC)框架以提供形式化安全保证。为降低实际中的保守性,引入基于共形预测的在线安全裕度校准机制,根据观测残差动态调整边界。大量仿真与实验验证了所提方法的有效性。

原文摘要 · Abstract (English)

Koopman operator theory provides a powerful framework for representing nonlinear dynamics through a linear operator acting on lifted observables, enabling the use of linear control techniques for nonlinear systems. However, Koopman models are typically learned from data and often degrade in performance under model uncertainty and distributional shifts between training and deployment. Although several works have explored online adaptation to address this issue, many rely on neural network-based updates that introduce significant computational overhead and lack formal safety guarantees, limiting their suitability for real-time and safety-critical robotic applications. In this work, we propose SACK, a unified framework for continual adaptive Koopman learning that enables safe and efficient online refinement of learned models during task execution. A Koopman model is first learned offline and subsequently refined online through a contractive adaptation law, which provides theoretical convergence guarantees under distributional shifts and model uncertainty. To improve data efficiency and accelerate model refinement, the adaptation mechanism is integrated with an active learning strategy that drives the system to collect informative data while accomplishing task objectives. The resulting control problem is formulated as a nonconvex optimization problem incorporating both active learning objectives and safety constraints. We further derive theoretical bounds on model approximation error and show how these bounds can be incorporated within a robust Model Predictive Control (MPC) framework to provide formal safety guarantees. To reduce conservatism in practice, we also introduce a conformal prediction-based tightening mechanism that calibrates safety margins online from observed residuals. Extensive simulation and experimental studies demonstrate efficacy of the proposed scheme.

控制系统在线学习安全保证机器学习

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。