Searcharxiv⌕ Search

arXiv subjects

Hannes Gernandt

Publications and source records attributed to Hannes Gernandt.

At least 37 records · Page 2Linked to original sources

Port-Hamiltonian Modeling and Control of Electric Vehicle Charging Stations

Electric vehicles (EV) are an important part of future sustainable transportation. The increasing integration of EV charging stations (EVCSs) in the existing power grids require new scaleable control algorithms that maintain the stability and resilience of the grid. Here, we present such a control approach using an averaged port-Hamiltonian model. In this approach, the underlying switching behavior of the power converters is approximated by an averaged non-linear system. The averaged models are used to derive various types of stabilizing controllers, including the typically used PI controllers. The pH modeling is showcased by means of a generic setup of an EVCS, where the battery of the vehicle is connected to an AC grid via power lines, converters, and filters. Finally, the control design methods are compared for the averaged pH system and validated using a simulation model of the switched charging station.

math.OC↗

Linear-quadratic optimal control for abstract differential-algebraic equations

In this paper, we extend a classical approach to linear quadratic (LQ) optimal control via Popov operators to abstract linear differential-algebraic equations (ADAEs) in Hilbert spaces. To ensure existence of solutions, we assume that the underlying differential-algebraic equation has index one in the pseudo-resolvent sense. This leads to the existence of a degenerate semigroup that can be used to define a Popov operator for our system. It is shown that under a suitable coercivity assumption for the Popov operator the optimal costs can be described by a bounded Riccati operator and that the optimal control input is of feedback form. Furthermore, we characterize exponential stability of ADAEs which is required to solve the infinite horizon LQ problem.

math.OC↗

Model Predictive Control of District Heating Grids Using Stabilizing Terminal Ingredients

The transformation of fossil fuel-based district heating grids (DHGs) to CO$_2$-neutral DHGs requires the development of novel operating strategies. Model predictive control (MPC) is a promising approach, as knowledge about future heat demand and heat supply can be incorporated into the control, operating constraints can be ensured and the stability of the closed-loop system can be guaranteed. In this paper, we employ MPC for DHGs to control the system mass flows and injected heat flows. Following common practice, we derive terminal ingredients to stabilize given steady state temperatures and storage masses in the DHG. To apply MPC with terminal ingredients, it is crucial that the system under control is stabilizable. By exploiting the particular system structure, we give a sufficient condition for the stabilizability in terms of the grid topology and hence, for the applicability of the MPC scheme to DHGs. Furthermore, we demonstrate the practicability of the application of MPC to an exemplary DHG in a numerical case study.

eess.SY↗

Feedback rectifiable pairs and stabilization of switched linear systems

We address the feedback design problem for switched linear systems. In particular we aim to design a switched state-feedback such that the resulting closed-loop subsystems share the same eigenstructure. To this effect we formulate and analyse the feedback rectification problem for pairs of matrices. We present necessary and sufficient conditions for the feedback rectifiability of pairs for two subsystems and give a constructive procedure to design stabilizing state-feedback for a class of switched systems. In particular the proposed algorithm provides sets of eigenvalues and corresponding eigenvectors for the closed-loop subsystems that guarantee stability for arbitrary switching. Several examples illustrate the characteristics of the problem considered and the application of the proposed design procedure.

math.OC↗

A pseudo-resolvent approach to abstract differential-algebraic equations

We study linear abstract differential-algebraic equations (ADAEs), and we introduce an index concept which is based on polynomial growth of a~pseudo-resolvent. Our approach to solvability analysis is based on degenerate semigroups. We apply our results to some examples such as distributed circuit elements, and a system obtained by heat-wave coupling.

math.FA↗

Stability and passivity for a class of distributed port-Hamiltonian networks

We consider a class of infinite dimensional (distributed) pH systems which is invariant under Kirchhoff-type interconnections and prove exponential stability and a power balance equation for classical solutions. The results are illustrated for power networks that incorporate distributed transmission line models based on the telegraph equations.

math.OC↗

On discrete-time dissipative port-Hamiltonian (descriptor) systems

Port-Hamiltonian (pH) systems have been studied extensively for linear continuous-time dynamical systems. This manuscript presents a discrete-time pH descriptor formulation for linear, completely causal, scattering passive dynamical systems based on the system coefficients. The relation of this formulation to positive and bounded real systems and the characterization via positive semidefinite solutions of Kalman-Yakubovich-Popov inequalities is also studied.

math.OC↗

A geometric framework for discrete time port-Hamiltonian systems

Port-Hamiltonian systems provide an energy-based formulation with a model class that is closed under structure preserving interconnection. For continuous-time systems these interconnections are constructed by geometric objects called Dirac structures. In this paper, we derive this geometric formulation and the interconnection properties for scattering passive discrete-time port-Hamiltonian systems.

math.OC↗

