arXiv:2501.01831eess.SYcs.RO2025-01

提出快速恢复系统安全性的运行时控制策略,避免控制器重设计。

Emergency-Brake Simplex: Toward A Verifiably Safe Control-CPS Architecture for Abrupt Runtime Reachability Constraint Changes

  • 通过调整参考状态而非重设计控制器来满足新约束。
  • 相比传统方法,求解速度提升100至10000倍,成功率提高40.81%。
  • 适合对实时性与安全性要求高的工业控制系统应用。

当系统约束发生突变时,原有可达性安全不再成立,系统可能进入危险状态。传统方法依赖在线控制器重设计(OCR)以恢复合规性,但通常响应过慢。本文提出一种快速容错策略,在运行时恢复系统的可达性安全。不重设计控制器,而是通过改变系统参考状态来调整其可达性以适应新约束。将参考状态搜索建模为优化问题,采用KKT方法及基于内点法的牛顿法(作为备选)实现快速求解。数值仿真表明,该方法在计算效率和成功率上均优于传统OCR:求解速度提升10²(内点牛顿法)至10⁴(KKT方法)倍;无时限时成功率提升40.81%;在1.5秒时限下,本方法成功率仍达49.44%,而OCR方法为0%。

原文摘要 · Abstract (English)

When a system's constraints change abruptly, the system's reachability safety does no longer sustain. Thus, the system can reach a forbidden/dangerous value. Conventional remedy practically involves online controller redesign (OCR) to re-establish the reachability's compliance with the new constraints, which, however, is usually too slow. There is a need for an online strategy capable of managing runtime changes in reachability constraints. However, to the best of the authors' knowledge, this topic has not been addressed in the existing literature. In this paper, we propose a fast fault tolerance strategy to recover the system's reachability safety in runtime. Instead of redesigning the system's controller, we propose to change the system's reference state to modify the system's reachability to comply with the new constraints. We frame the reference state search as an optimization problem and employ the Karush-Kuhn-Tucker (KKT) method as well as the Interior Point Method (IPM) based Newton's method (as a fallback for the KKT method) for fast solution derivation. The optimization also allows more future fault tolerance. Numerical simulations demonstrate that our method outperforms the conventional OCR method in terms of computational efficiency and success rate. Specifically, the results show that the proposed method finds a solution $10^{2}$ (with the IPM based Newton's method) $\sim 10^{4}$ (with the KKT method) times faster than the OCR method. Additionally, the improvement rate of the success rate of our method over the OCR method is $40.81\%$ without considering the deadline of run time. The success rate remains at $49.44\%$ for the proposed method, while it becomes $0\%$ for the OCR method when a deadline of $1.5 \; seconds$ is imposed.

控制安全实时系统优化控制故障容错

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