Abstract
We have seen that the use of CBFs introduces a trade-off between guaranteeing safe system behavior on one hand and conservativeness in the choice of control on the other. The latter may in turn adversely affect system performance. In our effort to ensure the feasibility of safety-guaranteeing solutions to the basic OCP, the selection of CBFs may be overly conservative, an issue that we addressed in Chap. 4 by using the penalty method. This approach works well when the control bounds are fixed and the system behavior is assumed to be noise-free. In this chapter, we introduce adaptive CBFs to guarantee safety and feasibility under time-varying control bounds and noisy dynamics, which also addresses the conservativeness issue. We introduce two different forms of adaptive CBFs: parameter-adaptive CBFs and relaxation-adaptive CBFs in Sects. 6.2 and 6.3, respectively. The type of adaptivity we propose here for CBFs is different from traditional adaptive control and we begin by briefly discussing this distinction in Sect. 6.1. Simulation examples showing the applicability of the two methods developed in this chapter for the ACC case study considered throughout the book are presented in Sects. 6.2.3 and 6.3.3.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Xiao, W., Cassandras, C.G., Belta, C. (2023). Adaptive Control Barrier Functions. In: Safe Autonomy with Control Barrier Functions. Synthesis Lectures on Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-031-27576-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-27576-0_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-27575-3
Online ISBN: 978-3-031-27576-0
eBook Packages: Synthesis Collection of Technology (R0)eBColl Synthesis Collection 12