44
From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view on Hamiltonian systems Arjan van der Schaft University of Groningen, the Netherlands 1. Review on classical Hamiltonian systems 2. Power-conserving interconnections and Dirac structures 3. Port-Hamiltonian systems 4. Composition of Dirac structures 5. Control in the port-Hamiltonian framework 6. Distributed-parameter components 7. Conclusions and outlook Joint work with B. Maschke, R. Ortega, G. Golo, ...

From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

  • Upload
    others

  • View
    8

  • Download
    0

Embed Size (px)

Citation preview

Page 1: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1

From networks models to geometry:a new view on Hamiltonian systems

Arjan van der Schaft

University of Groningen, the Netherlands

1. Review on classical Hamiltonian systems

2. Power-conserving interconnections and Dirac structures

3. Port-Hamiltonian systems

4. Composition of Dirac structures

5. Control in the port-Hamiltonian framework

6. Distributed-parameter components

7. Conclusions and outlook

Joint work with B. Maschke, R. Ortega, G. Golo, ...

Page 2: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 2

Common view on Hamiltonian systems

Classical Hamiltonian equations of motion

qi = ∂H∂pi

(q, p)

i = 1, · · · , n

pi = − ∂H∂qi

(q, p)

where

• q = (q1, · · · , qn) are the configuration coordinates,

• p = (p1, · · · , pn) are the generalized momenta,

• H(q, p) is the total energy of the system.

Page 3: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 3

Geometrically (coordinate-free) this is usually described by the

triple

(T ∗Q, ω, H)

where

• Q is the configuration manifold

(with local coordinates q = (q1, · · · , qn))

• ω is canonical symplectic form on the cotangent bundle T ∗Q

(in local coordinates given by ω =∑n

i=1 dpi ∧ dqi)

• H : T ∗Q → R.

The Hamiltonian dynamics is defined by the vector field XH

satisfying

ω(XH ,−) = −dH

Further generalizations: 1) Replace T ∗Q by a general symplectic

manifold (M, ω), 2) Infinite-dimensional case.

Page 4: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 4

Equivalently, let {, } denote the canonical Poisson bracket on T ∗Q,

in canonical coordinates for T ∗Q given by

{F, G} =

n∑

i=1

(∂F

∂qi

∂G

∂pi

−∂F

∂pi

∂G

∂qi

),

then XH is determined by the requirement

XH(F ) = {F, H}

for all F : T ∗Q → R.

In an arbitrary set of local coordinates x the dynamics takes the

form

x = J(x)∂H

∂x(x)

where J = −JT is the structure matrix of the Poisson bracket with

elements

Jij = {xi, xj}, i, j = 1, · · · , n

Note that in the finite-dimensional case J has full rank.

Page 5: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 5

On the other hand, it is well-known that many dynamical equations

of physical interest are not precisely of this form, although they

should be regarded as Hamiltonian in a generalized sense.

Typical example are the Euler equations for the rigid body

px

py

pz

=

0 −pz py

pz 0 −px

−py px 0

∂H∂px

∂H∂py

∂H∂pz

with p = (px, py, pz) the body angular momentum vector along the

three principal axes, and H(p) = 12

(p2

x

Ix+

p2

y

Iy+

p2

z

Iz

)

the kinetic energy

(Ix, Iy, Iz principal moments of inertia.)

In general, many systems are of the Hamiltonian form

x = J(x)∂H

∂x(x)

with J = −JT , but not of full rank.

Page 6: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 6

Hamiltonian systems obtained by symmetry

reduction

The Euler equations can be regarded as the reduction of classical

Hamiltonian equations on a cotangent bundle.

Reduced space is the orbit space of the action of a Lie group that

leaves the Hamiltonian invariant.

In fact, Q = SO(3) and the cotangent bundle T ∗SO(3) can be

reduced by the action of SO(3) on T ∗SO(3) into so(3)∗,

while the Hamiltonian is invariant under this action.

This holds in many situations, both in the finite- and

infinite-dimensional case

(“Marsden-Weinstein reduction by symmetry program”).

Page 7: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 7

