It has been shown that optimizing quadratic costs while stabilizing affine control systems to desired (sets of) states subject to state and control constraints can be reduced to a sequence of Quadratic Programs (QPs) by using Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs). In this paper, we employ machine learning techniques to ensure the feasibility of these QPs, which is a challenging problem, especially for high relative degree constraints where High Order CBFs (HOCBFs) are required. To this end, we propose a sampling-based learning approach to learn a new feasibility constraint for CBFs; this constraint is then enforced by another HOCBF added to the QPs. The accuracy of the learned feasibility constraint is recursively improved by a recurrent training algorithm. We demonstrate the advantages of the proposed learning approach to constrained optimal control problems with specific focus on a robot control problem and on autonomous driving in an unknown environment.
It has been shown that satisfying state and control constraints while optimizing quadratic costs subject to desired (sets of) state convergence for affine control systems can be reduced to a sequence of quadratic programs (QPs) by using Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs). One of the main challenges in this approach is ensuring the feasibility of these QPs, especially under tight control bounds and safety constraints of high relative degree. In this paper, we provide sufficient conditions for guranteed feasibility. The sufficient conditions are captured by a …
Safety is one of the fundamental problems in robotics. Recently, one-step or multi-step optimal control problems for discrete-time nonlinear dynamical system were formulated to offer tracking stability using control Lyapunov functions (CLFs) while subject to input constraints as well as safety-critical constraints using control barrier functions (CBFs). The limitations of these existing approaches are mainly about feasibility and safety. In the existing approaches, the feasibility of the optimization and the system safety cannot be enhanced at the same time theoretically. In this paper, we pro…
University of Pennsylvania（宾夕法尼亚大学）；Google Brain Robotics（谷歌大脑机器人部门）
The need for robust control laws is especially important in safety-critical applications. We propose robust hybrid control barrier functions as a means to synthesize control laws that ensure robust safety. Based on this notion, we formulate an optimization problem for learning robust hybrid control barrier functions from data. We identify sufficient conditions on the data such that feasibility of the optimization problem ensures correctness of the learned robust hybrid control barrier functions. Our techniques allow us to safely expand the region of attraction of a compass gait walker that is …
KTH Royal Institute of Technology（瑞典皇家理工学院）；University of Pennsylvania（宾夕法尼亚大学）；Google Brain Robotics（谷歌大脑机器人）
Motivated by the lack of systematic tools to obtain safe control laws for hybrid systems, we propose an optimization-based framework for learning certifiably safe control laws from data. In particular, we assume a setting in which the system dynamics are known and in which data exhibiting safe system behavior is available. We propose hybrid control barrier functions for hybrid systems as a means to synthesize safe control inputs. Based on this notion, we present an optimization-based framework to learn such hybrid control barrier functions from data. Importantly, we identify sufficient conditi…
This contribution introduces a centralized input constrained optimal control framework based on multiple control barrier functions (CBFs) to coordinate connected and automated agents at intersections. For collision avoidance, we propose a novel CBF which is safe by construction. The given control scheme provides provable guarantees that collision avoidance CBFs and CBFs to constrain the agents' velocity are jointly feasible (referred to as control-sharing property) subject to input constraints. A simulation study finally provides evidence that the proposed control scheme is safe.
For a broad class of nonlinear systems, we formulate the problem of guaranteeing safety with optimality under constraints. Specifically, we define controlled safety for differential inclusions with constraints on the states and the inputs. Through the use of nonsmooth analysis tools, we show that a continuous optimal control law can be selected from a set-valued constraint capturing the system constraints and conditions guaranteeing safety using control barrier functions. Our results guarantee optimality and safety via a continuous state-feedback law designed using nonsmooth control barrier fu…
Optimal control problems with constraints ensuring safety and convergence to desired states can be mapped onto a sequence of real time optimization problems through the use of Control Barrier Functions (CBFs) and Control Lyapunov Functions (CLFs). One of the main challenges in these approaches is ensuring the feasibility of the resulting quadratic programs (QPs) if the system is affine in controls. The recently proposed penalty method has the potential to improve the existence of feasible solutions to such problems. In this paper, we further improve the feasibility robustness (i.e., feasibilit…
This paper presents methodologies for ensuring forward invariance of sublevel sets of constraint functions with high-relative-degree with respect to the system dynamics and in the presence of input constraints. We show that such constraint functions can be converted into special Zeroing Control Barrier Functions (ZCBFs), which, by construction, generate sufficient conditions for rendering the state always inside a sublevel set of the constraint function in the presence of input constraints. We present a general form for one such ZCBF, as well as a special case applicable to a specific class of…
This paper presents a methodology for ensuring that the composition of multiple Control Barrier Functions (CBFs) always leads to feasible conditions on the control input, even in the presence of input constraints. In the case of a system subject to a single constraint function, there exist many methods to generate a CBF that ensures constraint satisfaction. However, when there are multiple constraint functions, the problem of finding and tuning one or more CBFs becomes more challenging, especially in the presence of input constraints. This paper addresses this challenge by providing tools to 1…
Maximal Controlled Invariant-MPC: Enhancing Feasibility and Reducing Conservatism through Terminal CBF Constraint in Safety-Critical Control
Graduate Student, Daniel Guggenheim School of Aerospace Engineering（丹尼尔·古吉恩航空航天工程学院研究生）；Assistant Professor, Director, Aerospace Robotics Lab, Daniel Guggenheim School of Aerospace Engineering（丹尼尔·古吉恩航空航天工程学院助理教授、主任、航空航天机器人实验室）
Feasibility Analysis and Constraint Selection in Optimization-Based Controllers
Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology（决策与控制系统系，电气工程与计算机科学学院，皇家理工学院）；Department of Robotics, University of Michigan（机器人系，密歇根大学）；Department of Aerospace Engineering, University of Michigan（航空航天工程系，密歇根大学）
State and input constraints are ubiquitous in control system design. One recently developed tool to deal with these constraints is control barrier functions (CBF) which transform state constraints into conditions in the input space. CBF-based controller design thus incorporates both the CBF conditions and input constraints in a quadratic program. However, the CBF-based controller is well-defined only if the CBF conditions are compatible. In the case of perturbed systems, robust compatibility is of relevance. In this work, we propose an algorithmic solution to verify or falsify the (robust) com…
A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
The backup control barrier function (CBF) was recently proposed as a tractable formulation that guarantees the feasibility of the CBF quadratic programming (QP) via an implicitly defined control invariant set. The control invariant set is based on a fixed backup policy and evaluated online by forward integrating the dynamics under the backup policy. This paper is intended as a tutorial of the backup CBF approach and a comparative study to some benchmarks. First, the backup CBF approach is presented step by step with the underlying math explained in detail. Second, we prove that the backup CBF …
In this paper, we introduce the notion of periodic safety, which requires that the system trajectories periodically visit a subset of a forward-invariant safe set, and utilize it in a multi-rate framework where a high-level planner generates a reference trajectory that is tracked by a low-level controller under input constraints. We introduce the notion of fixed-time barrier functions which is leveraged by the proposed low-level controller in a quadratic programming framework. Then, we design a model predictive control policy for high-level planning with a bound on the rate of change for the r…
We study tracking control for nonlinear systems with known relative degree and stable internal dynamics by the recently introduced technique of Funnel MPC. The objective is to achieve the evolution of the tracking error within a prescribed performance funnel. We propose a novel stage cost for Funnel MPC, extending earlier designs to the case of arbitrary relative degree, and show that the control objective as well as initial and recursive feasibility are always achieved - without requiring any terminal conditions or a sufficiently long prediction horizon. We only impose an additional feasibili…
In this paper, we propose an extension to mixed multidimensional constraints of the problem of state and input constrained control introduced in DeDona and Lévine, SIAM J. Control and Optimiz., Vol. 51, 2013, where the admissible set, namely the subset of the state space where the state and input constraints can be satisfied for all times, was studied, with focus on its boundary. The latter may be divided in two parts, one of them being called barrier, a semipermeable surface. We extend this notion of barrier to the mixed case and prove that it can be constructed via a minimum-like principle i…
This paper is concerned with solving chance-constrained finite-horizon optimal control problems, with a particular focus on the recursive feasibility issue of stochastic model predictive control (SMPC) in terms of mission-wide probability of safety (MWPS). MWPS assesses the probability that the entire state trajectory lies within the constraint set, and the objective of the SMPC controller is to ensure that it is no less than a threshold value. This differs from classic SMPC where the probability that the state lies in the constraint set is enforced independently at each time instant. Unlike r…
In this paper, we propose a novel approach to synthesize linear feedback controllers for navigating in polygonal environments using noisy measurements and a convex cell decomposition. Our method is based on formulating chance constraints for the convergence and collision avoidance condition. In particular, the stability and safety guarantees come from chance Control Barrier Function (CBF) constraints and chance Control Lyapunov Function (CLF) constraints, respectively. We use convex over-approximations to get upper bounds of the constraints, leading to a convex robust quadratic program for fin…
Resource allocation plays a central role in many networked systems such as smart grids, communication networks and urban transportation systems. In these systems, many constraints have physical meaning and having feasible allocation is often vital to avoid system breakdown. Hence, algorithms with asymptotic feasibility guarantees are often insufficient since it is impractical to run algorithms for an infinite number of rounds. This paper proposes a distributed feasible method (DFM) for safe resource allocation based on barrier functions. In DFM, every iterate is feasible and thus safe to imple…
Feasibility Determination for Subjective Probability Constraints
Korea Military Academy（韩国军事学院）；H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology（佐治亚理工学院 H. 米尔顿·斯图尔特工业与系统工程学院）；Kelley School of Business, Indiana University（印第安纳大学凯利商学院）
We consider a stochastic linear system and address the design of a finite horizon control policy that is optimal according to some average cost criterion and accounts also for probabilistic constraints on both the input and state variables. This finite horizon control problem formulation is quite common in the literature and has potential for being implemented in a receding horizon fashion according to the model predictive control strategy. Such a possibility, however, is hampered by the fact that, if the disturbance has unbounded support, a feasibility issue may arise. In this paper, we addre…
In this paper we study a feasibility-seeking problem with percentage violation constraints. These are additional constraints, that are appended to an existing family of constraints, which single out certain subsets of the existing constraints and declare that up to a specified fraction of the number of constraints in each subset is allowed to be violated by up to a specified percentage of the existing bounds. Our motivation to investigate problems with percentage violation constraints comes from the field of radiation therapy treatment planning wherein the fully-discretized inverse planning pr…
Euclidean distance matrix optimization with ordinal constraints (EDMOC) has found important applications in sensor network localization and molecular conformation. It can also be viewed as a matrix formulation of multidimensional scaling, which is to embed n points in a $r$-dimensional space such that the resulting distances follow the ordinal constraints. The ordinal constraints, though proved to be quite useful, may result in only zero solution when too many are added, leaving the feasibility of EDMOC as a question. In this paper, we first study the feasibility of EDMOC systematically. We sh…
We consider sampled-data Model Predictive Control (MPC) of nonlinear continuous-time control systems. We derive sufficient conditions to guarantee recursive feasibility and asymptotic stability without stabilising costs and/or constraints. Moreover, we present formulas to explicitly estimate the required length of the prediction horizon based on the concept of (local) cost controllability. For the linear-quadratic case, cost controllability can be inferred from standard assumptions. In addition, we extend results on the relationship between the horizon length and the distance of the initial st…
The convex restriction of the power flow feasible sets identifies the convex subset of power injections where the solution for power flow is guaranteed to exist and satisfy the operational constraints. In contrast to convex relaxations, the convex restriction provides a sufficient condition for power flow feasibility and is particularly useful for problems involving uncertainty in the power generation and demand. In this paper, we present a general framework of constructing convex restriction of an algebraic set defined by equality and inequality constraints and apply the framework to power fl…
In this paper, the distributed resource allocation optimization problem is investigated. The allocation decisions are made to minimize the sum of all the agents' local objective functions while satisfying both the global network resource constraint and the local allocation feasibility constraints. Here the data corresponding to each agent in this separable optimization problem, such as the network resources, the local allocation feasibility constraint, and the local objective function, is only accessible to individual agent and cannot be shared with others, which renders new challenges in this…
