The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Dynamic Beam Hopping Method Based on Multi-Objective Deep Reinforcement Learning for Next Generation Satellite Broadband Systems
Abstract
When regarding the inherent uncertainty of differentiated services requirements as well as the non-uniform spatial distribution of capacity requests, it is essential to flexibility adjust resources of the satellite to satisfy the different conditions. How to match the system capacity demand with efficient utilization of beam is a brand-new challenge. The convention beam hopping methods ignores the intrinsic correlation between decisions, do not consider the long-term reward, and only achieve the optimal solution at the current time. Therefore, system complexity increases significantly as the increase of the demand for differentiated services or beam number. This paper investigates the optimal policy for beam hopping in DVB-S2X satellite with multiple purposes of assuring the fairness of each beam services, minimizing the delay of real-time services transmission, and maximizing the throughput of non-instant services transmission. Since wireless channel conditions, differentiated services arrival rates have stochastic properties, and the multi-beam satellite environment's dynamics are unknown, the model-free multi-objective deep reinforcement learning approach is used to learn the optimal policy through interactions with the situation. To solve the problem with action dimensional disaster, a novel multi-action selection method based on a Double-Loop Learning (DLL) is proposed. Moreover, the multi-dimensional state is reformulated and obtained by the deep neural network. Under realistic conditions achieving evaluation results demonstrate that the proposed method can pursue multiple objectives simultaneously, and it can also allocate resource intelligently adapting to the user requirements and channel conditions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
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
Playing Atari with Deep Reinforcement Learning
Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., & Riedmiller, M. (2013) · arXiv · doi:10.48550/arxiv.1312.5602 · Cited by 9,471
Mastering the game of Go without human knowledge
Silver, D., Schrittwieser, J., Simonyan, K., Antonoglou, I., Huang, A., Guez, A., Hubert, T., Baker, L., Lai, M., Bolton, A., et al. (2017) · Nature · doi:10.1038/nature24270 · Cited by 9,084
Scalarized multi-objective reinforcement learning: Novel design techniques
Van Moffaert, K., Drugan, M. M., & Nowe, A. (2013) · 2013 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning (ADPRL) · doi:10.1109/adprl.2013.6615007 · Cited by 253
Cited by
Evolution of Non-Terrestrial Networks From 5G to 6G: A Survey
Azari, M. M., Solanki, S., Chatzinotas, S., Kodheli, O., Sallouha, H., Colpaert, A., Mendoza Montoya, J. F., Pollin, S., Haqiqatnejad, A., Mostaani, A., et al. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3199901 · Cited by 668
A practical guide to multi-objective reinforcement learning and planning
Hayes, C. F., Rădulescu, R., Bargiacchi, E., Källström, J., Macfarlane, M., Reymond, M., Verstraeten, T., Zintgraf, L. M., Dazeley, R., Heintz, F., et al. (2022) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-022-09552-y · Cited by 400
“In addition to the motivating examples discussed above, recent years have seen multiobjective learning and planning methods applied across a wide range of problem domains including: distributed computing [27, 124], drug and molecule design [62, 214], cybersecurity [162], simulation [132], job shop scheduling [98], cog…”
BackgroundLow Earth Orbit Satellite Security and Reliability: Issues, Solutions, and the Road Ahead
Yue, P., An, J., Zhang, J., Ye, J., Pan, G., Wang, S., Xiao, P., & Hanzo, L. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3296160 · Cited by 291
Mahboob, S., & Liu, L. (2024) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3347145 · Cited by 255
Wang, X., Liu, W., Lin, H., Hu, J., Kaur, K., & Hossain, M. S. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3209903 · Cited by 63
Metadata
- Authors
- Hu, X., Zhang, Y., Liao, X., Liu, Z., Wang, W., & Ghannouchi, F. M.
- Venue
- IEEE Transactions on Broadcasting
- Published
- 2020-09
- Volume
- 66
- Issue
- 3
- Pages
- 630-646
- ISSN
- 0018-9316 (ISSN-L)
- 1557-9611
- OpenAlex
- W3000537180
- Cited by
- 208
- References
- 4
- FWCI
- 13.81
- 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: Dynamic Beam Hopping Method Based on Multi-Objective Deep Reinforcement Learning for Next Generation Satellite Broadband Systems. https://app.cochat.ai/papers/10.1109/tbc.2019.2960940
- The paper
- Hu, X., Zhang, Y., Liao, X., Liu, Z., Wang, W., & Ghannouchi, F. M. (2020). Dynamic Beam Hopping Method Based on Multi-Objective Deep Reinforcement Learning for Next Generation Satellite Broadband Systems. IEEE Transactions on Broadcasting. https://doi.org/10.1109/tbc.2019.2960940
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.