A different point of view:

Network modeling of physical systems

Prevailing trend in modeling and simulation of lumped-parameter

systems (multi-body systems, electrical circuits, electro-mechanical

systems, robotic systems, cell-biological systems, etc.).

Advantages of network modeling:

• Systematic modeling procedure, which offers structural insight.

• Flexibility. Re-usability of components. Suited to

design/control.

• Multi-physics approach.

• “Modularity can beat complexity.”

Originates from engineering, and calls for mathematical theory

of networks and systems.

Page 8: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 8

Possible disadvantage of network modeling: it generally leads to a

large set of differential and algebraic equations (DAEs), seemingly

without any structure.

This is a serious obstacle for analysis and control; especially for

nonlinear models.

Aim: to identify the underlying Hamiltonian structure of network

models of physical systems, and to use it for analysis, simulation

and control.

Page 9: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 9

Port-based network modeling

Interaction between ideal system components is modeled by

power-ports modeling the energy exchange between the

components.

Associated to every power-port there are conjugate pairs of

variables (called flows f and efforts e), whose product eT f equals

power.

E.g., voltages and currents, generalized forces and velocities,

pressure and volume change, etc.

This leads to a (generalized) Hamiltonian description of

multi-physics systems.

Page 10: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 10

Example Two inductors with magnetic energies H1(ϕ1), H2(ϕ2)

(ϕ1 and ϕ2 magnetic flux linkages), and capacitor with electric

energy H3(Q) (Q charge).

ϕ1 ϕ2

L1 L2

C

Q

Question: How to write this LC-circuit as a Hamiltonian system in

a modular way?

Page 11: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 11

Storage equations for the components of the LC-circuit:

Inductor 1 ϕ1 = f1 (voltage)

(current) e1 = ∂H1

∂ϕ1

Inductor 2 ϕ2 = f2 (voltage)

(current) e2 = ∂H2

∂ϕ2

Capacitor Q = f3 (current)

(voltage) e3 = ∂H3

∂Q

If the energy functions Hi are quadratic, e.g., H3(Q) = 12C

Q2, then

the elements are linear, e.g., voltage over capacitor = ∂H3

∂Q= Q

C,

and similarly for the inductors.

Page 12: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 12

Kirchhoff’s voltage and current laws are

−f1

−f2

−f3

=

0 0 1

0 0 −1

−1 1 0

e1

e2

e3

Substitution of eqns. of components yields Hamiltonian system

ϕ1

ϕ2

Q

=

0 0 −1

0 0 1

1 −1 0

∂H∂ϕ1

∂H∂ϕ2

∂H∂Q

with H(ϕ1, ϕ2, Q) := H1(ϕ1) + H2(ϕ2) + H3(Q) total energy.

Page 13: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 13

Preliminary conclusions

• The structure matrix J is completely determined by the

interconnection structure of the system (in this case,

Kirchhoff’s current and voltage laws).

• Skew-symmetry of J corresponds to the interconnection being

power-conserving. (Tellegen’s theorem for Kirchhoff’s laws.)

• There is no clear underlying co-tangent bundle or symplectic

manifold !

• Building blocks of our theory should be open dynamical

systems, instead of closed dynamical systems

(the systems point of view).

• Complex Hamiltonian systems are obtained by interconnecting

open Hamiltonian systems.

Page 14: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 14

The Hamiltonian equations for a closed dynamical system

x = J(x)∂H

∂x(x), J(x) = −JT (x), x ∈ X

is extended to open dynamical systems:

x = J(x)∂H∂x

(x) + g(x)f, f ∈ Rm

x ∈ X state space

e = gT (x)∂H∂x

(x), e ∈ Rm

where the external ports defined by the matrix g(x), and

f ∈ Rm, e ∈ R

m are the power-variables at the external ports (open

to interconnection to other systems).

By skew-symmetry of J we obtain for any g the energy-balance

dH

dt(x(t)) = eT (t)f(t) = power supplied to the system

Page 15: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 15

Interconnection of two open Hamiltonian systems

xi = Ji(xi)∂Hi

