LIRRA  1.0.0
Loading...
Searching...
No Matches
rl_stl.synthesis.check.CompiledWindows Class Reference

Public Member Functions

 __init__ (self, RecedingProblem problem, int first_window)
 
np.ndarray table (self, np.ndarray X, History history, int|None root_age)
 
tuple[np.ndarray, np.ndarray] tube_arrays (self, int off)
 
list[tuple[np.ndarray, np.ndarray]] faces (self)
 
float __call__ (self, np.ndarray X, History history, int|None root_age)
 

Public Attributes

 p
 
 A
 
 b
 
 absAC
 
 AC
 
 irows
 
 ia_lo
 
 ia_hi
 
 ib_hi
 
 absC
 

Protected Member Functions

int _leaf (self, LinearPredicate node)
 
np.ndarray _ilower (self, np.ndarray Y, np.ndarray R)
 
 _build (self, STLFormula node, np.ndarray ts)
 
None _interval_table (self, np.ndarray tab, np.ndarray Y, np.ndarray Z, History history, int|None root_age)
 
np.ndarray _boolean (self, np.ndarray v, int|None age)
 

Protected Attributes

 _fn
 
 _faces
 

Static Protected Attributes

dict _COMPILED = {}
 

Detailed Description

``rho_lower`` of the enforced windows via precompiled gathers (fast runtime check).

Constructor & Destructor Documentation

◆ __init__()

rl_stl.synthesis.check.CompiledWindows.__init__ (   self,
RecedingProblem  problem,
int  first_window 
)

Member Function Documentation

◆ __call__()

float rl_stl.synthesis.check.CompiledWindows.__call__ (   self,
np.ndarray  X,
History  history,
int | None  root_age 
)

◆ _boolean()

np.ndarray rl_stl.synthesis.check.CompiledWindows._boolean (   self,
np.ndarray  v,
int | None  age 
)
protected

◆ _build()

rl_stl.synthesis.check.CompiledWindows._build (   self,
STLFormula  node,
np.ndarray  ts 
)
protected

◆ _ilower()

np.ndarray rl_stl.synthesis.check.CompiledWindows._ilower (   self,
np.ndarray  Y,
np.ndarray  R 
)
protected
``(P_I, T)`` lower endpoints of the interval predicates over the boxes ``[Y - R, Y + R]``.

◆ _interval_table()

None rl_stl.synthesis.check.CompiledWindows._interval_table (   self,
np.ndarray  tab,
np.ndarray  Y,
np.ndarray  Z,
History  history,
int | None  root_age 
)
protected
Overwrite the interval predicates' rows of ``tab`` (same semantics as the MILP).

◆ _leaf()

int rl_stl.synthesis.check.CompiledWindows._leaf (   self,
LinearPredicate  node 
)
protected

◆ faces()

list[tuple[np.ndarray, np.ndarray]] rl_stl.synthesis.check.CompiledWindows.faces (   self)

◆ table()

np.ndarray rl_stl.synthesis.check.CompiledWindows.table (   self,
np.ndarray  X,
History  history,
int | None  root_age 
)

◆ tube_arrays()

tuple[np.ndarray, np.ndarray] rl_stl.synthesis.check.CompiledWindows.tube_arrays (   self,
int  off 
)
``(Z (N, n) for i = 1..N, KZ (N, m) for i = 0..N-1)`` (cached per root age).

Member Data Documentation

◆ _COMPILED

dict rl_stl.synthesis.check.CompiledWindows._COMPILED = {}
staticprotected

◆ _faces

rl_stl.synthesis.check.CompiledWindows._faces
protected

◆ _fn

rl_stl.synthesis.check.CompiledWindows._fn
protected

◆ A

rl_stl.synthesis.check.CompiledWindows.A

◆ absAC

rl_stl.synthesis.check.CompiledWindows.absAC

◆ absC

rl_stl.synthesis.check.CompiledWindows.absC

◆ AC

rl_stl.synthesis.check.CompiledWindows.AC

◆ b

rl_stl.synthesis.check.CompiledWindows.b

◆ ia_hi

rl_stl.synthesis.check.CompiledWindows.ia_hi

◆ ia_lo

rl_stl.synthesis.check.CompiledWindows.ia_lo

◆ ib_hi

rl_stl.synthesis.check.CompiledWindows.ib_hi

◆ irows

rl_stl.synthesis.check.CompiledWindows.irows

◆ p

rl_stl.synthesis.check.CompiledWindows.p

The documentation for this class was generated from the following file: