اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMinimum-Complexity Failure Correction in Linear Arrays via Compressive Processing
73
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Given an array with defective elements, failure correction (FC) aims at finding a new set of weights for the working elements so that the properties of the original pattern can be recovered. Unlike several FC techniques available in the literature, which update all the working excitations, the Minimum-Complexity Failure Correction (MCFC) problem is addressed in this paper. By properly reformulating the FC problem, the minimum number of corrections of the whole excitations of the array is determined by means of an innovative Compressive Processing (CP) technique in order to afford a pattern as close as possible to the original one (i.e., the array without failures). Selected examples, from a wide set of numerical test cases, are discussed to assess the effectiveness of the proposed approach as well as to compare its performance with other competitive state-of-the-art techniques in terms of both pattern features and number of corrections.
قيم البحث
اقرأ أيضاً
In this paper, we study the structural state and input observability of continuous-time switched linear time-invariant systems and unknown inputs. First, we provide necessary and sufficient conditions for their structural state and input observabilit
y that can be efficiently verified in $O((m(n+p))^2)$, where $n$ is the number of state variables, $p$ is the number of unknown inputs, and $m$ is the number of modes. Moreover, we address the minimum sensor placement problem for these systems by adopting a feed-forward analysis and by providing an algorithm with a computational complexity of $ O((m(n+p)+alpha)^{2.373})$, where $alpha$ is the number of target strongly connected components of the systems digraph representation. Lastly, we explore different assumptions on both the system and unknown inputs (latent space) dynamics that add more structure to the problem, and thereby, enable us to render algorithms with lower computational complexity, which are suitable for implementation in large-scale systems.
The design of phased arrays able to generate arbitrary-shaped beams through a sub-arrayed architecture is addressed here. The synthesis problem is cast in the excitation matching framework, so as to yield clustered phased arrays providing optimal tra
de-offs between the complexity of the array architecture (i.e., the minimum number of control points at the sub-array level) and the matching of a reference pattern. A synthesis tool based on the k-means algorithm is proposed for jointly optimizing the sub-array configuration and the complex sub-array coefficients. Selected numerical results, including pencil beams with sidelobe notches and asymmetric lobes as well as shaped main lobes, are reported and discussed to highlight the peculiarities of the proposed approach also in comparison with some extensions to complex excitations of state-of-the-art sub-array design methods.
Coprime arrays enable Direction-of-Arrival (DoA) estimation of an increased number of sources. To that end, the receiver estimates the autocorrelation matrix of a larger virtual uniform linear array (coarray), by applying selection or averaging to th
e physical arrays autocorrelation estimates, followed by spatial-smoothing. Both selection and averaging have been designed under no optimality criterion and attain arbitrary (suboptimal) Mean-Squared-Error (MSE) estimation performance. In this work, we design a novel coprime array receiver that estimates the coarray autocorrelations with Minimum-MSE (MMSE), for any probability distribution of the source DoAs. Our extensive numerical evaluation illustrates that the proposed MMSE approach returns superior autocorrelation estimates which, in turn, enable higher DoA estimation performance compared to standard counterparts.
In this paper we present a Learning Model Predictive Control (LMPC) strategy for linear and nonlinear time optimal control problems. Our work builds on existing LMPC methodologies and it guarantees finite time convergence properties for the closed-lo
op system. We show how to construct a time varying safe set and terminal cost function using closed-loop data. The resulting LMPC policy is time varying and it guarantees recursive constraint satisfaction and non-decreasing performance. Computational efficiency is obtained by convexifing the safe set and terminal cost function. We demonstrate that, for a class of nonlinear system and convex constraints, the convex LMPC formulation guarantees recursive constraint satisfaction and non-decreasing performance. Finally, we illustrate the effectiveness of the proposed strategies on minimum time obstacle avoidance and racing examples.
Phase Shifting Transformers (PST) are used to control or block certain flows of real power through phase angle regulation across the device. Its functionality is crucial to special situations such as eliminating loop flow through an area and balancin
g real power flow between parallel paths. Impedance correction tables are used to model that the impedance of phase shifting transformers often vary as a function of their phase angle shift. The focus of this paper is to consider the modeling errors if the impact of this changing impedance is ignored. The simulations are tested through different scenarios using a 37-bus test case and a 10,000-bus synthetic power grid. The results verify the important role of impedance correction factor to get more accurate and optimal power solutions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