∂xi(xi) + gi(xi)fi

ei = gTi (x)∂Hi

∂xi(xi)

xi ∈ Xi, i = 1, 2

via the feedback interconnection

(power-conserving since f1e1 + f2e2 = 0 !)

f1 = −e2, f2 = e1

yields the Hamiltonian system

x1

x2

=

J1(x1) −g1(x1)g

T2 (x2)

g2(x2)gT1 (x1) J2(x2)

︸ ︷︷ ︸

Jint(x1,x2)

∂H1

∂x1

(x1)

∂H2

∂x2

(x2)

with state space X1 ×X2, and total Hamiltonian H1(x1) + H2(x2).

Page 16: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 16

However, this class of Hamiltonian open systems is

not closed under arbitrary interconnection:

��

��

��

��

Figure 1: Capacitors and inductors swapped.

Composition leads to algebraic constraints between the state

variables; in this case Q1 and Q2.

Page 17: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 17

What is the appropriate generalization of the Poisson structure J ?

Answer: Dirac structures

(’From skew-symmetric mappings to skew-symmetric relations’)

Power is defined by

P = e(f) =: < e | f >, (f, e) ∈ V × V∗.

where the linear space V is called the space of flows f (e.g.

currents), and V∗ the space of efforts e (e.g. voltages).

Symmetrized form of power is the indefinite bilinear form �,� on

V × V∗:

�(fa, ea), (f b, eb) � := < ea | f b > + < eb | fa >,

(fa, ea), (f b, eb) ∈ V × V∗.

Page 18: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 18

Definition 1 (Weinstein, Courant, Dorfman) A (constant)

Dirac structure is a subspace

D ⊂ V × V∗

such that

D = D⊥,

where ⊥ denotes orthogonal complement with respect to the

bilinear form �,�.

For a finite-dimensional linear space V this is equivalent to

(i) < e | f >= 0 for all (f, e) ∈ D,

(ii) dimD = dimV.

Page 19: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 19

Examples

Mathematical

(a) Let J : V∗ → V be a skew-symmetric mapping. Then its graph

{(f, e) ∈ V × V∗ | f = Je} is a Dirac structure.

(b) Let ω : V → V∗ be a skew-symmetric mapping.

Then graph ω ⊂ V × V∗ is a Dirac structure.

(c) Let W ⊂ V be a subspace, and let annW be its annihilating

subspace of V∗. Then W × annW ⊂ V × V∗ is a Dirac structure.

Physical

(a) Kirchhoff’s laws

(b) Transformers and gyrators

(c) Kinematic pairs

(d) Ideal (workless) constraints

Page 20: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 20

For many systems, especially those with 3-D mechanical

components, the interconnection structure will be modulated by

the energy or geometric variables.

This leads to the notion of non-constant Dirac structures on

manifolds.

Definition 2 Consider a smooth manifold M . A Dirac structure on

M is a vector subbundle D ⊂ TM ⊕ T ∗M such that for every x ∈ M

the vector space

D(x) ⊂ TxM × T ∗xM

is a Dirac structure as before.

Page 21: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 21

Geometric definition of a port-Hamiltonian system

x

∂H∂x

(x)

fx

ex

f

eD(x)H

Figure 2: Port-Hamiltonian system

The dynamical system defined by the relations

(−x(t),∂H

∂x(x(t)), f(t), e(t)) ∈ D(x(t)), t ∈ R

is called a port-Hamiltonian system.

So we have generalized from (M, ω, H) to (X ,D,F ,H).

Page 22: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 22

Particular case is a Dirac structure D(x) ⊂ TxX × T ∗xX × F × F∗

given as the graph of the skew-symmetric map

fx

e

=

−J(x) −g(x)

gT (x) 0

ex

f

,

leading (fx = −x, ex = ∂H∂x

(x)) to a Hamiltonian open system as

before

x = J(x)∂H∂x

(x) + g(x)f, x ∈ X , f ∈ Rm

e = gT (x)∂H∂x

(x), e ∈ Rm

In general, the equations of a port-Hamiltonian system are DAEs.

Page 23: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 23

