TY - GEN
T1 - Dynamic Coverage Path Planning Algorithm for Multi - Stratospheric Airship Formation Based on Deep Reinforcement Learning
AU - Liu, Zhao
AU - Guo, Xiao
AU - Ou, Jiajun
AU - Zheng, Baojin
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Autonomous aircraft path planning has demonstrated significant potential in various applications of the Internet of Aerial Things. However, static coverage solutions are inadequate for continuously moving aerial vehicles, such as fixed-wing aircraft and low-earth orbit satellites. Therefore, there is a pressing need for an algorithm capable of planning paths for dynamically moving aircraft. In this paper, we introduce a dynamic coverage path planning algorithm tailored for multi-airship formations that adhere to the dynamic constraints of stratospheric airships. The proposed framework leverages reinforcement learning to accumulate experience through exploration, storing it in an experience pool. This facilitates swift updates to the networks of each agent through semi-centralized exploration and centralized experience playback. Furthermore, the proposed algorithm assigns distinct rewards based on different task stages, enhancing the agent's suitability for area coverage studies.
AB - Autonomous aircraft path planning has demonstrated significant potential in various applications of the Internet of Aerial Things. However, static coverage solutions are inadequate for continuously moving aerial vehicles, such as fixed-wing aircraft and low-earth orbit satellites. Therefore, there is a pressing need for an algorithm capable of planning paths for dynamically moving aircraft. In this paper, we introduce a dynamic coverage path planning algorithm tailored for multi-airship formations that adhere to the dynamic constraints of stratospheric airships. The proposed framework leverages reinforcement learning to accumulate experience through exploration, storing it in an experience pool. This facilitates swift updates to the networks of each agent through semi-centralized exploration and centralized experience playback. Furthermore, the proposed algorithm assigns distinct rewards based on different task stages, enhancing the agent's suitability for area coverage studies.
KW - SAC
KW - collaborative coverage
KW - path planning
KW - stratospheric airship component
UR - https://www.scopus.com/pages/publications/85189317836
U2 - 10.1109/CAC59555.2023.10451265
DO - 10.1109/CAC59555.2023.10451265
M3 - 会议稿件
AN - SCOPUS:85189317836
T3 - Proceedings - 2023 China Automation Congress, CAC 2023
SP - 585
EP - 590
BT - Proceedings - 2023 China Automation Congress, CAC 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 China Automation Congress, CAC 2023
Y2 - 17 November 2023 through 19 November 2023
ER -