Port-Hamiltonian systems on graphs

In this paper we present a unifying geometric and compositional framework for modeling complex physical network dynamics as port-Hamiltonian systems on open graphs. Basic idea is to associate with the incidence matrix of the graph a Dirac structure relating the flow and effort variables associated to the edges, internal vertices, as well as boundary vertices of the graph, and to formulate energy-storing or energy-dissipating relations between the flow and effort variables of the edges and internal vertices. This allows for state variables associated to the edges, and formalizes the interconnection of networks. Examples from different origins such as consensus algorithms are shown to share the same structure. It is shown how the identified Hamiltonian structure offers systematic tools for the analysis of the resulting dynamics.Comment: 45 pages, 2 figure

Automated Generation of Explicit Port-Hamiltonian Models from Multi-Bond Graphs

Port-Hamiltonian system theory is a well-known framework for the control of complex physical systems. The majority of port-Hamiltonian control design methods base on an \emph{explicit} input-state-output port-Hamiltonian model for the system under consideration. However in the literature, little effort has been made towards a systematic, automatable derivation of such explicit models. In this paper, we present a constructive, formally rigorous method for an explicit port-Hamiltonian formulation of multi-bond graphs. Two conditions, one necessary and one sufficient, for the existence of an explicit port-Hamiltonian formulation of a multi-bond graph are given. We summarise our approach in a fully automated algorithm of which we provide an exemplary implementation along with this publication. The theoretical and practical results are illustrated through an academic example

Output Consensus Control for Linear Port-Hamiltonian Systems

In this paper, we study output consensus of coupled linear port-Hamiltonian systems on graphs in the presence of constant disturbances, where couplings are allowed to be both static and dynamic. Utilizing port-Hamiltonian structures, we present dynamic controllers achieving output consensus where the consensus values are determined by the disturbances. Finally, the utility of the proposed controller is illustrated by applying it to current sharing of DC microgrids

Bond graphs in model matching control

Bond graphs are primarily used in the network modeling of lumped parameter physical systems, but controller design with this graphical technique is relatively unexplored. It is shown that bond graphs can be used as a tool for certain model matching control designs. Some basic facts on the nonlinear model matching problem are recalled. The model matching problem is then associated with a particular disturbance decoupling problem, and it is demonstrated that bicausal assignment methods for bond graphs can be applied to solve the disturbance decoupling problem as to meet the model matching objective. The adopted bond graph approach is presented through a detailed example, which shows that the obtained controller induces port-Hamiltonian error dynamics. As a result, the closed loop system has an associated standard bond graph representation, thereby rendering energy shaping and damping injection possible from within a graphical context

An intrinsic Hamiltonian formulation of the dynamics of LC-circuits

First, the dynamics of LC-circuits are formulated as a Hamiltonian system defined with respect to a Poisson bracket which may be degenerate, i.e., nonsymplectic. This Poisson bracket is deduced from the network graph of the circuit and captures the dynamic invariants due to Kirchhoff's laws. Second, the antisymmetric relations defining the Poisson bracket are realized as a physical network using the gyrator element and partially dualizing the network graph constraints. From the network realization of the Poisson bracket, the reduced standard Hamiltonian system as well as the realization of the embedding standard Hamiltonian system are deduce

Conservation laws and open systems on higher-dimensional networks

We discuss a framework for defining physical open systems on higher-dimensional complexes. We start with the formalization of the dynamics of open electrical circuits and the Kirchhoff behavior of the underlying open graph or 1-complex. It is discussed how the graph can be closed to an ordinary graph, and how this defines a Dirac structure on the extended graph. Then it is shown how this formalism can be extended to arbitrary k-complexes, which is illustrated by a discrete formulation of heat transfer on a two-dimensional spatial domain.

Quantum simulation of topologically protected states using directionally unbiased linear-optical multiports

It is shown that quantum walks on one-dimensional arrays of special linear-optical units allow the simulation of discrete-time Hamiltonian systems with distinct topological phases. In particular, a slightly modified version of the Su-Schrieffer-Heeger (SSH) system can be simulated, which exhibits states of nonzero winding number and has topologically protected boundary states. In the large-system limit this approach uses quadratically fewer resources to carry out quantum simulations than previous linear-optical approaches and can be readily generalized to higher-dimensional systems. The basic optical units that implement this simulation consist of combinations of optical multiports that allow photons to reverse direction