Time-Optimal Flight in Cluttered Environments via Safe Reinforcement Learning
This paper addresses the problem of guiding a quadrotor through a predefined sequence of waypoints in cluttered environments, aiming to minimize the flight time while avoiding collisions. Previous approaches either suffer from prolonged computational time caused by solving complex non-convex optimization problems or are limited by the inherent smoothness of polynomial trajectory representations, thereby restricting the flexibility of movement. In this work, we present a safe reinforcement learning approach for autonomous drone racing with time-optimal flight in cluttered environments. The reinforcement learning policy, trained using safety and terminal rewards specifically designed to enforce near time-optimal and collision-free flight, outperforms current state-of-the-art algorithms. Additionally, experimental results demonstrate the efficacy of the proposed approach in achieving both minimum flight time and obstacle avoidance objectives in complex environments, with a commendable [Formula: see text] success rate in unseen, challenging settings.
Authors
- Jian Sun (ORCID: https://orcid.org/0000-0001-5031-4938)
- Gang Wang (ORCID: https://orcid.org/0000-0002-7266-2412)
- Xiao Wei (ORCID: https://orcid.org/0009-0003-2623-2555)
- Jie Chen (ORCID: https://orcid.org/0000-0001-5608-5478)
- Zhaohan Feng (ORCID: https://orcid.org/0009-0008-9055-9276)
- Ziyu Zhou (ORCID: https://orcid.org/0000-0001-9485-7336)
Institutions
- Tongji University (CN)
- Beijing Institute of Technology (CN)
Publication Details
- Journal
- Unmanned Systems
- Published
- 2025-01-22
- DOI
- https://doi.org/10.1142/s230138502650007x
- Citations
- 1
- Primary Topic
- Aerospace and Aviation Technology
- Type
- article
- Field-Weighted Citation Impact
- 4.99