paper-with-me

Papers

LMI relaxations and its application to data-driven control design for switched affine systems

2023-02-23 · Alexandre Seuret, Carolina Albea, Francisco Gordillo

The problem of data-driven control is addressed here in the context of switched affine systems. This class of nonlinear systems is of particular importance when controlling many types of applications in electronic, biology, medicine, etc. Still in the view of practical applications, providing an accurate model for this class of systems can be a hard task, and it might be more relevant to work on data issued from some trajectories obtained from experiments and to deploy a new branch of tools to stabilize the systems that are compatible with the processed data. Following the recent concept of data-driven control design, this paper first presents a generic equivalence lemma that shows a matrix constraint based on data, instead of the system parameter. Then, following the concept of robust hybrid limit cycles for uncertain switched affine systems, robust model-based and then data-driven control laws are designed based on a Lyapunov approach. The proposed results are then illustrated and evaluated on an academic example.

📄 PDF Abstract BibTeX arXiv:2302.11923

Code (0)

등록된 구현이 없습니다.

Tasks

LEMMA

Similar Papers 제목 키워드 기반

From Shadow to Light: Toward Safe and Efficient Policy Learning Across MPC, DeePC, RL, and LLM Agents

2025-10-05 · Amin Vahidi-Moghaddam, Sayed Pedram Haeri Boroujeni, Iman Jebellat, Ehsan Jebellat 외 arxiv

One of the main challenges in modern control applications, particularly in robot and vehicle motion control, is achieving accurate, fast, and safe movement. To address this, optimal control policies have been developed t…

Reinforcement Learning

Learning with Algorithmic Supervision via Continuous Relaxations

2021-10-11 · NeurIPS 2021 12 · Felix Petersen, Christian Borgelt, Hilde Kuehne, Oliver Deussen

The integration of algorithmic components into neural architectures has gained increased attention recently, as it allows training neural networks with new forms of supervision such as ordering constraints or silhouettes…

Convex Relaxations of Bregman Divergence Clustering

2013-09-26 · Hao Cheng, Xinhua Zhang, Dale Schuurmans

Although many convex relaxations of clustering have been proposed in the past decade, current formulations remain restricted to spherical Gaussian or discriminative models and are susceptible to imbalanced clusters. To a…

Clustering

Dataset of Random Relaxations for Crystal Structure Search of Li-Si System

2020-12-05 · Gowoon Cheon, Lusann Yang, Kevin McCloskey, Evan J. Reed 외

Crystal structure search is a long-standing challenge in materials design. We present a dataset of more than 100,000 structural relaxations of potential battery anode materials from randomized structures using density fu…

Data AugmentationDomain Generalization

Clusters and Coarse Partitions in LP Relaxations

2008-12-01 · NeurIPS 2008 12 · David Sontag, Amir Globerson, Tommi S. Jaakkola

We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-based LP relaxations enforce joint consistenc…

Protein Design