Deep Reinforcement Learning Based Resource Allocation and Trajectory Planning in Integrated Sensing and Communications UAV Network
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
In this paper, multi-UAVs serve as mobile aerial ISAC platforms to sense and communicate with on-ground target users. To optimize the communication and sensing performance, we formulate a joint user association, UAV trajectory planning and power allocation problem to maximize the minimum weighted spectral efficiency among UAVs. This paper exploits the centralized and the decentralized deep reinforcement learning (DRL) solutions to solve the sequential decision-making problem. On one hand, we first introduce the centralized soft actor-critic (SAC) algorithm. Then, we explore the equivalent transformation of the optimization objective based on symmetric group, propose the random and the adaptive data augmentation schemes to design the replay memory buffer of SAC, and accordingly propose SAC algorithms assisted by data augmentation to tackle the transformed problem. On the other hand, the multi-agent soft actor-critic (MASAC), a decentralized solution, is also introduced to solve this sequential decision-making problem. The experiment results reveal the effectiveness of the centralized and the decentralized solutions in considered scenarios. Specifically, the SAC assisted by the adaptive scheme significantly outperforms other centralized solutions in the training speed and the weighted spectral efficiency. Meanwhile, the decentralized MASAC algorithm behaves best in the early training speed.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A survey on Image Data Augmentation for Deep Learning
Shorten, C., & Khoshgoftaar, T. M. (2019) · Journal of Big Data · doi:10.1186/s40537-019-0197-0 · Cited by 13,203 · cited 1×
“It is worth mentioning that data augmentation techniques have attracted great attentions in deep learning, which is beneficial to training models by enhancing the size and quality of training datasets [32].”
BackgroundSoft actor-critic Off-policy maximum entropy deep reinforcement learning with a stochastic actor
Haarnoja, T., Zhou, A., Abbeel, P., & Levine, S. (2018) · arXiv · doi:10.48550/arxiv.1801.01290 · Cited by 5,594 · cited 5×
“…as where y t is the target value of main critic network, which can be expressed as where ρ is the temperature parameter, which reveals the relative importance of reward versus entropy term, brings the randomness of the optimal policy, and can be adaptively optimized according to ∇ ρ J ( ρ ) [31].”
BackgroundMethodInfluentialIntegrated Sensing and Communications: Toward Dual-Functional Wireless Networks for 6G and Beyond
Liu, F., Cui, Y., Masouros, C., Xu, J., Han, T. X., Eldar, Y. C., & Buzzi, S. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2022.3156632 · Cited by 3,857 · cited 1×
“I NTEGRATED sensing and communications (ISAC) system is promising in the next generation wireless network since it pursues a deeper integration paradigm, reduces both hardware and signaling costs, and has great potential to improve spectral and energy efficiencies [1], [2].”
BackgroundSoft Actor-Critic Algorithms and Applications
Haarnoja, T., Zhou, A., Hartikainen, K., Tucker, G., Ha, S., Tan, J., Kumar, V., Zhu, H., Gupta, A., Abbeel, P., et al. (2018) · arXiv · doi:10.48550/arxiv.1812.05905 · Cited by 1,994 · cited 1×
“The learning process of the SAC algorithm is to find the feasible and proper policy that maximizes the long-term cumulative discount reward as well as maximizes strategy entropy, this algorithm has better stability owing to encouraging exploration [38].”
BackgroundSingle and multi-agent deep reinforcement learning for AI-enabled wireless networks: A tutorial
Feriani, A., & Hossain, E. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3063822 · Cited by 410 · cited 1×
“In the centralized DRL framework, the agent interacts with the environment and learns to make the best sequential decisions, which is unnecessary to explicitly know the exact environment information [25], [26].”
BackgroundShe, C., Sun, C., Gu, Z., Li, Y., Yang, C., Poor, H. V., & Vucetic, B. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3053601 · Cited by 405
Metadata
- Authors
- Qin, Y., Zhang, Z., Li, X., Huangfu, W., & Zhang, H.
- Venue
- IEEE Transactions on Wireless Communications
- Published
- 2023-11
- Volume
- 22
- Issue
- 11
- Pages
- 8158-8169
- ISSN
- 1536-1276 (ISSN-L)
- 1558-2248
- OpenAlex
- W4361029920
- Cited by
- 167
- References
- 6
- FWCI
- 20.50
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Deep Reinforcement Learning Based Resource Allocation and Trajectory Planning in Integrated Sensing and Communications UAV Network. https://app.cochat.ai/papers/10.1109/twc.2023.3260304
- The paper
- Qin, Y., Zhang, Z., Li, X., Huangfu, W., & Zhang, H. (2023). Deep Reinforcement Learning Based Resource Allocation and Trajectory Planning in Integrated Sensing and Communications UAV Network. IEEE Transactions on Wireless Communications. https://doi.org/10.1109/twc.2023.3260304
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.