Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
175 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Automated Generation of Explicit Port-Hamiltonian Models from Multi-Bond Graphs (1909.02848v1)

Published 6 Sep 2019 in eess.SY and cs.SY

Abstract: 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 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.

Citations (2)

Summary

We haven't generated a summary for this paper yet.