Port-Transversal Barriers: Graph-Theoretic Safety for Port-Hamiltonian Systems

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Leung, Chi Ho, Paré, Philip E.
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866911548392341504
author Leung, Chi Ho
Paré, Philip E.
author_facet Leung, Chi Ho
Paré, Philip E.
contents We study port-Hamiltonian systems with energy functions that split into local storage terms. From the interconnection and dissipation structure, we construct a graph on the energy compartments. From this graph, we show that the shortest-path distance from a constrained compartment to the nearest actuated one gives a lower bound on the relative degree of the corresponding safety constraint. We also show that no smooth static feedback can reduce it when no path exists. When the relative degree exceeds one and the immediate graph neighbors of the constrained compartment is connected to at least one input port, we reshape the constraint by subtracting their shifted local storages, producing a candidate barrier function of relative degree one. We then identify sufficient regularity conditions that recover CBF feasibility under bounded inputs. We validate the framework on an LC ladder network, where the enforceability of a capacitor charge constraint depends only on the input topology.
format Preprint
id arxiv_https___arxiv_org_abs_2603_26578
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Port-Transversal Barriers: Graph-Theoretic Safety for Port-Hamiltonian Systems
Leung, Chi Ho
Paré, Philip E.
Systems and Control
We study port-Hamiltonian systems with energy functions that split into local storage terms. From the interconnection and dissipation structure, we construct a graph on the energy compartments. From this graph, we show that the shortest-path distance from a constrained compartment to the nearest actuated one gives a lower bound on the relative degree of the corresponding safety constraint. We also show that no smooth static feedback can reduce it when no path exists. When the relative degree exceeds one and the immediate graph neighbors of the constrained compartment is connected to at least one input port, we reshape the constraint by subtracting their shifted local storages, producing a candidate barrier function of relative degree one. We then identify sufficient regularity conditions that recover CBF feasibility under bounded inputs. We validate the framework on an LC ladder network, where the enforceability of a capacitor charge constraint depends only on the input topology.
title Port-Transversal Barriers: Graph-Theoretic Safety for Port-Hamiltonian Systems
topic Systems and Control
url https://arxiv.org/abs/2603.26578