Skip to content

Article

SparseMax-dSTL: Sparse-Projection Robust Approximation for Temporal-Logic Trajectory Optimization

arXiv cs.RO

SparseMax-dSTL proposes a smooth approximation of Signal Temporal Logic (STL) robustness based on sparse projection; its value always lies below the exact robustness and is therefore sound, and its error bound is independent of the number of samples and can be determined before optimization.

Part of the event: SparseMax-dSTL: Sparse Projection Approximation of STL Robustness

This page provides a summary and source link only.