Publications about 'bilinear systems' |
Articles in journal or book chapters |
This paper asks what classes of input signals are sufficient in order to completely identify the input/output behavior of generic bilinear systems. The main results are that step inputs are not sufficient, nor are single pulses, but the family of all pulses (of a fixed amplitude but varying widths) do suffice for identification. |
A result is presented showing the existence of inputs universal for observability, uniformly with respect to the class of all continuous-time analytic systems. This represents an ultimate generalization of a 1977 theorem, for bilinear systems, due to Alberto Isidori and Osvaldo Grasselli. |
This note discusses two integral variants of the input-to-state stability (ISS) property, which represent nonlinear generalizations of L2 stability, in much the same way that ISS generalizes L-infinity stability. Both variants are equivalent to ISS for linear systems. For general nonlinear systems, it is shown that one of the new properties is strictly weaker than ISS, while the other one is equivalent to it. For bilinear systems, a complete characterization is provided of the weaker property. An interesting fact about functions of type KL is proved as well. |
This paper studies accessibility (weak controllability) of bilinear systems under constant sampling rates. It is shown that the property is preserved provided that the sampling period satisfies a condition related to the eigenvalues of the autonomous dynamics matrix. This condition generalizes the classical Kalman-Ho-Narendra criterion which is well known in the linear case, and which, for observability, results in the classical Nyquist theorem. |
For continuous time analytic input/output maps, the existence of a singular differential equation relating derivatives of controls and outputs is shown to be equivalent to bilinear realizability. A similar result holds for the problem of immersion into bilinear systems. The proof is very analogous to that of the corresponding, and previously known, result for discrete time. |
The present article compares the difficulties of deciding controllability and accessibility. These are standard properties of control systems, but complete algebraic characterizations of controllability have proved elusive. We show in particular that for subsystems of bilinear systems, accessibility can be decided in polynomial time, but controllability is NP-hard. |
Explicit equations are given for the moduli space of framed instantons as a quasi-affine variety, based on the representation theory of noncommutative power series, or equivalently, the minimal realization theory of bilinear systems. |
Weak controllability of bilinear systems is preserved under sampling provided that the sampling period satisfies a condition related to the eigenvalues of the autonomous dynamics matrix. This condition generalizes the classical Kalman-Ho-Narendra criterion which is well known in the linear case. |
Conference articles |
In large-scale networks, agents and links are often vulnerable to attacks. This paper focuses on continuous-time bilinear networks, where additive disturbances model attacks or uncertainties on agents/states (node disturbances), and multiplicative disturbances model attacks or uncertainties on couplings between agents/states (link disturbances). It investigates network robustness notion in terms of the underlying digraph of the network, and structure of exogenous uncertainties and attacks. Specifically, it defines a robustness measure using the $\mathcal H_2$-norm of the network and calculates it in terms of the reachability Gramian of the bilinear system. The main result is that under certain conditions, the measure is supermodular over the set of all possible attacked links. The supermodular property facilitates the efficient solution finding of the optimization problem. Examples illustrate how different structures can make the system more or less vulnerable to malicious attacks on links. |
When measuring importance of nodes in a network, the interconnections and dynamics are often supposed to be perfectly known. In this paper, we consider networks of agents with both uncertain couplings and dynamics. Network uncertainty is modeled by structured additive stochastic disturbances on each agentâ€™s update dynamics and coupling weights. We then study how these uncertainties change the network's centralities. Disturbances on the couplings between agents resul in bilinear dynamics, and classical centrality indices from linear network theory need to be redefined. To do that, we first show that, similarly to its linear counterpart, the squared H2 norm of bilinear systems measures the trace of the steady-state error covariance matrix subject to stochastic disturbances. This makes the H2 norm a natural candidate for a performance metric of the system. We propose a centrality index for the agents based on the H2 norm, and show how it depends on the network topology and the noise structure. Finally, we simulate a few graphs to illustrate how uncertainties on different couplings affect the agents' centrality rankings compared to a linearized model of the same system. |
This paper deals with the computational complexity, and in some cases undecidability, of several problems in nonlinear control. The objective is to compare the theoretical difficulty of solving such problems to the corresponding problems for linear systems. In particular, the problem of null-controllability for systems with saturations (of a "neural network" type) is mentioned, as well as problems regarding piecewise linear (hybrid) systems. A comparison of accessibility, which can be checked fairly simply by Lie-algebraic methods, and controllability, which is at least NP-hard for bilinear systems, is carried out. Finally, some remarks are given on analog computation in this context. |
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders.
This document was translated from BibT_{E}X by bibtex2html