TY - GEN
T1 - Data-Efficient Control Barrier Function Refinement
AU - Dai, Bolun
AU - Huang, Heming
AU - Krishnamurthy, Prashanth
AU - Khorrami, Farshad
N1 - Funding Information:
This work was supported in part by ARO grant W911NF-22-1-0028 and in part by the New York University Abu Dhabi (NYUAD) Center for Artificial Intelligence and Robotics, funded by Tamkeen under the NYUAD Research Institute Award CG010.
Publisher Copyright:
© 2023 American Automatic Control Council.
PY - 2023
Y1 - 2023
N2 - Control barrier functions (CBFs) have been widely used for synthesizing controllers in safety-critical applications. When used as a safety filter, a CBF provides a simple and computationally efficient way to obtain safe controls from a possibly unsafe performance controller. Despite its conceptual simplicity, constructing a valid CBF is well known to be challenging, especially for high-relative degree systems under nonconvex constraints. Recently, work has been done to learn a valid CBF from data based on a handcrafted CBF (HCBF). Even though the HCBF gives a good initialization point, it still requires a large amount of data to train the CBF network. In this work, we propose a new method to learn more efficiently from the collected data through a novel prioritized data sampling strategy. A priority score is computed from the loss value of each data point. Then, a probability distribution based on the priority score of the data points is used to sample data and update the learned CBF. Using our proposed approach, we can learn a valid CBF that recovers a larger portion of the true safe set using a smaller amount of data. The effectiveness of our method is demonstrated in simulation on a two-link arm.
AB - Control barrier functions (CBFs) have been widely used for synthesizing controllers in safety-critical applications. When used as a safety filter, a CBF provides a simple and computationally efficient way to obtain safe controls from a possibly unsafe performance controller. Despite its conceptual simplicity, constructing a valid CBF is well known to be challenging, especially for high-relative degree systems under nonconvex constraints. Recently, work has been done to learn a valid CBF from data based on a handcrafted CBF (HCBF). Even though the HCBF gives a good initialization point, it still requires a large amount of data to train the CBF network. In this work, we propose a new method to learn more efficiently from the collected data through a novel prioritized data sampling strategy. A priority score is computed from the loss value of each data point. Then, a probability distribution based on the priority score of the data points is used to sample data and update the learned CBF. Using our proposed approach, we can learn a valid CBF that recovers a larger portion of the true safe set using a smaller amount of data. The effectiveness of our method is demonstrated in simulation on a two-link arm.
UR - http://www.scopus.com/inward/record.url?scp=85159394936&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85159394936&partnerID=8YFLogxK
U2 - 10.23919/ACC55779.2023.10156295
DO - 10.23919/ACC55779.2023.10156295
M3 - Conference contribution
AN - SCOPUS:85159394936
T3 - Proceedings of the American Control Conference
SP - 3675
EP - 3680
BT - 2023 American Control Conference, ACC 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2023 American Control Conference, ACC 2023
Y2 - 31 May 2023 through 2 June 2023
ER -