teaching/mtl-aas
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

first draft of python implementation of lexicographic parameter synth

Browse source
This commit is contained in:
Marcell Vazquez-Chanlatte 2016-10-09 00:19:34 -07:00
parent 0b69607924
commit 72f7dd2386
1 changed files with 29 additions and 11 deletions
Download patch file Download diff file Expand all files Collapse all files

40
robustness.py
View file

@ -4,6 +4,7 @@ from operator import sub, add
from lenses import lens from lenses import lens
import stl.ast import stl.ast
from stl.utils import set_params, param_lens
@singledispatch @singledispatch
@ -24,15 +25,15 @@ def _(stl):
@pointwise_robustness.register(stl.F) @pointwise_robustness.register(stl.F)
def _(stl): def _(stl):
lo, hi = stl.interval lo, hi = stl.interval
return lambda x, t: max(pointwise_robustness(stl.arg)(x, t + t2) return lambda x, t: max((pointwise_robustness(stl.arg)(x, t + t2)
for t2 in x[lo:hi].index) for t2 in x[lo:hi].index), default=float('inf'))
@pointwise_robustness.register(stl.G) @pointwise_robustness.register(stl.G)
def _(stl): def _(stl):
lo, hi = stl.interval lo, hi = stl.interval
return lambda x, t: min(pointwise_robustness(stl.arg)(x, t + t2) return lambda x, t: min((pointwise_robustness(stl.arg)(x, t + t2)
for t2 in x[lo:hi].index) for t2 in x[lo:hi].index), default=-float('inf'))
@pointwise_robustness.register(stl.Neg) @pointwise_robustness.register(stl.Neg)
@ -64,16 +65,22 @@ def eval_term(x, t):
return lambda term: term.coeff*x[term.id.name][t] return lambda term: term.coeff*x[term.id.name][t]
def binsearch(stleval, *, tol=1e-3, lo, hi): def binsearch(stleval, *, tol=1e-3, lo, hi, polarity):
"""Only run search if tightest robustness was positive.""" """Only run search if tightest robustness was positive."""
# Only check low since hi taken care of by precondition. # Only check low since hi taken care of by precondition.
r = stleval(lo) r = stleval(lo)
if r > 0 or abs(r) < tol:
return r, lo
while abs(r) < tol: # TODO: early termination by bounds checks
mid = lo
if abs(r) < tol:
return r, mid
while abs(r) > tol and hi - lo > tol:
mid = lo + (hi - lo) / 2 mid = lo + (hi - lo) / 2
r = stleval(mid) r = stleval(mid)
print(lo, mid, hi, r)
if polarity: # swap direction
r *= -1
if r < 0: if r < 0:
lo, hi = mid, hi lo, hi = mid, hi
else: else:
@ -82,9 +89,20 @@ def binsearch(stleval, *, tol=1e-3, lo, hi):
def lex_param_project(stl, x, *, order, polarity, ranges, tol=1e-3): def lex_param_project(stl, x, *, order, polarity, ranges, tol=1e-3):
val = {var: (ranges[0] if polarity[var] else ranges[1]) for var in order} val = {var: (ranges[var][0] if polarity[var] else ranges[var][1]) for var in order}
# TODO: evaluate top paramater # TODO: evaluate top paramater
p_lens = param_lens(stl)
def stleval_fact(var, val):
l = lens(val)[var]
return lambda p: pointwise_robustness(set_params(stl, l.set(p)))(x, 0)
for var in order: for var in order:
r, param = binsearch() #TODO print(val)
# TODO: update val stleval = stleval_fact(var, val)
lo, hi = ranges[var]
_, param = binsearch(stleval, lo=lo, hi=hi, tol=tol, polarity=polarity[var])
val[var] = param
return val return val