Realizing Stabilized Landing for Computation-Limited Reusable Rockets: A Quantum Reinforcement Learning Approach
Citations

WEB OF SCIENCE

17
Citations

SCOPUS

19

초록

The advent of reusable rockets has heralded a new era in space exploration, reducing the costs of launching satellites by a significant factor. Traditional rockets were disposable, but the design of reusable rockets for repeated use has revolutionized the financial dynamics of space missions. The most critical phase of reusable rockets is the landing stage, which involves managing the tremendous speed and altitude for safe recovery. The complexity of this task presents new challenges for control systems, specifically in terms of precision and adaptability. Classical control systems like the model predictive control (MPC) controller lack the flexibility to adapt to dynamic system changes, making the re-design of the controller costly and time consuming. This paper explores the integration of quantum reinforcement learning into the control systems of reusable rockets as a promising alternative. Unlike classical reinforcement learning, quantum reinforcement learning uses quantum bits that can exist in superposition, allowing for more efficient information encoding and reducing the number of parameters required. This leads to increased computational efficiency, reduced memory requirements, and more stable and predictable performance. Due to the nature of reusable rockets, which must be light, heavy computers cannot fit into them. In the reusable rocket scenario, quantum reinforcement learning, which has reduced memory requirements due to fewer parameters, is a good solution.

키워드

Quantum Reinforcement LearningReusable RocketsStabilized Control
제목
Realizing Stabilized Landing for Computation-Limited Reusable Rockets: A Quantum Reinforcement Learning Approach
저자
Kim, Gyu SeonChung, JaehyunPark, Soohyun
DOI
10.1109/TVT.2024.3373901
발행일
2024-08
유형
Article in press
저널명
IEEE Transactions on Vehicular Technology
73
8
페이지
12252 ~ 12257