paper-with-me

홈 › Papers

Counter-example guided inductive synthesis of control Lyapunov functions for uncertain systems

2023-03-17 · Daniele Masti, Filippo Fabiani, Giorgio Gnecco, Alberto Bemporad

We propose a counter-example guided inductive synthesis (CEGIS) scheme for the design of control Lyapunov functions and associated state-feedback controllers for linear systems affected by parametric uncertainty with arbitrary shape. In the CEGIS framework, a learner iteratively proposes a candidate control Lyapunov function and a tailored controller by solving a linear matrix inequality (LMI) feasibility problem, while a verifier either falsifies the current candidate by producing a counter-example to be considered at the next iteration, or it certifies that the tentative control Lyapunov function actually enjoys such feature. We investigate the Lipschitz continuity of the objective function of the global optimization problem solved by the verifier, which is key to establish the convergence of our method in a finite number of iterations. Numerical simulations confirm the effectiveness of the proposed approach.

📄 PDF Abstract BibTeX arXiv:2303.10024

Code (0)

등록된 구현이 없습니다.

Tasks

global-optimization

Similar Papers 제목 키워드 기반

Are There Good Mistakes? A Theoretical Analysis of CEGIS

2014-07-21 · Susmit Jha, Sanjit A. Seshia

Counterexample-guided inductive synthesis CEGIS is used to synthesize programs from a candidate space of programs. The technique is guaranteed to terminate and synthesize the correct program if the space of candidate pro…

Counterexample-Driven Synthesis for Probabilistic Program Sketches

2019-04-28 · Milan Češka, Christian Hensel, Sebastian Junges, Joost-Pieter Katoen

Probabilistic programs are key to deal with uncertainty in e.g. controller synthesis. They are typically small but intricate. Their development is complex and error prone requiring quantitative reasoning over a myriad of…

A Theory of Formal Synthesis via Inductive Learning

2015-05-15 · Susmit Jha, Sanjit A. Seshia

Formal synthesis is the process of generating a program satisfying a high-level formal specification. In recent times, effective formal synthesis methods have been proposed based on the use of inductive learning. We refe…

BIG-bench Machine LearningInductive LearningLearning Theory

Formal synthesis of closed-form sampled-data controllers for nonlinear continuous-time systems under STL specifications

2020-06-07 · Cees F. Verdier, Niklas Kochdumper, Matthias Althoff, Manuel Mazo Jr

We propose a counterexample-guided inductive synthesis framework for the formal synthesis of closed-form sampled-data controllers for nonlinear systems to meet STL specifications over finite-time trajectories. Rather tha…

Form

QBF Solving by Counterexample-guided Expansion

2016-11-04 · Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic

We introduce a novel generalization of Counterexample-Guided Inductive Synthesis (CEGIS) and instantiate it to yield a novel, competitive algorithm for solving Quantified Boolean Formulas (QBF). Current QBF solvers based…