pacSTL: PAC-Bounded Signal Temporal Logic from Data-Driven Reachability Analysis
By: Elizabeth Dietrich , Hanna Krasowski , Emir Cem Gezer and more
Potential Business Impact:
Helps robots stay safe when they aren't sure.
Real-world robotic systems must comply with safety requirements in the presence of uncertainty. To define and measure requirement adherence, Signal Temporal Logic (STL) offers a mathematically rigorous and expressive language. However, standard STL cannot account for uncertainty. We address this problem by presenting pacSTL, a framework that combines Probably Approximately Correct (PAC) bounded set predictions with an interval extension of STL through optimization problems on the atomic proposition level. pacSTL provides PAC-bounded robustness intervals on the specification level that can be utilized in monitoring. We demonstrate the effectiveness of this approach through maritime navigation and analyze the efficiency and scalability of pacSTL through simulation and real-world experimentation on model vessels.
Similar Papers
Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis
Logic in Computer Science
Checks if complex systems follow rules precisely.
Cumulative-Time Signal Temporal Logic
Logic in Computer Science
Lets computers track how long things happen.
Trajectory Planning with Signal Temporal Logic Costs using Deterministic Path Integral Optimization
Systems and Control
Teaches robots to follow complex instructions precisely.