Solving Reach-Avoid-Stay Problems Using Deep Deterministic Policy Gradients
<|reference_start|>Solving Reach-Avoid-Stay Problems Using Deep Deterministic Policy Gradients: Reach-Avoid-Stay (RAS) optimal control enables systems such as robots and air taxis to reach their targets, avoid obstacles, and stay near the target. However, current methods for RAS often struggle with handling complex, dynamic environments and scaling to high-dimensional systems. While reinforcement learning (RL)-based reachability analysis addresses these challenges, it has yet to tackle the RAS problem. In this paper, we propose a two-step deep deterministic policy gradient (DDPG) method to extend RL-based reachability method to solve RAS problems. First, we train a function that characterizes the maximal robust control invariant set within the target set, where the system can safely stay, along with its corresponding policy. Second, we train a function that defines the set of states capable of safely reaching the robust control invariant set, along with its corresponding policy. We prove that this method results in the maximal robust RAS set in the absence of training errors and demonstrate that it enables RAS in complex environments, scales to high-dimensional systems, and achieves higher success rates for the RAS task compared to previous methods, validated through one simulation and two high-dimensional experiments.<|reference_end|>
@article{chenevert2024solving,
    title={Solving Reach-Avoid-Stay Problems Using Deep Deterministic Policy
  Gradients},
    author={Gabriel Chenevert, Jingqi Li, Achyuta kannan, Sangjae Bae, Donggun Lee},
    journal={arXiv preprint arXiv:2410.02898},
    year={2024},
    archivePrefix={arXiv},
    eprint={2410.02898},
    primaryClass={eess.SY cs.LG cs.RO cs.SY}
}