# Tight Remainder-Form Decomposition Functions with Applications to Constrained Reachability and Guaranteed State Estimation

arXiv: https://arxiv.org/abs/2103.08638 · HTML: https://mlsanity.com/paper/2103.08638/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 15 Mar 2021.

## Built on by (most cited first, 1 of 1)

- [Efficient Interaction-Aware Interval Analysis of Neural Network Feedback Loops](https://mlsanity.com/paper/2307.14938/) (2023)

## Abstract (arXiv)

This paper proposes a tractable family of remainder-form mixed-monotone decomposition functions that are useful for over-approximating the image set of nonlinear mappings in reachability and estimation problems. Our approach applies to a new class of nonsmooth, discontinuous nonlinear systems that we call either-sided locally Lipschitz semicontinuous (ELLS) systems, which we show to be a strict superset of locally Lipschitz continuous (LLC) systems, thus expanding the set of systems that are formally known to be mixed-monotone. In addition, we derive lower and upper bounds for the over-approximation error and show that the lower bound is achieved with our proposed approach, i.e., our approach constructs the tightest, tractable remainder-form mixed-monotone decomposition function. Moreover, we introduce a set inversion algorithm that along with the proposed decomposition functions, can be used for constrained reachability analysis and guaranteed state estimation for continuous- and discrete-time systems with bounded noise.