اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدImplicit and explicit communication in decentralized control
87
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
There has been substantial progress recently in understanding toy problems of purely implicit signaling. These are problems where the source and the channel are implicit -- the message is generated endogenously by the system, and the plant itself is used as a channel. In this paper, we explore how implicit and explicit communication can be used synergistically to reduce control costs. The setting is an extension of Witsenhausens counterexample where a rate-limited external channel connects the two controllers. Using a semi-deterministic version of the problem, we arrive at a binning-based strategy that can outperform the best known strategies by an arbitrarily large factor. We also show that our binning-based strategy attains within a constant factor of the optimal cost for an asymptotically infinite-length version of the problem uniformly over all problem parameters and all rates on the external channel. For the scalar case, although our results yield approximate optimality for each fixed rate, we are unable to prove approximately-optimality uniformly over all rates.
قيم البحث
اقرأ أيضاً
Graph neural network (GNN) is an efficient neural network model for graph data and is widely used in different fields, including wireless communications. Different from other neural network models, GNN can be implemented in a decentralized manner wit
h information exchanges among neighbors, making it a potentially powerful tool for decentralized control in wireless communication systems. The main bottleneck, however, is wireless channel impairments that deteriorate the prediction robustness of GNN. To overcome this obstacle, we analyze and enhance the robustness of the decentralized GNN in different wireless communication systems in this paper. Specifically, using a GNN binary classifier as an example, we first develop a methodology to verify whether the predictions are robust. Then, we analyze the performance of the decentralized GNN binary classifier in both uncoded and coded wireless communication systems. To remedy imperfect wireless transmission and enhance the prediction robustness, we further propose novel retransmission mechanisms for the above two communication systems, respectively. Through simulations on the synthetic graph data, we validate our analysis, verify the effectiveness of the proposed retransmission mechanisms, and provide some insights for practical implementation.
We investigate a novel anytime control algorithm for wireless networked control with random dropouts. The controller computes sequences of tentative future control commands using time-varying (Markovian) computational resources. The sensor-controller
and controller-actuator channel states are spatial- and time-correlated, and are modeled as a multi-state Markov process. To compensate for the effect of packet dropouts, a dual-buffer mechanism is proposed. We develop a novel cycle-cost-based approach to obtain the stability conditions on the nonlinear plant, controller, network and computational resources.
Integrating the unmanned aerial vehicles (UAVs) into the cellular network is envisioned to be a promising technology to significantly enhance the communication performance of both UAVs and existing terrestrial users. In this paper, we first provide a
n overview on the two main paradigms in cellular UAV communications, i.e., cellular-enabled UAV communication with UAVs as new aerial users served by the ground base stations (GBSs), and UAV-assisted cellular communication with UAVs as new aerial communication platforms serving the terrestrial users. Then, we focus on the former paradigm and study a new UAV trajectory design problem subject to practical communication connectivity constraints with the GBSs. Specifically, we consider a cellular-connected UAV in the mission of flying from an initial location to a final location, during which it needs to maintain reliable communication with the cellular network by associating with one GBS at each time instant. We aim to minimize the UAVs mission completion time by optimizing its trajectory, subject to a quality-of-connectivity constraint of the GBS-UAV link specified by a minimum receive signal-to-noise ratio target. To tackle this challenging non-convex problem, we first propose a graph connectivity based method to verify its feasibility. Next, by examining the GBS-UAV association sequence over time, we obtain useful structural results on the optimal UAV trajectory, based on which two efficient methods are proposed to find high-quality approximate trajectory solutions by leveraging graph theory and convex optimization techniques. The proposed methods are analytically shown to be capable of achieving a flexible trade-off between complexity and performance, and yielding a solution that is arbitrarily close to the optimal solution in polynomial time. Finally, we make concluding remarks and point out some promising directions for future work.
Technological advances have made wireless sensors cheap and reliable enough to be brought into industrial use. A major challenge arises from the fact that wireless channels introduce random packet dropouts. Power control and coding are key enabling t
echnologies in wireless communications to ensure efficient communications. In the present work, we examine the role of power control and coding for Kalman filtering over wireless correlated channels. Two estimation architectures are considered: In the first, the sensors send their measurements directly to a single gateway. In the second scheme, wireless relay nodes provide additional links. The gateway decides on the coding scheme and the transmitter power levels of the wireless nodes. The decision process is carried out on-line and adapts to varying channel conditions in order to improve the trade-off between state estimation accuracy and energy expenditure. In combination with predictive power control, we investigate the use of multiple-description coding, zero-error coding and network coding and provide sufficient conditions for the expectation of the estimation error covariance matrix to be bounded. Numerical results suggest that the proposed method may lead to energy savings of around 50 %, when compared to an alternative scheme, wherein transmission power levels and bit-rates are governed by simple logic. In particular, zero-error coding is preferable at time instances with high channel gains, whereas multiple-description coding is superior for time instances with low gains. When channels between the sensors and the gateway are in deep fades, network coding improves estimation accuracy significantly without sacrificing energy efficiency.
In this paper, we consider a networked control system (NCS) in which an dynamic plant system is connected to a controller via a temporally correlated wireless fading channel. We focus on communication power design at the sensor to minimize a weighted
average state estimation error at the remote controller subject to an average transmit power constraint of the sensor. The power control optimization problem is formulated as an infinite horizon average cost Markov decision process (MDP). We propose a novel continuous-time perturbation approach and derive an asymptotically optimal closed-form value function for the MDP. Under this approximation, we propose a low complexity dynamic power control solution which has an event- driven control structure. We also establish technical conditions for asymptotic optimality, and sufficient conditions for NCS stability under the proposed scheme.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
