Verification and Synthesis of Robust Control Barrier Functions: Multilevel Polynomial Optimization and Semidefinite Relaxation

03/17/2023
by   Shucheng Kang, et al.
0

We study the problem of verification and synthesis of robust control barrier functions (CBF) for control-affine polynomial systems with bounded additive uncertainty and convex polynomial constraints on the control. We first formulate robust CBF verification and synthesis as multilevel polynomial optimization problems (POP), where verification optimizes – in three levels – the uncertainty, control, and state, while synthesis additionally optimizes the parameter of a chosen parametric CBF candidate. We then show that, by invoking the KKT conditions of the inner optimizations over uncertainty and control, the verification problem can be simplified as a single-level POP and the synthesis problem reduces to a min-max POP. This reduction leads to multilevel semidefinite relaxations. For the verification problem, we apply Lasserre's hierarchy of moment relaxations. For the synthesis problem, we draw connections to existing relaxation techniques for robust min-max POP, which first use sum-of-squares programming to find increasingly tight polynomial lower bounds to the unknown value function of the verification POP, and then call Lasserre's hierarchy again to maximize the lower bounds. Both semidefinite relaxations guarantee asymptotic global convergence to optimality. We provide an in-depth study of our framework on the controlled Van der Pol Oscillator, both with and without additive uncertainty.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/02/2022

Convex synthesis and verification of control-Lyapunov and barrier functions with input constraints

Control Lyapunov functions (CLFs) and control barrier functions (CBFs) a...
research
09/27/2017

On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity

In recent years, techniques based on convex optimization and real algebr...
research
07/21/2018

T-optimal design for multivariate polynomial regression using semidefinite programming

We consider T-optimal experiment design problems for discriminating mult...
research
09/04/2018

SOS lower bounds with hard constraints: think global, act local

Many previous Sum-of-Squares (SOS) lower bounds for CSPs had two deficie...
research
09/13/2022

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant

We consider polynomial optimization problems (POP) on a semialgebraic se...
research
05/30/2023

Global minimization of polynomial integral functionals

We describe a `discretize-then-relax' strategy to globally minimize inte...
research
05/06/2020

CS-TSSOS: Correlative and term sparsity for large-scale polynomial optimization

This work proposes a new moment-SOS hierarchy, called CS-TSSOS, for solv...

Please sign up or login with your details

Forgot password? Click here to reset