TY - GEN
T1 - Integrated Robotics Networks with Co-optimization of Drone Placement and Air-Ground Communications
AU - Hu, Menghao
AU - Zhang, Tong
AU - Wang, Shuai
AU - Li, Guoliang
AU - Chen, Yingyang
AU - Li, Qiang
AU - Chen, Gaojie
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - Terrestrial robots, i.e., unmanned ground vehicles (UGVs), and aerial robots, i.e., unmanned aerial vehicles (UAVs), operate in separate spaces. To exploit their complementary features (e.g., fields of views, communication links, computing capabilities), a promising paradigm termed integrated robotics network therefore emerges, which provides communications for cooperative UAVs-UGVs applications. However, how to efficiently deploy UAVs and schedule the UAVs-UGVs connections according to different UGV tasks become challenging. In this paper, we consider the sum-rate maximization problem, where UGVs plan their trajectories autonomously and are dynamically associated with UAVs according to their planned trajectories. Although this problem is a NP-hard mixed integer program, a fast polynomial time algorithm using alternating gradient descent and penalty-based binary relaxation, is devised. Simulation results demonstrate the effectiveness of the proposed algorithm.
AB - Terrestrial robots, i.e., unmanned ground vehicles (UGVs), and aerial robots, i.e., unmanned aerial vehicles (UAVs), operate in separate spaces. To exploit their complementary features (e.g., fields of views, communication links, computing capabilities), a promising paradigm termed integrated robotics network therefore emerges, which provides communications for cooperative UAVs-UGVs applications. However, how to efficiently deploy UAVs and schedule the UAVs-UGVs connections according to different UGV tasks become challenging. In this paper, we consider the sum-rate maximization problem, where UGVs plan their trajectories autonomously and are dynamically associated with UAVs according to their planned trajectories. Although this problem is a NP-hard mixed integer program, a fast polynomial time algorithm using alternating gradient descent and penalty-based binary relaxation, is devised. Simulation results demonstrate the effectiveness of the proposed algorithm.
UR - https://www.scopus.com/pages/publications/85181170740
U2 - 10.1109/VTC2023-Fall60731.2023.10333787
DO - 10.1109/VTC2023-Fall60731.2023.10333787
M3 - 会议稿件
AN - SCOPUS:85181170740
T3 - IEEE Vehicular Technology Conference
BT - 2023 IEEE 98th Vehicular Technology Conference, VTC 2023-Fall - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 98th IEEE Vehicular Technology Conference, VTC 2023-Fall
Y2 - 10 October 2023 through 13 October 2023
ER -