Zobrazeno 1 - 10
of 70
pro vyhledávání: '"Rung-Hung Gau"'
Autor:
Rung-Hung Gau, Yu-Hsin Hsu
Publikováno v:
IEEE Transactions on Mobile Computing. 21:306-320
In this paper, we propose a reinforcement learning approach of collision avoidance and investigate optimal trajectory planning for unmanned aerial vehicle (UAV) communication networks. Specifically, each UAV takes charge of delivering objects in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b41bb21c97842d26fc7410fe8a2d423
https://doi.org/10.1109/tmc.2020.3003639
https://doi.org/10.1109/tmc.2020.3003639
Autor:
Yun-Chun Ko, Rung-Hung Gau
Publikováno v:
IEEE Transactions on Mobile Computing. :1-18
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe3a59a9b8cbac37b40b46f482621429
https://doi.org/10.1109/tmc.2022.3182975
https://doi.org/10.1109/tmc.2022.3182975
Autor:
Suat Cheng Ong, Rung-Hung Gau
Publikováno v:
ICC 2022 - IEEE International Conference on Communications.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f8f7c3f725e122b9c5c99de0343ffa1f
https://doi.org/10.1109/icc45855.2022.9838873
https://doi.org/10.1109/icc45855.2022.9838873
Autor:
Po-Yen Lai, Rung-Hung Gau
Publikováno v:
2022 IEEE Wireless Communications and Networking Conference (WCNC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dceb5026595584e09135e9667cc13a44
https://doi.org/10.1109/wcnc51071.2022.9771685
https://doi.org/10.1109/wcnc51071.2022.9771685
Publikováno v:
IEEE Transactions on Communications. 68:2032-2047
In this paper, we propose a geometric approach for optimal power control and relay selection in NOMA wireless relay networks. First, for each pair of relays, to derive an optimal vector of transmission power that maximizes the network throughput, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fb224791d1dbdb3986addfdcbc6f0278
https://doi.org/10.1109/tcomm.2020.2965526
https://doi.org/10.1109/tcomm.2020.2965526
Publikováno v:
ICC
This paper aims to propose a three-dimensional (3D) point process that can be employed to generally deploy unmanned aerial vehicles (UAVs) in a large-scale cellular network and tractably analyze the fundamental network-wide performances of the networ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34e9b4d39435b1d8d5bc89880780801a
https://doi.org/10.1109/icc42927.2021.9500441
https://doi.org/10.1109/icc42927.2021.9500441
Publikováno v:
VTC Spring
In this paper, we propose using a decentralized planning-assisted approach of deep reinforcement learning for collision and obstacle avoidance in UAV networks. We focus on a UAV network where there are multiple UAVs and multiple static obstacles. To
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::244d333466e2ea526ed3163f61dc253c
https://doi.org/10.1109/vtc2021-spring51267.2021.9448710
https://doi.org/10.1109/vtc2021-spring51267.2021.9448710
Publikováno v:
VTC Spring
In this paper, we study the problem of optimal beamforming for non-orthogonal multiple-access (NOMA) wireless relay networks. For a two-hop wireless relay network that consists of a NOMA broadcasting channel and a Gaussian interference channel, we pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a7d97bdc50fcd30b8819b38c7cd374b3
https://doi.org/10.1109/vtc2021-spring51267.2021.9448831
https://doi.org/10.1109/vtc2021-spring51267.2021.9448831
Publikováno v:
SAM
Sparse subspace clustering (SSC) using greedy- based neighbor selection, such as matching pursuit (MP) and orthogonal matching pursuit (OMP), has been known as a popular computationally-efficient alternative to the conventional l 1 -minimization base
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5464ccb84852c2abaa898c49e03e3e2
https://doi.org/10.1109/sam48682.2020.9104341
https://doi.org/10.1109/sam48682.2020.9104341
Publikováno v:
SAM
Data dimensionality reduction via linear embedding is a typical approach to economizing the computational cost of machine learning systems. In the context of sparse subspace clustering (SSC), this paper proposes a two-step neighbor identification sch
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::10616dcad6434518d905567d96f057c2
https://doi.org/10.1109/sam48682.2020.9104396
https://doi.org/10.1109/sam48682.2020.9104396