Energy-dissipation is included by terminating some of the ports

by resistive elements

fR = −F (eR),

where the mapping F is such that

eTRF (eR) ≥ 0, for all eR

Then the energy balance ddt

H = eT f is replaced by

d

dtH ≤ eT f

Hence, the system is passive if H ≥ 0.

Theory of port-Hamiltonian systems extends theory of passive

systems in control theory.

Page 24: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 24

Electro-mechanical system (magnetically levitated ball)

q

p

ϕ

=

0 1 0

−1 0 0

0 0 − 1R

∂H∂q

∂H∂p

∂H∂ϕ

+

0

0

1

V, I =[

0 0 1]

∂H∂q

∂H∂p

∂H∂ϕ

Coupling of electrical and mechanical domain via the Hamiltonian.

Page 25: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 25

Example: Mechanical systems with kinematic constraints

Constraints on the generalized velocities q:

AT (q)q = 0.

This leads to constrained Hamiltonian equations

q = ∂H∂p

(q, p)

p = −∂H∂q

(q, p) + A(q)λ + B(q)f

0 = AT (q)∂H∂p

(q, p)

e = BT (q)∂H∂p

(q, p)

with H(q, p) total energy, and λ the constraint forces.

Dirac structure is defined by the Poisson structure on T ∗Q

together with constraints AT (q)q = 0 and external force matrix B(q).

Can be extended to general multi-body systems.

Page 26: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 26

Jacobi identity and holonomic constraints

There is an important notion of integrability of a Dirac structure

on a manifold.

Definition 3 (Dorfman, Courant) A Dirac structure D on a

manifold M is called integrable if

< LX1α2 | X3 > + < LX2

α3 | X1 > + < LX3α1 | X2 >= 0

for all (X1, α1), (X2, α2), (X3, α3) ∈ D.

For constant Dirac structures the integrability condition is

automatically satisfied.

The Dirac structure D defined by the canonical symplectic

structure and kinematic constraints AT (q)q = 0 satisfies the

integrability condition if and only if the constraints are holonomic;

that is, can be integrated to geometric constraints φ(q) = 0.

Page 27: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 27

Special cases; see Dalsmo & vdS for more info.

(a) Let J be a (pseudo-)Poisson structure on M , defining a

skew-symmetric mapping J : T ∗M → TM . Then

graph J ⊂ T ∗M ⊕ TM is a Dirac structure.

Integrability is equivalent to the Jacobi-identity for the Poisson

structure.

(b) Let ω be a (pre-)symplectic structure on M , defining a

skew-symmetric mapping ω : TM → T ∗M . Then

graph ω ⊂ TM ⊕ T ∗M is a Dirac structure.

Integrability is equivalent to the closedness of the symplectic

structure.

(c) Let K be a constant-dimensional distribution on M , and let

annK be its annihilating co-distribution. Then

K × annK ⊂ TM ⊕ T ∗M is a Dirac structure.

Integrability is equivalent to the involutivity of distribution K.

Page 28: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 28

Integrability of the Dirac structure is equivalent to the existence of

canonical coordinates:

If the Dirac structure D on X is integrable then there exist

coordinates (q, p, r, s) for X such that

D(x) = {(fq, fp, fr, fs, eq, ep, er, es) ∈ TxX × T ∗xX}

fq = −ep, fp = eq

fr = 0, 0 = es

Hence the Hamiltonian system corresponding to D and H : X → R is

q = ∂H∂p

(q, p, r, s)

p = −∂H∂q

(q, p, r, s)

r = 0

0 = ∂H∂s

(q, p, r, s)

Page 29: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 29

Port-Hamiltonian systems are more than

energy-conserving or passive.

For any Dirac structure D define

G1 := {fx | ∃ex, f, e s.t. (fx, ex, f, e) ∈ D} ⊂ TxX

P1 := {ex | ∃fx, f, e s.t. (fx, exf, e) ∈ D} ⊂ T ∗xX

The space G1 expresses the set of admissible flows, and therefore

the Casimir functions:

• C is a Casimir function iff ∂C∂x

