اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAdaptive Optimal PMU Placement Based on Empirical Observability Gramian
305
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, we compare four measures of the empirical observability gramian, including the determinant, the trace, the minimum eigenvalue, and the condition number, which can be used to quantify the observability of system states and to obtain the optimal PMU placement for power system dynamic state estimation. An adaptive optimal PMU placement method is proposed by automatically choosing proper measures as the objective function. It is shown that when the number of PMUs is small and thus the observability is very weak, the minimum eigenvalue and the condition number are better measures of the observability and are preferred to be chosen as the objective function. The effectiveness of the proposed method is validated by performing dynamic state estimation on an Northeast Power Coordinating Council (NPCC) 48-machine 140-bus system with the square-root unscented Kalman filter.
قيم البحث
اقرأ أيضاً
This paper investigates a model reduction problem for linear directed network systems, in which the interconnections among the vertices are described by general weakly connected digraphs. First, the definitions of pseudo controllability and observabi
lity Gramians are proposed for semistable systems, and their solutions are characterized by Lyapunov-like equations. Then, we introduce a concept of vertex clusterability to guarantee the boundedness of the approximation error and use the newly proposed Gramians to facilitate the evaluation of the dissimilarity of each pair of vertices. An clustering algorithm is thereto provided to generate an appropriate graph clustering, whose characteristic matrix is employed as the projections in the Petrov-Galerkin reduction framework. The obtained reduced-order system preserves the weakly connected directed network structure, and the approximation error is computed by the pseudo Gramians. Finally, the efficiency of the proposed approach is illustrated by numerical examples.
This paper presents an adaptive combination strategy for distributed learning over diffusion networks. Since learning relies on the collaborative processing of the stochastic information at the dispersed agents, the overall performance can be improve
d by designing combination policies that adjust the weights according to the quality of the data. Such policies are important because they would add a new degree of freedom and endow multi-agent systems with the ability to control the flow of information over their edges for enhanced performance. Most adaptive and static policies available in the literature optimize certain performance metrics related to steady-state behavior, to the detriment of transient behavior. In contrast, we develop an adaptive combination rule that aims at optimizing the transient learning performance, while maintaining the enhanced steady-state performance obtained using policies previously developed in the literature.
In this paper we examine a symmetric tensor decomposition problem, the Gramian decomposition, posed as a rank minimization problem. We study the relaxation of the problem and consider cases when the relaxed solution is a solution to the original prob
lem. In some instances of tensor rank and order, we prove generically that the solution to the relaxation will be optimal in the original. In other cases, we present interesting examples and approaches that demonstrate the intricacy of this problem.
An approach to optimal actuator design based on shape and topology optimisation techniques is presented. For linear diffusion equations, two scenarios are considered. For the first one, best actuators are determined depending on a given initial condi
tion. In the second scenario, optimal actuators are determined based on all initial conditions not exceeding a chosen norm. Shape and topological sensitivities of these cost functionals are determined. A numerical algorithm for optimal actuator design based on the sensitivities and a level-set method is presented. Numerical results support the proposed methodology.
In this paper, we study the problem of optimal topology design in wireless networks equipped with highly-directional transmission antennas. We use the 1-2-1 network model to characterize the optimal placement of two relays that assist the communicati
on between a source-destination pair. We analytically show that under some conditions on the distance between the source-destination pair, the optimal topology in terms of maximizing the network throughput is to place the relays as close as possible to the source and the destination.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
