Learning to Provably Satisfy High Relative Degree Constraints for Black-Box Systems
<|reference_start|>Learning to Provably Satisfy High Relative Degree Constraints for Black-Box Systems: In this paper, we develop a method for learning a control policy guaranteed to satisfy an affine state constraint of high relative degree in closed loop with a black-box system. Previous reinforcement learning (RL) approaches to satisfy safety constraints either require access to the system model, or assume control affine dynamics, or only discourage violations with reward shaping. Only recently have these issues been addressed with POLICEd RL, which guarantees constraint satisfaction for black-box systems. However, this previous work can only enforce constraints of relative degree 1. To address this gap, we build a novel RL algorithm explicitly designed to enforce an affine state constraint of high relative degree in closed loop with a black-box control system. Our key insight is to make the learned policy be affine around the unsafe set and to use this affine region to dissipate the inertia of the high relative degree constraint. We prove that such policies guarantee constraint satisfaction for deterministic systems while being agnostic to the choice of the RL training algorithm. Our results demonstrate the capacity of our approach to enforce hard constraints in the Gym inverted pendulum and on a space shuttle landing simulation.<|reference_end|>
@article{bouvier2024learning,
    title={Learning to Provably Satisfy High Relative Degree Constraints for
  Black-Box Systems},
    author={Jean-Baptiste Bouvier, Kartik Nagpal and Negar Mehr},
    journal={arXiv preprint arXiv:2407.20456},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.20456},
    primaryClass={eess.SY cs.SY}
}