Scalable safety verification with simultaneous accuracy and efficiency for high-dimensional systems
Develop safety verification techniques for high-dimensional dynamical systems that simultaneously achieve rigorous accuracy and computational efficiency, overcoming the curse of dimensionality that affects Hamilton–Jacobi reachability and mixed-integer programming-based verification approaches.
References
Although decomposition techniques and neural approximations have been proposed, ensuring both accuracy and efficiency remains a critical open problem.
While some are accurate and all have polynomial-time complexity, it is not clear that they are fast or simple enough for time-domain distance protection.
Control barrier functions and reachability analysis can define safe sets for low-level control, though scaling them to perception-conditioned, multi-agent, high-dimensional E2E policies remains difficult.
The methods that this review discusses aspire to address one or more of these concerns, with overcoming the computational bottlenecks being the main research achievement and dealing with the hard epistemic barriers remaining a yet unresolved research challenge.