ترغب بنشر مسار تعليمي؟ اضغط هنا

Balanced Truncation of Networked Linear Passive Systems

65   0   0.0 ( 0 )
 نشر من قبل Xiaodong Cheng
 تاريخ النشر 2017
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

This paper studies model order reduction of multi-agent systems consisting of identical linear passive subsystems, where the interconnection topology is characterized by an undirected weighted graph. Balanced truncation based on a pair of specifically selected generalized Gramians is implemented on the asymptotically stable part of the full-order network model, which leads to a reduced-order system preserving the passivity of each subsystem. Moreover, it is proven that there exists a coordinate transformation to convert the resulting reduced-order model to a state-space model of Laplacian dynamics. Thus, the proposed method simultaneously reduces the complexity of the network structure and individual agent dynamics, and it preserves the passivity of the subsystems and the synchronization of the network. Moreover, it allows for the a priori computation of a bound on the approximation error. Finally, the feasibility of the method is demonstrated by an example.

قيم البحث

اقرأ أيضاً

This paper deals with the balanced truncation model reduction of discrete-time, linear time-varying, heterogeneous subsystems interconnected over finite arbitrary directed graphs. The information transfer between the subsystems is subject to a commun ication latency of one time-step. The presented method guarantees the preservation of the interconnection structure and further allows for its simplification. In addition to truncating temporal states associated with the subsystems, the method allows for the order reduction of spatial states associated with the interconnections between the subsystems and even the removal of whole interconnections. Upper bounds on the l2-induced norm of the resulting error system are derived. The proposed method is illustrated through an example.
Considering the use of dynamical systems in practical applications, often only limited regions in the time or frequency domain are of interest. Therefor, it usually pays off to compute local approximations of the used dynamical systems in the frequen cy and time domain. In this paper, we consider a structure-preserving extension of the frequency- and time-limited balanced truncation methods to second-order dynamical systems. We give a full overview about the first-order limited balanced truncation methods and extend those methods to second-order systems by using the different second-order balanced truncation formulas from the literature. Also, we present numerical methods for solving the arising large-scale sparse matrix equations and give numerical modifications to deal with the problematic case of second-order systems. The results are then illustrated on three numerical examples.
This paper considers a networked aggregative game (NAG) where the players are distributed over a communication network. By only communicating with a subset of players, the goal of each player in the NAG is to minimize an individual cost function that depends on its own action and the aggregate of all the players actions. To this end, we design a novel distributed algorithm that jointly exploits the ideas of the consensus algorithm and the conditional projection descent. Under strongly monotone assumption on the pseudo-gradient mapping, the proposed algorithm with fixed step-sizes is proved to converge linearly to the unique Nash equilibrium of the NAG. Then the theoretical results are validated by numerical experiments.
This paper studies the controllability of networked multi-input-multi-output (MIMO) systems, in which the network topology is weighted and directed, and the nodes are heterogeneous higher-dimensional linear time-invariant (LTI) dynamical systems. The primary objective is to search for controllability criteria beyond those already known for homogeneous networks. The focus is on the effects of the network topology, node dynamics, external control inputs, as well as the inner interactions on the network controllability. It is found that a network of heterogeneous systems can be controllable even if the corresponding homogeneous network topology is uncontrollable. The finding thus unravels another fundamental property that affects the network controllability---the heterogeneity of the node dynamics. A necessary and sufficient condition is derived for the controllability of heterogeneous networked MIMO LTI systems. For some typical cases, necessary and/or sufficient controllability conditions are specified and presented on the node dynamics, inner interactions, as well as the network topology.
The paper considers the problem of equalization of passive linear quantum systems. While our previous work was concerned with the analysis and synthesis of passive equalizers, in this paper we analyze coherent quantum equalizers whose annihilation (r espectively, creation) operator dynamics in the Heisenberg picture are driven by both quadratures of the channel output field. We show that the characteristics of the input field must be taken into consideration when choosing the type of the equalizing filter. In particular, we show that for thermal fields allowing the filter to process both quadratures of the channel output may not improve mean square accuracy of the input field estimate, in comparison with passive filters. This situation changes when the input field is `squeezed.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا