Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Tight Remainder-Form Decomposition Functions with Applications to Constrained Reachability and Guaranteed State Estimation (2103.08638v2)

Published 15 Mar 2021 in math.OC, cs.SY, and eess.SY

Abstract: 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.

Citations (18)

Summary

We haven't generated a summary for this paper yet.