Compositions of Multiple Control Barrier Functions Under Input Constraints.

Abstract

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) decouple the design of multiple CBFs, so that a CBF can be designed for each constraint function independently of other constraints, and 2) ensure that the set composed from all the CBFs together is a viability domain. Thus, a quadratic program subject to all the CBFs simultaneously is always feasible. The utility of this methodology is then demonstrated in simulation for a nonlinear orientation control system.

Bib

@inproceedings{DBLP:conf/amcc/BreedenP23,
  author       = {Joseph Breeden and
                  Dimitra Panagou},
  title        = {Compositions of Multiple Control Barrier Functions Under Input Constraints},
  booktitle    = {American Control Conference, {ACC} 2023, San Diego, CA, USA, May 31
                  - June 2, 2023},
  pages        = {3688--3695},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.23919/ACC55779.2023.10156625},
  doi          = {10.23919/ACC55779.2023.10156625},
  timestamp    = {Tue, 11 Jul 2023 16:44:32 +0200},
  biburl       = {https://dblp.org/rec/conf/amcc/BreedenP23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}