Robust Proximal Adversarial Reinforcement Learning Under Model Mismatch
Reinforcement learning (RL) can generate high-performance control policies for complex tasks in simulation through an end-to-end approach. However, the RL policy is not robust to uncertainties caused by modeling mismatch between simulation and real environments, making it difficult to transfer to the real world. In response to the above challenge, this letter introduces a lightweight and efficient robust RL algorithm. The algorithm transforms the optimization objective of the adversary from a long-term cumulative reward to a short-term reward, making the adversary focus on the performance in the near future. Additionally, the adversarial actions are projected onto a finite subset within the perturbation space using projected gradient descent, effectively constraining the adversary's strength and obtaining more robust policies. Extensive experiments in both simulated and real environments show that our algorithm improves the generalization ability of the policy for the modeling mismatch, outperforming the next best prior methods across almost all environments.
Authors
- Taixian Hou (ORCID: https://orcid.org/0000-0002-2741-0494)
- Peng Zhai (ORCID: https://orcid.org/0000-0002-1374-7969)
- Zhiyan Dong (ORCID: https://orcid.org/0000-0002-9459-1889)
- Xiaopeng Ji (ORCID: https://orcid.org/0000-0003-3920-8362)
- Lihua Zhang (ORCID: https://orcid.org/0000-0003-0467-4347)
- Xiaoyi Wei (ORCID: https://orcid.org/0000-0001-7899-9297)
- Jiafu Yi
Institutions
- Hainan University (CN)
- Fudan University (CN)
- Ji Hua Laboratory (CN)
- Zhejiang University (CN)
Publication Details
- Journal
- IEEE Robotics and Automation Letters
- Published
- 2024-10-03
- DOI
- https://doi.org/10.1109/lra.2024.3472348
- Citations
- 1
- Primary Topic
- Adversarial Robustness in Machine Learning
- Type
- article
- Field-Weighted Citation Impact
- 0.35
Funders
- China Postdoctoral Science Foundation