Formal stabilization of a coupled ODE-PDE switched system

Partial Differential Equations (PDEs) are a ubiquitous model that describes a wide range of dynamical systems. While stabilization of systems involving PDEs is an important problem, little work has been done on formal verification and synthesis for such systems. In this paper, we explain how a coupled ODE-PDE control problem can be formally stabilized using a tiling based control synthesis algorithm associated to set based reachability, which is usually used on finite dimensional problems. To formally prove the stabilization of the PDE, the original infinite dimensional problem is transformed into a finite dimensional one using, among other tools, model order reduction. The strength of our approach relies on the fact that we never explicitly discretize the PDE state using e.g. a finite element approximation, and consequently, we provide stability guarantees directly on the infinite dimensional state.

Authors

Institutions

Publication Details

Published
2024-12-16
DOI
https://doi.org/10.1109/cdc56724.2024.10886143
Primary Topic
Extremum Seeking Control Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Formal stabilization of a coupled ODE-PDE switched system

Jonathan Vacher, Adrien Le Coënt, Kenan Kergrene
Extremum Seeking Control Systems
article

Formal stabilization of a coupled ODE-PDE switched system

Jonathan Vacher, Adrien Le Coënt, Kenan Kergrene
article en

Abstract

Partial Differential Equations (PDEs) are a ubiquitous model that describes a wide range of dynamical systems. While stabilization of systems involving PDEs is an important problem, little work has been done on formal verification and synthesis for such systems. In this paper, we explain how a coupled ODE-PDE control problem can be formally stabilized using a tiling based control synthesis algorithm associated to set based reachability, which is usually used on finite dimensional problems. To formally prove the stabilization of the PDE, the original infinite dimensional problem is transformed into a finite dimensional one using, among other tools, model order reduction. The strength of our approach relies on the fact that we never explicitly discretize the PDE state using e.g. a finite element approximation, and consequently, we provide stability guarantees directly on the infinite dimensional state.

Université de Technologie de Compiègne (FR), Centre National de la Recherche Scientifique (FR), Université Paris-Est Créteil (FR), Université Paris Cité (FR), Paris-Est Sup (FR), Sorbonne Paris Cité (FR), Département mathématiques, informatique, sciences de la donnée et technologies du numérique (FR), Laboratoire Roberval (FR), Mathématiques Appliquées à Paris 5 (FR)
Affordable and clean energy
Openalex Percentile: Top 81%
Extremum Seeking Control Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.