Distributed realizations of coupled safety filters
Develop recursively feasible distributed implementations of the coupled multi-quadrotor HOCBF safety optimization and characterize whether safety-filter-induced undesired equilibria can emerge.
References
Recursively feasible distributed implementations and the possible emergence of safety-filter-induced undesired equilibria are left for future work.
Theorem~\ref{thm:invariance} (proof in Appendix \ref{app:proof_thm1}) requires eq:hocbf_qcqp_prelim to be feasible at every step, and we do not establish this recursive feasibility for our hand-specified barriers.
eq:hocbf_qcqp_prelim:
$\mathbf{u}^{\mathrm{safe}} = \argmin_{\mathbf{u}\in\mathcal{U}} \ \|\mathbf{u}-\mathbf{u}^{\mathrm{nom}}\|_2^2 \quad \text{s.t. } \eqref{eq:dt_hocbf_condition} \text{ for all } i\in\mathcal{I}. $
Joint feasibility of the constraints from several obstacles is assumed and not established. Future work will address joint feasibility for multiple obstacles, simulations with several required nonnegative eigenvalues, and applications to unmanned aerial vehicles and legged robots under noise and uncertainty.
Each of these requirements has been treated individually: avoids infeasibility in the absence of unknown disturbances, and combines robustness with input bounds for a single barrier, yet their combination for multiple simultaneous obstacles remains open.