Intelligent Trajectory Design for RIS-NOMA aided Multi-robot
Communications
- URL: http://arxiv.org/abs/2205.01647v2
- Date: Wed, 4 May 2022 12:11:36 GMT
- Title: Intelligent Trajectory Design for RIS-NOMA aided Multi-robot
Communications
- Authors: Xinyu Gao, Xidong Mu, Wenqiang Yi, Yuanwei Liu
- Abstract summary: The goal is to maximize the sum-rate of whole trajectories for multi-robot system by jointly optimizing trajectories and NOMA decoding orders of robots.
An integrated machine learning (ML) scheme is proposed, which combines long short-term memory (LSTM)-autoregressive integrated moving average (ARIMA) model and dueling double deep Q-network (D$3$QN) algorithm.
- Score: 59.34642007625687
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A novel reconfigurable intelligent surface-aided multi-robot network is
proposed, where multiple mobile robots are served by an access point (AP)
through non-orthogonal multiple access (NOMA). The goal is to maximize the
sum-rate of whole trajectories for multi-robot system by jointly optimizing
trajectories and NOMA decoding orders of robots, phase-shift coefficients of
the RIS, and the power allocation of the AP, subject to predicted initial and
final positions of robots and the quality of service (QoS) of each robot. To
tackle this problem, an integrated machine learning (ML) scheme is proposed,
which combines long short-term memory (LSTM)-autoregressive integrated moving
average (ARIMA) model and dueling double deep Q-network (D$^{3}$QN) algorithm.
For initial and final position prediction for robots, the LSTM-ARIMA is able to
overcome the problem of gradient vanishment of non-stationary and non-linear
sequences of data. For jointly determining the phase shift matrix and robots'
trajectories, D$^{3}$QN is invoked for solving the problem of action value
overestimation. Based on the proposed scheme, each robot holds a global optimal
trajectory based on the maximum sum-rate of a whole trajectory, which reveals
that robots pursue long-term benefits for whole trajectory design. Numerical
results demonstrated that: 1) LSTM-ARIMA model provides high accuracy
predicting model; 2) The proposed D$^{3}$QN algorithm can achieve fast average
convergence; 3) The RIS with higher resolution bits offers a bigger sum-rate of
trajectories than lower resolution bits; and 4) RIS-NOMA networks have superior
network performance compared to RIS-aided orthogonal counterparts.
Related papers
- Collaborative Intelligent Reflecting Surface Networks with Multi-Agent
Reinforcement Learning [63.83425382922157]
Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks.
In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
arXiv Detail & Related papers (2022-03-26T20:37:14Z) - A Robust Deep Learning-Based Beamforming Design for RIS-assisted
Multiuser MISO Communications with Practical Constraints [4.727307803726522]
We consider a RIS-aided multiuser multiple-input single-output downlink communication system.
We develop a deep quantization neural network (DQNN) to simultaneously design the active and passive beamforming.
We extend the two proposed DQNN-based algorithms to the case that the discrete phase shifts and imperfect CSI are considered simultaneously.
arXiv Detail & Related papers (2021-11-12T03:53:20Z) - SABER: Data-Driven Motion Planner for Autonomously Navigating
Heterogeneous Robots [112.2491765424719]
We present an end-to-end online motion planning framework that uses a data-driven approach to navigate a heterogeneous robot team towards a global goal.
We use model predictive control (SMPC) to calculate control inputs that satisfy robot dynamics, and consider uncertainty during obstacle avoidance with chance constraints.
recurrent neural networks are used to provide a quick estimate of future state uncertainty considered in the SMPC finite-time horizon solution.
A Deep Q-learning agent is employed to serve as a high-level path planner, providing the SMPC with target positions that move the robots towards a desired global goal.
arXiv Detail & Related papers (2021-08-03T02:56:21Z) - Joint Deep Reinforcement Learning and Unfolding: Beam Selection and
Precoding for mmWave Multiuser MIMO with Lens Arrays [54.43962058166702]
millimeter wave (mmWave) multiuser multiple-input multiple-output (MU-MIMO) systems with discrete lens arrays have received great attention.
In this work, we investigate the joint design of a beam precoding matrix for mmWave MU-MIMO systems with DLA.
arXiv Detail & Related papers (2021-01-05T03:55:04Z) - Reconfigurable Intelligent Surface Assisted Mobile Edge Computing with
Heterogeneous Learning Tasks [53.1636151439562]
Mobile edge computing (MEC) provides a natural platform for AI applications.
We present an infrastructure to perform machine learning tasks at an MEC with the assistance of a reconfigurable intelligent surface (RIS)
Specifically, we minimize the learning error of all participating users by jointly optimizing transmit power of mobile users, beamforming vectors of the base station, and the phase-shift matrix of the RIS.
arXiv Detail & Related papers (2020-12-25T07:08:50Z) - RIS Enhanced Massive Non-orthogonal Multiple Access Networks: Deployment
and Passive Beamforming Design [116.88396201197533]
A novel framework is proposed for the deployment and passive beamforming design of a reconfigurable intelligent surface (RIS)
The problem of joint deployment, phase shift design, as well as power allocation is formulated for maximizing the energy efficiency.
A novel long short-term memory (LSTM) based echo state network (ESN) algorithm is proposed to predict users' tele-traffic demand by leveraging a real dataset.
A decaying double deep Q-network (D3QN) based position-acquisition and phase-control algorithm is proposed to solve the joint problem of deployment and design of the RIS.
arXiv Detail & Related papers (2020-01-28T14:37:38Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.