2021
DOI: 10.1109/lcsys.2020.3001875
|View full text |Cite
|
Sign up to set email alerts
|

A Smooth Robustness Measure of Signal Temporal Logic for Symbolic Control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
66
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 64 publications
(66 citation statements)
references
References 18 publications
0
66
0
Order By: Relevance
“…This means that for STL specifications written in Postive Normal Form (PNF) [4], if the resulting smooth robustnessρ ϕ is positive, then the signal must satisfy the specification. For further details on this approach, we refer the interested reader to [7]. By replacing ρ ϕ with the smooth approximationρ ϕ , the optimization (3) becomes smooth, and can be solved with gradient-based techniques like SQP.…”
Section: Signal Temporal Logicmentioning
confidence: 99%
See 4 more Smart Citations
“…This means that for STL specifications written in Postive Normal Form (PNF) [4], if the resulting smooth robustnessρ ϕ is positive, then the signal must satisfy the specification. For further details on this approach, we refer the interested reader to [7]. By replacing ρ ϕ with the smooth approximationρ ϕ , the optimization (3) becomes smooth, and can be solved with gradient-based techniques like SQP.…”
Section: Signal Temporal Logicmentioning
confidence: 99%
“…Smoothness is relatively easy to address: we simply use a smooth approximation of the robustness [7],ρ ϕ . As noted in Section II,ρ ϕ < ρ ϕ for ϕ in PNF, and as k i → ∞,ρ ϕ → ρ ϕ .…”
Section: Differential Dynamic Programming For Signal Temporal Logicmentioning
confidence: 99%
See 3 more Smart Citations