(fx) = 0 for all fx ∈ G1. Indeed, thendCdt

= ∂C∂x

(x(t))x(t) = 0 for all solutions.

P1 determines the set of admissible efforts, and therefore the

algebraic constraints:

• x should satisfy the equations dH(x) ∈ P1(x).

Page 30: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 30

Composition of Dirac structures The composition of two

finite-dimensional Dirac structures with partially shared variables is

again a Dirac structure:

DA ⊂ V1 × V∗1 × V2 × V∗

2

DB ⊂ V2 × V∗2 × V3 × V∗

3

V1

V∗1

V2

V∗2

V3

V∗3

DA DB

︸ ︷︷ ︸DA||DB

Figure 3: Composed Dirac structure

Page 31: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 31

This implies that the interconnection of port-Hamiltonian systems

is again a port-Hamiltonian system.

Starting point for control:

Connect the given plant port-Hamiltonian system to a

to-be-designed controller port-Hamiltonian system

P Cf

e

Figure 4: Control by Interconnection

Interconnected system is again a port-Hamiltonian system with

total energy Htot = HP + HC , and composed Dirac structure Dcomp

derived from DP and DC.

Page 32: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 32

Control problem 1: Stabilization

By deliberate choice of DC we may generate new conserved

quantities K Casimir functions for the interconnected system, and

use the candidate Lyapunov function (even for unstable plant

systems!)

V := HP + HC + K

Addition of energy-dissipating elements may result in asymptotic

stabilization.

By additional feedback loops we may introduce virtual subsystems:

“IDA-PBC control theory” or theory of ’Controlled Lagrangians”.

Page 33: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 33

Control problem 2: Energy transfer control

Consider two port-Hamiltonian systems Σi in input-state-output

form

xi = Ji(xi)∂Hi

∂xi+ gi(xi)ui

yi = gTi (xi)

∂Hi

∂xi, i = 1, 2

Suppose we want to transfer the energy from the

port-Hamiltonian system Σ1 to the port-Hamiltonian system Σ2,

while keeping the total energy H1 + H2 constant.

Page 34: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 34

This can be done e.g. by the feedback

u1

u2

=

0 −y1y

T2

y2yT1 0

y1

y2

By skew-symmetry it follows the interconnected system is

Hamiltonian, that is ddt

(H1 + H2) = 0.

However, for the individual energies

d

dtH1 = −yT

1 y1yT2 y2 = −||y1||

2||y2||2 ≤ 0

implying that H1 is decreasing. On the other hand,

d

dtH2 = yT

2 y2yT1 y1 = ||y2||

2||y1||2 ≥ 0

implying that H2 is increasing at the same rate.

Page 35: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 35

Control problem 3: Impedance control

Given the plant port-Hamiltonian system, design a controller

port-Hamiltonian system such that the behavior at the interaction

port of the plant port-Hamiltonian system is a desired one.

Applications e.g. in robotics (’interaction with the environment’).

This problem raises the fundamental question:

Given the plant port-Hamiltonian system, and the controller

port-Hamiltonian system to be arbitrarily designed, what are the

achievable behaviors of the interconnected plant-controller system

at an interaction port of the plant?

Page 36: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 36

Sub-question: What are the achievable Dirac structures ?

V1

V∗1

V2

V∗2

V3

V∗3

DP DC

︸ ︷︷ ︸DP ||DC

Figure 5: Achievable Dirac structures

D0P := {(f1, e1) | (f1, e1, 0, 0) ∈ DP }

DπP := {(f1, e1) | ∃(f2, e2) : (f1, e1, f2, e2) ∈ DP }

D0 := {(f1, e1) | (f1, e1, 0, 0) ∈ D}

Dπ := {(f1, e1) | ∃(f3, e3) : (f1, e1, f3, e3) ∈ D}

Page 37: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 37

Theorem 4 Given a plant Dirac structure DP , and desired Dirac

structure D. Then there exists a controller Dirac structure DC such

that D = DP ‖ DC if and only if one of the following equivalent

conditions is satisfied

D0P ⊂ D0

Dπ ⊂ DπP