The difference between port-Hamiltonian, passive and positive real descriptor systems

The relation between passive and positive real systems has been extensively studied in the literature. In this paper, we study their connection to the more recently used notion of port-Hamiltonian descriptor systems. It is well-known that port-Hamiltonian systems are passive and that passive systems are positive real. Hence it is studied under which assumptions the converse implications hold. Furthermore, the relationship between passivity, KYP inequalities and a~finite available storage is investigated.

math.OC↗

On characteristic invariants of matrix pencils and linear relations

The relationship between linear relations and matrix pencils is investigated. Given a linear relation, we introduce its Weyr characteristic. If the linear relation is the range (or the kernel) representation of a given matrix pencil, we show that there is a correspondence between this characteristic and the Kronecker canonical form of the pencil. This relationship is exploited to obtain estimations on the invariant characteristics of matrix pencils under rank one perturbations.

math.SP↗

On the stability of port-Hamiltonian descriptor systems

We characterize stable differential-algebraic equations (DAEs) using a generalized Lyapunov inequality. The solution of this inequality is then used to rewrite stable DAEs as dissipative Hamiltonian (dH) DAEs on the subspace where the solutions evolve. Conversely, we give sufficient conditions guaranteeing stability of dH DAEs. Further, for stabilizable descriptor systems we construct solutions of generalized algebraic Bernoulli equations which can then be used to rewrite these systems as pH descriptor systems. Furthermore, we show how to describe the stable and stabilizable systems using Dirac and Lagrange structures.

math.OC↗

The spectrum and the Weyr characteristics of operator pencils and linear relations

The relation between the spectra of operator pencils with unbounded coefficients and of associated linear relations is investigated. It turns out that various types of spectrum coincide and the same is true for the Weyr characteristics. This characteristic describes how many independent Jordan chains up to a certain length exist. Furthermore, the change of this characteristic subject to one-dimensional perturbations is investigated.

math.SP↗

A Calderón type inverse problem for tree graphs

We study the inverse problem of recovering a tree graph together with the weights on its edges (equivalently a metric tree) from the knowledge of the Dirichlet-to-Neumann matrix associated with the Laplacian. We prove an explicit formula which relates this matrix to the pairwise weighted distances of the leaves of the tree and, thus, allows to recover the weighted tree. This result can be viewed as a counterpart of the Calderón problem in the analysis of PDEs. In contrast to earlier results on inverse problems for metric graphs, we only assume knowledge of the Dirichlet-to-Neumann matrix for a fixed energy, not of a whole matrix-valued function.

math-ph↗

A linear relation approach to port-Hamiltonian differential-algebraic equations

We consider linear port-Hamiltonian differential-algebraic equations (pH-DAEs). Inspired by the geometric approach of Maschke and van der Schaft and the linear algebraic approach of Mehl, Mehrmann and Wojtylak, we present another view by using the theory of linear relations. We show that this allows to elaborate the differences and mutualities of the geometric and linear algebraic views, and we introduce a class of DAEs which comprises these two approaches. We further study the properties of matrix pencils arising from our approach via linear relations.

math.FA↗

Port-Hamiltonian formulation of nonlinear electrical circuits

We consider nonlinear electrical circuits for which we derive a port-Hamiltonian formulation. After recalling a framework for nonlinear port-Hamiltonian systems, we model each circuit component as an individual port-Hamiltonian system. The overall circuit model is then derived by considering a port-Hamiltonian interconnection of the components. We further compare this modelling approach with standard formulations of nonlinear electrical circuits

math.OC↗

Schur reduction of trees and extremal entries of the Fiedler vector

We study the eigenvectors of Laplacian matrices of trees. The Laplacian matrix is reduced to a tridiagonal matrix using the Schur complement. This preserves the eigenvectors and allows us to provide fomulas for the ratio of eigenvector entries. We also obtain bounds on the ratio of eigenvector entries along a path in terms of the eigenvalue and Perron values. The results are then applied to the Fiedler vector. Here we locate the extremal entries of the Fiedler vector and study classes of graphs such that the extremal entries can be found at the end points of the longest path.

math.CO↗

Locally finite extensions and Gesztesy-Šeba realizations for the Dirac operator on a metric graph

We study extensions of direct sums of symmetric operators $S=\oplus_{n\in\mathbb{N}} S_n$. In general there is no natural boundary triplet for $S^*$ even if there is one for every $S_n^*$, $n\in\mathbb{N}$. We consider a subclass of extensions of $S$ which can be described in terms of the boundary triplets of $S_n^*$ and investigate the self-adjointness, the semi-boundedness from below and the discreteness of the spectrum. Sufficient conditions for these properties are obtained from recent results on weighted discrete Laplacians. The results are applied to Dirac operators on metric graphs with point interactions at the vertices. In particular, we allow graphs with arbitrarily small edge length.

math.SP↗