E-GAIL: efficient GAIL through including negative corruption and long-term rewards for robotic manipulations
Learning an effective manipulation policy with high efficiency in robotics continues to be a significant challenge. In this paper, we propose E-GAIL, which aims to learn manipulation policies efficiently from a limited set of demonstrations with negative corruption and long-term rewards under the framework of GAIL. Specifically, we propose two techniques: 1) Utilizing both short-term and long-term observations to offer additional rewards for training, accelerating convergence. 2) Incorporating negative actions into generated trajectories for corruption to improve data effectiveness and increase success rates. E-GAIL achieves a 25% improvement in success rates across multiple manipulation tasks, requiring 70% fewer episodes for policy convergence, highlighting its efficiency with limited demonstrations. Our video is available at https://youtu.be/bIDfOjYcY54 .
Authors
- Zeyuan Huang (ORCID: https://orcid.org/0000-0002-2639-0487)
- Haofeng Liu (ORCID: https://orcid.org/0009-0009-0320-3536)
- Marcelo H. Ang (ORCID: https://orcid.org/0000-0001-8277-6408)
- Gang Chen (ORCID: https://orcid.org/0000-0001-7120-7058)
- Jiayi Tan (ORCID: https://orcid.org/0000-0002-5263-836X)
Institutions
- Beijing University of Posts and Telecommunications (CN)
- National University of Singapore (SG)
Publication Details
- Journal
- Applied Intelligence
- Published
- 2025-04-07
- DOI
- https://doi.org/10.1007/s10489-025-06335-2
- Citations
- 2
- Primary Topic
- Robotics and Sensor-Based Localization
- Type
- article
- Field-Weighted Citation Impact
- 9.99