|
LIRRA
1.0.0
|
LIRRA reduces how often a vehicle has to solve an expensive signal temporal logic (STL) synthesis problem online, while ensuring that the specification stays recursively feasible for receding-horizon planning.
Showreel of the 3-D experiments (6 min): the Skydio X2 quadrotor and the GT-MAB blimp patrolling around the restricted cube S under the four cube specifications θ, φ, θ⁺ and φ⁺, each introduced by a title card. Status bar: whether the latest proposal passed the check and, if not, which condition it failed. Left: 3-D view of S, the six waypoints and the plan in force (blue: accepted proposal, yellow: solver, grey: cached). Right: MuJoCo view, realized robustness, and the interval robustness of each proposal against the threshold δ. Every vehicle and specification has its own clip on the Videos page.
Robots are asked to meet deadlines, time windows and recurring obligations, not just to stay inside a safe set: leave a region within a few seconds of entering it, return to a station every lap, stay out of an area once you have left it. STL expresses such requirements, and for linear models with affine predicates a satisfying trajectory can be synthesized as a mixed-integer linear program (MILP).
Finding a satisfying trajectory over the planning horizon is not enough. A receding-horizon controller replans at every step, and a plan that satisfies every window it can see may still lead somewhere from which no satisfying continuation exists. Many receding-horizon STL controllers simply assume that the next problem will be feasible, or relax the specification when it is not. Recursive feasibility removes that assumption: if the problem is feasible now, a feasible continuation is guaranteed to exist at every later step, so the specification holds for the whole mission.
Satisfying a specification for a nominal trajectory says little once disturbances and modeling errors act on the real vehicle. Uncertainty can also sit in the specification itself, for example when the position or size of a restricted region is only known within bounds. Interval STL (I-STL) handles both by evaluating robustness over interval-valued signals and predicates, giving a lower bound that holds for every admissible realization. This supports requirements ranging from avoiding an uncertain obstacle to entering and later leaving a region whose boundary is uncertain.
LIRRA builds on the I-STL runtime assurance of Baird, Morales-Cuadrado and Coogan, which combines I-STL with persistently feasible terminal sets to guarantee recursive feasibility under bounded uncertainty, and keeps a safe backup input available even when the solver misses a deadline. Its price is one MILP per planning step, a heavy load for a small vehicle's onboard computer.
LIRRA's acceptance test is the I-STL synthesis program itself, so it inherits this treatment of uncertainty unchanged. In the case studies the uncertainty comes from the mismatch between each MuJoCo vehicle and its linear planning model, bounded by a tracking tube, and from bounded disturbances on the double integrator.
A learned controller is cheap to evaluate, but on its own it guarantees neither specification satisfaction nor recursive feasibility. LIRRA keeps the synthesis problem as the definition of what is safe to fly, and uses a learned policy only to propose solutions to it:
Because the cached plan, shifted and extended by the terminal controller, is always a feasible point of the next program, a certified input exists at every step, including while a solve is pending or after it misses its deadline. Specification satisfaction therefore holds for any proposer; training only decides how often synthesis is needed.
Relative to synthesis-based I-STL runtime assurance, LIRRA contributes:
Eight specifications (the NAHS formulas θ and φ, on the planar square and on a 3-D cube, with exact and with uncertain boundaries), two MuJoCo vehicles, 30 episodes each; see Case Studies:
stlpy-style interface) with error-age-indexed tubes and verified control-invariant terminal sets