Joint Optimization of Handover Control and Power Allocation Based on Multi-Agent Deep Reinforcement Learning
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
In this paper, we study the handover (HO), and power allocation problem in a two-tier heterogeneous network (HetNet), which consists of a macro base station, and some millimeter-wave (mmWave) small base stations. We establish an HO management, and power allocation scheme to maximize the overall throughput while reducing the HO frequency. In particular, considering the interrelationship among decisions made by different user equipments (UEs), we first model the HO, and power allocation problem as a fully cooperative multi-agent task, in which all agents, i.e., UEs, have the same target. Then, to solve the multi-agent task, and get decentralized policies for each UE, we develop a multi-agent reinforcement learning (MARL) algorithm based on the proximal policy optimization (PPO) method, by introducing the centralized training with decentralized execution framework. That is, we use global information to train policies for each UE, and after the training is finished, each UE obtains a decentralized policy, which can be implemented only based on each UE's local observation. Specially, we introduce the counterfactual baseline to address the credit assignment problem in centralized learning. Due to the centralized training, the decentralized polices learned by multi-agent PPO (MAPPO) can work more cooperatively. Finally, the simulation results demonstrate that our method can achieve better performance comparing with other existing works.
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Proximal Policy Optimization Algorithms
Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. (2017) · arXiv · doi:10.48550/arxiv.1707.06347 · Cited by 10,625 · cited 7×
“2 is the best empirical value [24].”
BackgroundMethodInfluentialAndrews, J. G., Buzzi, S., Choi, W., Hanly, S. V., Lozano, A., Soong, A. C. K., & Zhang, J. C. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328098 · Cited by 8,106
Asynchronous Methods for Deep Reinforcement Learning
Mnih, V., Badia, A. P., Mirza, M., Graves, A., Lillicrap, T. P., Harley, T., Silver, D., & Kavukcuoglu, K. (2016) · arXiv · doi:10.48550/arxiv.1602.01783 · Cited by 7,132 · cited 3×
“Similar work to ours was given in [21], where authors solved the HO problem in the multi-agent setting by adopting the asynchronous advantage actor-critic (A3C) [22], which is a policy-gradient (PG) based deep RL method.”
ResultCategorical Reparameterization with Gumbel-Softmax
Jang, E., Gu, S., & Poole, B. (2016) · arXiv · doi:10.48550/arxiv.1611.01144 · Cited by 3,616
Markov Chains and Mixing Times
Levin, D., Peres, Y., & Wilmer, E. (2008) · doi:10.1090/mbk/058 · Cited by 2,241
Counterfactual Multi-Agent Policy Gradients
Foerster, J., Farquhar, G., Afouras, T., Nardelli, N., & Whiteson, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11794 · Cited by 1,873
Applications of Deep Reinforcement Learning in Communications and Networking: A Survey
Luong, N. C., Hoang, D. T., Gong, S., Niyato, D., Wang, P., Liang, Y.-C., & Kim, D. I. (2018) · arXiv · doi:10.48550/arxiv.1810.07862 · Cited by 17
Self-citation
Cited by
Agarwal, B., Togou, M. A., Ruffini, M., & Muntean, G.-M. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3207967 · Cited by 123
“The authors of [115] looked at the handover and PA problem in a HetNet system with numerous UEs.”
BackgroundChen, P., Liu, S., Chen, B., & Yu, L. (2022) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2022.3142087 · Cited by 120
Hua, M., Qi, X., Chen, D., Jiang, K., Liu, Z. E., Sun, H., Zhou, Q., & Xu, H. (2025) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2025.3574280 · Cited by 88
“Foerster et al. [73] and Guo et al. [74] [70].”
Meta-Transfer Learning-Based Handover Optimization for V2N Communication
Sohaib, R. M., Onireti, O., Tan, K., Sambo, Y., Swash, R., & Imran, M. A. (2024) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2024.3431875 · Cited by 15
“Moreover, an integrated HO and power distribution strategy was formulated for Het-Nets employing multi-agent DRL [26].”
MethodRaeisi, M., & Sesay, A. B. (2024) · IEEE Access · doi:10.1109/access.2024.3427124 · Cited by 12
Metadata
- Authors
- Guo, D., Tang, L., Zhang, X., & Liang, Y.-C.
- Venue
- IEEE Transactions on Vehicular Technology
- Published
- 2020-11
- Volume
- 69
- Issue
- 11
- Pages
- 13124-13138
- ISSN
- 0018-9545 (ISSN-L)
- 1939-9359
- OpenAlex
- W3083695346
- Cited by
- 213
- References
- 9
- FWCI
- 7.17
- 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: Joint Optimization of Handover Control and Power Allocation Based on Multi-Agent Deep Reinforcement Learning. https://app.cochat.ai/papers/10.1109/tvt.2020.3020400
- The paper
- Guo, D., Tang, L., Zhang, X., & Liang, Y.-C. (2020). Joint Optimization of Handover Control and Power Allocation Based on Multi-Agent Deep Reinforcement Learning. IEEE Transactions on Vehicular Technology. https://doi.org/10.1109/tvt.2020.3020400
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.