Research Papers 论文研究 12h ago Updated 1h ago 更新于 1小时前 46

Inverting Self-Triggered Control: Adversarial Reinforcement Learning for Sparse Denial-of-Service Attacks 反转自触发控制:用于稀疏拒绝服务攻击的对抗性强化学习

An adversarial RL agent is trained to learn the sparsest jamming/DoS schedule that destabilizes self-triggered reinforcement learning control (RL-STC) systems, inverting the defender's objective of finding the sparsest stabilizing schedule. The authors prove a plant-property lower bound on the minimum jam count required for an immediate hold-last MAC adversary to force a crash against STC controllers satisfying a Lyapunov contract. The learned adversary achieves 100% crash rate across all defend 提出对抗性强化学习框架,将自触发RL控制(RL-STC)反转,学习最稀疏的DoS干扰调度以破坏闭环系统稳定性 证明针对满足Lyapunov契约的自触发控制器(STC)的最小干扰计数下界,将DoS调度分析从周期性和LTI系统扩展至STC控制器 在Pendulum、CartPole、Quadrotor2D三个平台上,学习的对抗代理实现100%崩溃率,而贪婪基线在Quadrotor2D LQR上仅58%成功、周期性基线在Pendulum LQR上仅3%成功 对抗代理在干扰时间效率上比基线方法最高提升2.8倍,且在强高斯噪声和位置观测受限条件下仍保持100%崩溃率

58
Hot 热度
76
Quality 质量
65
Impact 影响力

Analysis 深度分析

TL;DR

  • An adversarial RL agent is trained to learn the sparsest jamming/DoS schedule that destabilizes self-triggered reinforcement learning control (RL-STC) systems, inverting the defender's objective of finding the sparsest stabilizing schedule.
  • The authors prove a plant-property lower bound on the minimum jam count required for an immediate hold-last MAC adversary to force a crash against STC controllers satisfying a Lyapunov contract.
  • The learned adversary achieves 100% crash rate across all defenders (LQR and three RL-STC variants) on all three plants (Pendulum, CartPole, Quadrotor2D), outperforming greedy and periodic baselines by up to 2.8x on jam-time-per-failure.
  • Robustness ablations confirm the adversary maintains 100% failure rates even under significant Gaussian observation noise and position-only observation constraints.
  • This extends DoS-scheduling count-budget analysis from periodic and linear-time-invariant systems to the more general class of self-triggered controllers.

Why It Matters

This work bridges adversarial machine learning and cyber-physical system security, demonstrating that RL-based adversaries can exploit the very sparsity mechanisms designed to make self-triggered controllers efficient. For practitioners building safe autonomous systems, it highlights that Lyapunov-based stability guarantees can be systematically inverted by an adaptive adversary, necessitating new robustness-aware design paradigms for control systems operating under potential jamming threats.

Technical Details

  • Adversarial formulation: The paper inverts RL-STC by training an adversarial RL agent with a Lyapunov-increase admissibility predicate that mirrors the defender's Lyapunov-decreasing safety certificate, learning sparse DoS schedules that destabilize the closed-loop system.
  • Theoretical contribution: A plant-property lower bound is proven on the minimum jam count required for an immediate hold-last medium-access-control adversary to force a crash, recovering a certificate-level analog of consecutive-grouping optimality from prior count-budget DoS scheduling as a corollary.
  • Experimental setup: Four fixed defenders per plant (one LQR and three RL-STC variants) evaluated on Pendulum, CartPole, and Quadrotor2D benchmarks, with comparisons against greedy and periodic jamming baselines.
  • Performance results: The learned adversary achieves 100% crash rate universally, while greedy baselines miss Quadrotor2D LQR on 42% of episodes and periodic baselines miss Pendulum LQR on 97% of episodes, with up to 2.8x improvement in jam-time-per-failure.
  • Robustness analysis: Ablation studies show the adversary remains effective under Gaussian observation noise exceeding initial-state magnitude and position-only observation scenarios, maintaining both 100% failure rates and strict superiority over baselines.

Industry Insight

  • Security-conscious control system designers should treat Lyapunov-based safety certificates as potentially invertible under adaptive adversarial conditions, and incorporate adversarial training or robust verification into the control synthesis pipeline rather than relying solely on nominal stability guarantees.
  • The 2.8x efficiency advantage of learned adversarial schedules over periodic/greedy baselines suggests that resource-constrained attackers can achieve dramatically higher impact with fewer jamming actions, making sparse DoS attacks a serious threat to energy-efficient cyber-physical systems like autonomous vehicles and drone networks.
  • The robustness of the adversary under severe observation noise and partial state information indicates that even degraded sensing conditions do not neutralize learned jamming strategies, implying that defense mechanisms must account for adversarial adaptability rather than assuming information asymmetry will protect the system.

TL;DR

  • 提出对抗性强化学习框架,将自触发RL控制(RL-STC)反转,学习最稀疏的DoS干扰调度以破坏闭环系统稳定性
  • 证明针对满足Lyapunov契约的自触发控制器(STC)的最小干扰计数下界,将DoS调度分析从周期性和LTI系统扩展至STC控制器
  • 在Pendulum、CartPole、Quadrotor2D三个平台上,学习的对抗代理实现100%崩溃率,而贪婪基线在Quadrotor2D LQR上仅58%成功、周期性基线在Pendulum LQR上仅3%成功
  • 对抗代理在干扰时间效率上比基线方法最高提升2.8倍,且在强高斯噪声和位置观测受限条件下仍保持100%崩溃率

为什么值得看

本文首次将对抗性RL系统性地应用于自触发控制场景的DoS攻击调度,为安全关键系统的鲁棒性评估提供了新的理论框架和实验基准。其"反转防御逻辑"的研究范式对网络安全与控制系统交叉领域具有重要启发价值。

技术解析

  • 核心方法:将防御方的Lyapunov递减稳定性保证转化为对抗方的Lyapunov递增可接受性谓词,构建对称的对抗学习框架,使RL代理学习最稀疏的干扰调度以最大化系统失稳概率
  • 理论贡献:证明针对STC控制器的最小干扰计数下界,并推导出证书级类比结果——恢复先前DoS调度中连续分组最优性的对应形式,扩展了count-budget分析的理论边界
  • 实验设置:在三个经典控制平台(Pendulum、CartPole、Quadrotor2D)上,每个平台训练对抗代理对抗四种固定防御者(1个LQR + 3个RL-STC变体)
  • 性能对比:学习的对抗代理是唯一在所有平台和所有防御者上均达到100%崩溃率的方法;在Quadrotor2D LQR上,贪婪基线42%失败、周期性基线97%失败
  • 鲁棒性验证:高斯观测噪声超过初始状态幅度、仅位置观测两种极端条件下,对抗代理仍保持100%崩溃率且干扰效率显著优于基线

行业启示

  • 为无人机、自动驾驶等安全关键系统的网络安全评估提供了可量化的理论工具和对抗性测试基准,推动"以攻促防"的安全验证范式
  • 自触发控制系统的DoS攻击调度分析从周期性/LTI系统扩展至更一般的STC控制器,填补了该领域的理论空白,对实时控制系统的抗干扰设计具有指导意义
  • 对抗性RL在控制安全领域的应用拓展表明,将防御机制逆向转化为攻击策略的学习框架具有普适价值,可推广至其他安全关键系统的鲁棒性评估场景

Disclaimer: The above content is generated by AI and is for reference only. 免责声明:以上内容由 AI 生成,仅供参考。

Security 安全 Research 科学研究 Agent Agent Training 训练