Computing Safe Control Inputs using Discrete-Time Matrix Control Barrier Functions via Convex Optimization
Control barrier functions (CBFs) have seen widespread success in providing forward invariance and safety guarantees for dynamical control systems. A crucial limitation of discrete-time formulations is that CBFs that are nonconcave in their argument require the solution of nonconvex optimization problems to compute safety-preserving control inputs, which inhibits real-time computation of control inputs guaranteeing forward invariance. This paper presents a novel method for computing safety-preserving control inputs for discrete-time systems with nonconvex safety sets, utilizing convex optimization and the recently developed class of matrix control barrier function techniques. The efficacy of our methods is demonstrated through numerical simulations on a bicopter system.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Controlled Reach-avoid Set Computation for Discrete-time Polynomial Systems via Convex Optimization
This paper addresses the computation of controlled reach-avoid sets (CRASs) for discrete-time polynomial systems subject to control inputs. A CRAS is a set encompassing initial states from which there exist control input…
Robust Safety under Stochastic Uncertainty with Discrete-Time Control Barrier Functions
Robots deployed in unstructured, real-world environments operate under considerable uncertainty due to imperfect state estimates, model error, and disturbances. Given this real-world context, the goal of this paper is to…
Preventing Unconstrained CBF Safety Filters Caused by Invalid Relative Degree Assumptions
Control barrier function (CBF)-based safety filters are used to certify and modify potentially unsafe control inputs to a system such as those provided by a reinforcement learning agent or a non-expert user. In this cont…
Learning Safety Filters for Unknown Discrete-Time Linear Systems
A learning-based safety filter is developed for discrete-time linear time-invariant systems with unknown models subject to Gaussian noises with unknown covariance. Safety is characterized using polytopic constraints on t…
Safe Approximate Dynamic Programming Via Kernelized Lipschitz Estimation
We develop a method for obtaining safe initial policies for reinforcement learning via approximate dynamic programming (ADP) techniques for uncertain systems evolving with discrete-time dynamics. We employ kernelized Lip…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)