Sufficiency is shown using the controller Dirac structure

DC := D∗P ‖ D

resulting in closed-loop Dirac structure DP ‖ D∗P ‖ D = D.

Network/systems interpretation ??

Page 38: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 38

How to incorporate distributed-parameter components ?

VaIa

VbIb

a b

Figure 6: Transmission line

Telegrapher’s equations define the boundary control system

∂Q∂t

(z, t) = − ∂∂z

I(z, t) = − ∂∂z

φ(z,t)L(z)

∂φ∂t

(z, t) = − ∂∂z

V (z, t) = − ∂∂z

Q(z,t)C(z)

Va(t) = V (a, t), Ia(t) = I(a, t)

Vb(t) = V (b, t), Ib(t) = I(b, t)

Page 39: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 39

Defines an infinite-dimensional port-Hamiltonian system

Define internal flows (fE , fM ) and efforts (eE , eM ):

electric flow fE : [a, b] → R

magnetic flow fM : [a, b] → R

electric effort eE : [a, b] → R

magnetic effort eM : [a, b] → R

together with external boundary flows f = (fa, fb) and boundary

efforts e = (ea, eb). Define the infinite-dimensional Dirac structure

fE

fM

=

0 ∂

∂z

∂∂z

0

eE

eM

fa,b

ea,b

=

eE|a,b

eM |a,b

Page 40: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 40

This defines an infinite-dimensional Dirac structure on the space of

internal flows and efforts and boundary flows and efforts (use

integration by parts !).

Substituting (as in the lumped-parameter case)

fE = −∂Q∂t

fM = −∂ϕ∂t

fx = −x

eE = QC

= ∂H∂Q

eM = ϕL

= ∂H∂ϕ

ex =

∂H

∂x

with quadratic energy density

H(Q, ϕ) =1

2

Q2

C+

1

2

ϕ2

L

we recover the telegrapher’s equations.

Page 41: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 41

This extends e.g. to Maxwell’s equations on a domain with

boundary,

to flexible beam models,

and to boundary-controlled fluid dynamics.

In all these cases the infinite-dimensional Dirac structure is

determined by a set of conservation laws.

(Like Kirchhoff’s laws in the finite-dimensional circuit case !)

Typical case∂α1

∂t+ ∂β2

∂z= 0

∂α2

∂t+ ∂β1

∂z= 0

with βi = ∂H∂αi

, i = 1, 2. This defines a port-Hamiltonian system with

energy density H and power-variables at the boundary determined

by βi.

Page 42: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 42

Interconnection of finite- and infinite-dimensional port-Hamiltonian

system again defines a port-Hamiltonian system.

• Opportunities for analysis, simulation, and control of mixed

ODEs and PDEs.

• Spatial discretization of infinite-dimensional components to

finite-dimensional port-Hamiltonian systems using mixed

finite-element methods.

• What can we say about well-posedness ? Relations with

passivity theory (Staffans et al.). Shock waves in nonlinear

case.

• Composition of Dirac structures on Hilbert spaces, and

relations with scattering representations (Kurula et al.).

Page 43: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 43

Conclusions

• Port-Hamiltonian systems provide a unified framework for

modeling, analysis, and simulation of complex multi-physics

systems.

• Inclusion of distributed-parameter components.

• Starting point for control: ’control by interconnection’,

IDA-PBC control. Suggests new control paradigms.

• Port-Hamiltonian systems with variable network topology

(power systems, robotic systems, ’embedded systems’).

Page 44: From networks models to geometry: a new view on ...From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 1 From networks models to geometry: a new view

From networks models to geometry: a new view on Hamiltonian systems, ICM Madrid 2006 44

◦ Extensions to thermodynamic systems and chemical reaction

networks.

◦ Model reduction of port-Hamiltonian systems.

◦ Merging network (graph) information with dynamics. Dirac

structure as a mixture of algebraic-graph and geometric object.

◦ Reconciliation with co-tangent bundle point of view and

variational calculus.

See proceedings for further info and references.

Also see website www.geoplex.cc of European IST project

Geoplex for applications in various domains.