Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 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

Convexity of reachable sets of nonlinear ordinary differential equations (1211.6080v1)

Published 26 Nov 2012 in math.OC and cs.SY

Abstract: We present a necessary and sufficient condition for the reachable set, i.e., the set of states reachable from a ball of initial states at some time, of an ordinary differential equation to be convex. In particular, convexity is guaranteed if the ball of initial states is sufficiently small, and we provide an upper bound on the radius of that ball, which can be directly obtained from the right hand side of the differential equation. In finite dimensions, our results cover the case of ellipsoids of initial states. A potential application of our results is inner and outer polyhedral approximation of reachable sets, which becomes extremely simple and almost universally applicable if these sets are known to be convex. We demonstrate by means of an example that the balls of initial states for which the latter property follows from our results are large enough to be used in actual computations.

Citations (24)

Summary

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